Traceability codes and their generalizations
From MaRDI portal
Publication:2190905
DOI10.1134/S0032946019030074zbMath1468.94484OpenAlexW2980763259WikidataQ127018017 ScholiaQ127018017MaRDI QIDQ2190905
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
Related Items (6)
On the Properties of Algebraic Geometric Codes as Copy Protection Codes ⋮ Improved upper bounds for the rate of separating and completely separating codes ⋮ On non-binary traceability set systems ⋮ Optimal 2-traceability codes of length 4 ⋮ On 2-parent-identifying set systems of block size 4 ⋮ Separable collusion-secure multimedia codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds for parent-identifying set systems
- Families of finite sets in which no set is covered by the union of \(r\) others
- Families of finite sets in which no set is covered by the union of two others
- On codes with the identifiable parent property
- Generalized ideal secret-sharing schemes and matroids
- Separating systems
- Generalized hashing and parent-identifying codes.
- Analysis of two tracing traitor schemes via coding theory
- Bounds on the rate of separating codes
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- A class of I.P.P. codes with efficient identification
- Traceability codes
- Generalization of IPP codes and IPP set systems
- Codes for copyright protection: the case of two pirates
- A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
- How to share a secret
- An improvement of the Gilbert bound for constant weight codes (Corresp.)
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- Collusion-secure fingerprinting for digital data
- Nonrandom binary superimposed codes
- Bounds on Traceability Schemes
- Optimal probabilistic fingerprint codes
This page was built for publication: Traceability codes and their generalizations
