Loading...
Loading...

Go to the content (press return)

A note about the traceability properties of linear codes

Author
Fernandez, M.; Cotrina, J.; Soriano, M.; Domingo, N.
Type of activity
Presentation of work at congresses
Name of edition
10th International Conference on Information Security and Cryptology
Date of publication
2007
Presentation's date
2007-11
Book of congress proceedings
Information Security and Cryptology: ICISC 2007: 10th International Conference: Seoul, Korea, November 29-30, 2007: proceedings
First page
251
Last page
258
Publisher
Springer
DOI
https://doi.org/10.1007/978-3-540-76788-6_20 Open in new window
Repository
http://hdl.handle.net/2117/23108 Open in new window
URL
http://link.springer.com/chapter/10.1007/978-3-540-76788-6_20 Open in new window
Abstract
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 Z C , with n¿-¿d¿=¿Z C ¿=¿c(n¿-¿d), such that any linear code is c-TA if c¿<¿n/Z C . We also prove that in many cases this condition is also necessary. These results are applied to cyclic and Reed-Solomon codes.
Citation
Fernandez, M. [et al.]. A note about the traceability properties of linear codes. A: International Conference on Information Security and Cryptology. "Information Security and Cryptology: ICISC 2007: 10th International Conference: Seoul, Korea, November 29-30, 2007: proceedings". Seoul: Springer, 2007, p. 251-258.
Keywords
Algorithm Analysis and Problem Complexity, Computer Communication Networks, Data Encryption, Discrete Mathematics in Computer Science, Management of Computing and Information Systems, Systems and Data Security
Group of research
ISG - Information Security Group
WNG - Wireless Networks Group

Participants