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

DOI10.1007/S10623-021-00988-ZzbMATH Open1495.94105arXiv2103.02341OpenAlexW3134768296WikidataQ114849832 ScholiaQ114849832MaRDI QIDQ2115728FDOQ2115728

Marcel Fernández, Jorge J. Urroz

Publication date: 21 March 2022

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

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.

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)

Cites Work

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

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)