New constructions for IPP codes
From MaRDI portal
Recommendations
- A class of traceability codes
- Analysis of two tracing traitor schemes via coding theory
- A class of I.P.P. codes with efficient identification
- Recursive constructions of secure codes and hash families using difference function families.
- On the relationship between the traceability properties of Reed-Solomon codes
- Combinatorial properties of frameproof and traceability codes
- Upper bounds for parent-identifying set systems
- scientific article; zbMATH DE number 1996248
- Codes with the Identifiable Parent Property and the Multiple-Access Channel
- scientific article; zbMATH DE number 1857520
Cites work
- scientific article; zbMATH DE number 2081105 (Why is no real title available?)
- scientific article; zbMATH DE number 1462939 (Why is no real title available?)
- scientific article; zbMATH DE number 1406785 (Why is no real title available?)
- scientific article; zbMATH DE number 1418305 (Why is no real title available?)
- scientific article; zbMATH DE number 1418306 (Why is no real title available?)
- A Generalization of a Theorem due to MacNeish
- A hypergraph approach to the identifying parent property: The case of multiple parents
- Collusion-secure fingerprinting for digital data
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Combinatorial properties of frameproof and traceability codes
- Decoding of Reed Solomon codes beyond the error-correction bound
- Explicit construction of exponential sized families of k-independent sets
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- List decoding algorithms for certain concatenated codes
- New results on frame-proof codes and traceability schemes
- On a class of traceability codes
- On codes with the identifiable parent property
- Perfect hashing
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Tracing traitors
Cited in
(20)- On generalized separating hash families
- Improved bounds for separating hash families
- Analysis of two tracing traitor schemes via coding theory
- A study of the separating property in Reed-Solomon codes by bounding the minimum distance
- Perfect Hash Families: Constructions and Existence
- On the relationship between the traceability properties of Reed-Solomon codes
- Multimedia IPP codes with efficient tracing
- Covering array on the Cartesian product of hypergraphs
- A class of traceability codes
- Constructions of \(t\)-strongly multimedia IPP codes with length \(t+1\)
- Hat guessing number for the class of planar graphs is at least 22
- Roux-type constructions for covering arrays of strengths three and four
- Bounds for separating hash families
- Explicit constructions of separating hash families from algebraic curves over finite fields
- Codes with the identifiable parent property for multimedia fingerprinting
- Explicit constructions for perfect hash families
- Generalization of IPP codes and IPP set systems
- Recursive constructions of secure codes and hash families using difference function families.
- Perfect hash families, identifiable parent property codes and covering arrays.
- scientific article; zbMATH DE number 1857520 (Why is no real title available?)
This page was built for publication: New constructions for IPP codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781000)
