A note about the traceability properties of linear codes
View/Open
A Note About the Traceability Properties of (149,0Kb) (Restricted access)
Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Cita com:
hdl:2117/23108
Document typeConference report
Defense date2007
PublisherSpringer
Rights accessRestricted access - publisher's policy
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
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.
CitationFernandez, 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.
ISBN978-3-540-76787-9
Publisher versionhttp://link.springer.com/chapter/10.1007/978-3-540-76788-6_20
Files | Description | Size | Format | View |
---|---|---|---|---|
A Note About the Traceability Properties of.pdf![]() | A Note About the Traceability Properties of | 149,0Kb | Restricted access |