A study of the separating property in Reed-Solomon codes by bounding the minimum distance

DOI10.1007/S10623-021-00988-ZMaRDI QIDQ2115728zbMATHOpenAlexWikidataFDO

Authors Marcel Fernández, Jorge J. Urroz

Publication date 21 March 2022

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2103.02341

zbMATH Keywords

Reed-Solomon codesseparating codesIPP codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

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

Recommendations

• On the relationship between the traceability properties of Reed-Solomon codes
• A Note About the Traceability Properties of Linear Codes
• LATIN 2004: Theoretical Informatics
• Traceability codes
• Cryptography and Coding

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1406785 (Why is no real title available?)
• A class of I.P.P. codes with efficient identification
• A hypergraph approach to the identifying parent property: The case of multiple parents
• Almost separating and almost secure frameproof codes over \(q\)-ary alphabets
• Applications of list decoding to tracing traitors
• Codes with the identifiable parent property for multimedia fingerprinting
• Collusion-secure fingerprinting for digital data
• Combinatorial Properties for Traceability Codes Using Error Correcting Codes
• Combinatorial problems in finite fields and Sidon sets
• Combinatorial properties of frameproof and traceability codes
• LATIN 2004: Theoretical Informatics
• New constructions for IPP codes
• On codes with the identifiable parent property
• On the relationship between the traceability properties of Reed-Solomon codes
• Probabilistic Existence Results for Parent-Identifying Schemes
• Separating systems
• Tracing traitors

Cited in

(1)

• On the relationship between the traceability properties of Reed-Solomon codes

This page was built for publication: A study of the separating property in Reed-Solomon codes by bounding the minimum distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115728)