TY - GEN
T1 - A note about the traceability properties of linear codes
AU - Fernandez, Marcel
AU - Cotrina, Josep
AU - Soriano, Miguel
AU - Domingo, Neus
PY - 2007
Y1 - 2007
N2 - We characterize the traceability properties of linear codes. It is well known that any code of length n and minimum distance d is a c-TA code if c 2 < n/(n-d). In this paper, we show that a less restrictive condition can be derived. In other words, there exists a value Zc, with n -d ≤ Zc ≤ c(n-d), such that any linear code is c-TA if c < n/Zc. We also prove that in many cases this condition is also necessary. These results are applied to cyclic and Reed-Solomon codes.
AB - We characterize the traceability properties of linear codes. It is well known that any code of length n and minimum distance d is a c-TA code if c 2 < n/(n-d). In this paper, we show that a less restrictive condition can be derived. In other words, there exists a value Zc, with n -d ≤ Zc ≤ c(n-d), such that any linear code is c-TA if c < n/Zc. We also prove that in many cases this condition is also necessary. These results are applied to cyclic and Reed-Solomon codes.
UR - http://www.scopus.com/inward/record.url?scp=38149053040&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-76788-6_20
DO - 10.1007/978-3-540-76788-6_20
M3 - Conference contribution
AN - SCOPUS:38149053040
SN - 9783540767879
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 251
EP - 258
BT - Information Security and Cryptology - ICISC 2007 - 10th International Conference, Proceedings
PB - Springer Verlag
T2 - 10th International Conference on Information Security and Cryptology, ICISC 2007
Y2 - 29 November 2007 through 30 November 2007
ER -