A class of I.P.P. codes with efficient identification

DOI10.1016/J.JCO.2003.08.012MaRDI QIDQ1827562zbMATH OpenOpenAlexFDO

Authors Alexander Barg, Grigory Kabatiansky

Publication date 6 August 2004

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jco.2003.08.012

zbMATH Keywords

TraceabilityList decodingCode concatenationDigital finger printingIdentifiable parent property

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Optimal codes for strong identification
• On strongly identifying codes
• Improved identification schemes based on error-correcting codes
• On robust and dynamic identifying codes
• Identity based identification from algebraic coding theory
• Families of optimal codes for strong identification
• On binary linear \(r\)-identifying codes
• On two variations of identifying codes
• Revisiting and improving upper bounds for identifying codes
• Bounds on identifying codes

Cites work

• scientific article; zbMATH DE number 48941 (Why is no real title available?)
• scientific article; zbMATH DE number 2081065 (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
• A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
• Collusion-secure fingerprinting for digital data
• Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
• Combinatorial properties of frameproof and traceability codes
• Digital fingerprinting codes: problem statements, constructions, identification of traitors
• Generalized hashing and parent-identifying codes.
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• On codes with the identifiable parent property
• Tracing traitors

Cited in

(16)

• A novel maximum distance separable code to generate universal identifiers
• Improved identification schemes based on error-correcting codes
• New constructions for IPP codes
• A study of the separating property in Reed-Solomon codes by bounding the minimum distance
• Traceability codes and their generalizations
• On robust and dynamic identifying codes
• New upper bounds for parent-identifying codes and traceability codes
• Constructions of \(t\)-strongly multimedia IPP codes with length \(t+1\)
• Analysis of properties of q-ary Reed-Muller error-correcting codes viewed as codes for copyright protection
• On the Maximal Codes of Length 3 with the 2-Identifiable Parent Property
• Multimedia IPP codes with efficient tracing
• A class of I.P.P. codes with efficient identification
• Traceability codes
• On generalized separating hash families
• Optimal 2-traceability codes of length 4
• Codes with the identifiable parent property for multimedia fingerprinting

Describes a project that uses

Uses Software

• I.P.P.

This page was built for publication: A class of I.P.P. codes with efficient identification

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