Separable collusion-secure multimedia codes
From MaRDI portal
Publication:2044131
DOI10.1134/S003294602102006XzbMath1485.94172OpenAlexW3179955457MaRDI QIDQ2044131
E. E. Egorova, Grigory Kabatiansky
Publication date: 4 August 2021
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s003294602102006x
separable codeseparating codemultiple access channelsignature codessuperimposed codeadversarial noisemultimedia digital fingerprinting code
Related Items (3)
Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding ⋮ Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory ⋮ Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On error correction with errors in both the channel and syndrome
- \((2,1)\)-separating systems beyond the probabilistic bound
- Signature codes for noisy multiple access adder channel
- Bounds on the length of disjunctive codes
- A remark on compressed sensing
- Families of finite sets in which no set is covered by the union of \(r\) others
- Explicit construction of exponential sized families of k-independent sets
- Solution of Ulam's problem on searching with a lie
- Families of finite sets in which no set is covered by the union of two others
- Simple methods for deriving lower bounds the theory of codes
- On codes with the identifiable parent property
- Separating systems
- New upper bounds on cardinality of separating systems
- Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
- Bounds on the rate of separating codes
- Generalization of IPP codes and IPP set systems
- Traceability codes and their generalizations
- Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise
- Bounds on the rate of disjunctive codes
- Erratum to: ``Bounds on the rate of disjunctive codes
- Locally Thin Set Families
- A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
- Probabilistic Existence Results for Separable Codes
- How to share a secret
- Separating Partition Systems and Locally Different Sequences
- A class of codes for a T active users out of N multiple-access communication system
- On the Doubly Sparse Compressed Sensing Problem
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Superselectors: Efficient Constructions and Applications
- Born again group testing: Multiaccess communications
- Superimposed codes in R/sup n/
- On the T-user M-frequency noiseless multiple-access channel with and without intensity information
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Tracing traitors
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- Collusion-secure fingerprinting for digital data
- An improved upper bound of the rate of Euclidean superimposed codes
- Superimposed codes in the Hamming space
- Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting
- An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
- Separable Codes
- On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
- Nonrandom binary superimposed codes
- Anti-collusion fingerprinting for multimedia
- Fundamentals of Computation Theory
- Optimal probabilistic fingerprint codes
- Compressed sensing
- Binary \(B_2\)-sequences: a new upper bound
This page was built for publication: Separable collusion-secure multimedia codes
