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

DOI10.1016/J.JCO.2003.08.012zbMATH Open1069.68045OpenAlexW2040167287MaRDI QIDQ1827562FDOQ1827562

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

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

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)

Cites Work

• Generalized hashing and parent-identifying codes.
• Title not available (Why is that?)
• Collusion-secure fingerprinting for digital data
• Improved decoding of Reed-Solomon and algebraic-geometry codes
• Combinatorial properties of frameproof and traceability codes
• Tracing traitors
• Digital fingerprinting codes: problem statements, constructions, identification of traitors
• Title not available (Why is that?)
• On codes with the identifiable parent property
• A class of I.P.P. codes with efficient identification
• Title not available (Why is that?)
• Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
• 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

Cited In (16)

• A novel maximum distance separable code to generate universal identifiers
• New constructions for IPP codes
• Improved identification schemes based on error-correcting 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

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)