Traceability codes and their generalizations
From MaRDI portal
Publication:2190905
DOI10.1134/S0032946019030074zbMATH Open1468.94484OpenAlexW2980763259WikidataQ127018017 ScholiaQ127018017MaRDI QIDQ2190905FDOQ2190905
Authors: Grigory Kabatiansky 
Publication date: 23 June 2020
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946019030074
Recommendations
Cites Work
- Families of finite sets in which no set is covered by the union of two others
- Generalized hashing and parent-identifying codes.
- How to share a secret
- Algebraic geometric codes. Basic notions
- Title not available (Why is that?)
- Nonrandom binary superimposed codes
- Collusion-secure fingerprinting for digital data
- Title not available (Why is that?)
- Separating systems
- 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
- Traceability codes
- Codes for copyright protection: the case of two pirates
- Families of finite sets in which no set is covered by the union of \(r\) others
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Optimal probabilistic fingerprint codes
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- A hypergraph approach to the identifying parent property: The case of multiple parents
- Title not available (Why is that?)
- Analysis of two tracing traitor schemes via coding theory
- An improvement of the Gilbert bound for constant weight codes (Corresp.)
- Upper bounds for parent-identifying set systems
- Generalized ideal secret-sharing schemes and matroids
- Bounds on the rate of separating codes
- Title not available (Why is that?)
- Generalization of IPP codes and IPP set systems
- Bounds on Traceability Schemes
Cited In (11)
- A class of traceability codes
- Title not available (Why is that?)
- Improved upper bounds for the rate of separating and completely separating codes
- Generalization of IPP codes and IPP set systems
- New upper bounds for parent-identifying codes and traceability codes
- Separable collusion-secure multimedia codes
- On 2-parent-identifying set systems of block size 4
- On a class of traceability codes
- On the Properties of Algebraic Geometric Codes as Copy Protection Codes
- Optimal 2-traceability codes of length 4
- On non-binary traceability set systems
This page was built for publication: Traceability codes and their generalizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190905)
