A note about the traceability properties of linear codes

Marcel Fernandez, Josep Cotrina, Miguel Soriano, Neus Domingo

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

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 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.

Original languageEnglish
Title of host publicationInformation Security and Cryptology - ICISC 2007 - 10th International Conference, Proceedings
PublisherSpringer Verlag
Pages251-258
Number of pages8
ISBN (Print)9783540767879
DOIs
StatePublished - 2007
Externally publishedYes
Event10th International Conference on Information Security and Cryptology, ICISC 2007 - Seoul, Korea, Republic of
Duration: Nov 29 2007Nov 30 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4817 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference10th International Conference on Information Security and Cryptology, ICISC 2007
Country/TerritoryKorea, Republic of
CitySeoul
Period11/29/0711/30/07

Fingerprint

Dive into the research topics of 'A note about the traceability properties of linear codes'. Together they form a unique fingerprint.

Cite this