On the relationship between the traceability properties of Reed-Solomon codes
From MaRDI portal
Publication:394835
DOI10.3934/AMC.2012.6.467zbMATH Open1350.94070OpenAlexW1998827119MaRDI QIDQ394835FDOQ394835
Authors: José Moreira, Marcel Fernández, Miguel Soriano
Publication date: 28 January 2014
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2012.6.467
Recommendations
MDS codesReed-Solomon codefingerprinting and traitor tracingidentifiable parent propertyseparating codes
Cited In (9)
- A class of traceability codes
- New constructions for IPP codes
- A study of the separating property in Reed-Solomon codes by bounding the minimum distance
- Combinatorial Properties for Traceability Codes Using Error Correcting Codes
- Analysis of two tracing traitor schemes via coding theory
- Title not available (Why is that?)
- Analysis of properties of \(q\)-ary Reed-Muller error-correcting codes viewed as codes for copyright protection
- A Note About the Traceability Properties of Linear Codes
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
This page was built for publication: On the relationship between the traceability properties of Reed-Solomon codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394835)