2021/03/03 by Marcel Fernández, Fernandez, Marcel, Jorge Jiménez Urroz +1
Computer Science · #11H71 #68P30 #Advanced Data Storage Technologies #Cellular Automata and Applications #Coding theory and cryptography #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Number Theory (math.NT)
paper · doi:10.48550/arxiv.2103.02341
openalex publication_date 2021/03/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
According to their strength, the tracing properties of a code can be categorized as frameproof, separating, IPP and TA. It is known that if the minimum distance of the code is larger than a certain threshold then the TA property implies the rest. Silverberg et al. ask if there is some kind of tracing capability left when the minimum distance falls below the threshold. Under different assumptions, several papers have given a negative answer to the question. In this paper further progress is made. We establish values of the minimum distance for which Reed-Solomon codes do not posses the separating property.