Show simple item record

dc.contributor.authorFernández Muñoz, Marcel
dc.contributor.authorCotrina Navau, Josep
dc.contributor.authorSoriano Ibáñez, Miguel
dc.contributor.authorDomingo, Neus
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Enginyeria Telemàtica
dc.date.accessioned2014-05-30T11:47:54Z
dc.date.created2007
dc.date.issued2007
dc.identifier.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.
dc.identifier.isbn978-3-540-76787-9
dc.identifier.urihttp://hdl.handle.net/2117/23108
dc.description.abstractWe 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.
dc.format.extent8 p.
dc.language.isoeng
dc.publisherSpringer
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Informàtica::Seguretat informàtica::Criptografia
dc.subjectÀrees temàtiques de la UPC::Enginyeria de la telecomunicació
dc.subject.lcshCryptography
dc.subject.lcshComputer security
dc.subject.otherData Encryption
dc.subject.otherDiscrete Mathematics in Computer Science
dc.subject.otherSystems and Data Security
dc.subject.otherManagement of Computing and Information Systems
dc.subject.otherAlgorithm Analysis and Problem Complexity
dc.subject.otherComputer Communication Networks
dc.titleA note about the traceability properties of linear codes
dc.typeConference report
dc.subject.lemacCriptografia
dc.subject.lemacSeguretat informàtica
dc.contributor.groupUniversitat Politècnica de Catalunya. SERTEL - Serveis Telemàtics
dc.contributor.groupUniversitat Politècnica de Catalunya. WNG - Grup de xarxes sense fils
dc.identifier.doi10.1007/978-3-540-76788-6_20
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://link.springer.com/chapter/10.1007/978-3-540-76788-6_20
dc.rights.accessRestricted access - publisher's policy
drac.iddocument12934894
dc.description.versionPostprint (published version)
dc.date.lift10000-01-01
upcommons.citation.authorFernandez, M.; Cotrina, J.; Soriano, M.; Domingo, N.
upcommons.citation.contributorInternational Conference on Information Security and Cryptology
upcommons.citation.pubplaceSeoul
upcommons.citation.publishedtrue
upcommons.citation.publicationNameInformation Security and Cryptology: ICISC 2007: 10th International Conference: Seoul, Korea, November 29-30, 2007: proceedings
upcommons.citation.startingPage251
upcommons.citation.endingPage258


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 3.0 Spain