Separable collusion-secure multimedia codes
type: Item
instance of: scholarly article
title: Separable collusion-secure multimedia codes
zbMATH Open document ID: 1485.94172
DOI: 10.1134/S003294602102006X
author: E. E. Egorova
author: Grigory Kabatiansky
published in: Problems of Information Transmission
publication date: 2021-08-04T00:00:00Z
Mathematics Subject Classification ID: 94B60
zbMATH DE Number: 7378228
zbMATH Keywords: separable code
zbMATH Keywords: separating code
zbMATH Keywords: superimposed code
zbMATH Keywords: multimedia digital fingerprinting code
zbMATH Keywords: multiple access channel
zbMATH Keywords: signature codes
zbMATH Keywords: adversarial noise
MaRDI profile type: Publication
cites work: Anti-collusion fingerprinting for multimedia
cites work: On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
cites work: Separable Codes
cites work: Q4940701
cites work: Tracing traitors
cites work: On codes with the identifiable parent property
cites work: A hypergraph approach to the identifying parent property: The case of multiple parents
cites work: Collusion-secure fingerprinting for digital data
cites work: Digital fingerprinting codes: problem statements, constructions, identification of traitors
cites work: Optimal probabilistic fingerprint codes
cites work: Traceability codes and their generalizations
cites work: On the T-user M-frequency noiseless multiple-access channel with and without intensity information
cites work: Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
cites work: A class of codes for a T active users out of N multiple-access communication system
cites work: Compressed sensing
cites work: Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
cites work: A remark on compressed sensing
cites work: Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise
cites work: Born again group testing: Multiaccess communications
cites work: Q5331663
cites work: Q4121861
cites work: Solution of Ulam's problem on searching with a lie
cites work: Separating systems
cites work: How to share a secret
cites work: Generalization of IPP codes and IPP set systems
cites work: Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting
cites work: Q4132129
cites work: Q4146667
cites work: Q5365125
cites work: Nonrandom binary superimposed codes
cites work: Probabilistic Existence Results for Separable Codes
cites work: Q3043295
cites work: \((2,1)\)-separating systems beyond the probabilistic bound
cites work: Binary \(B_2\)-sequences: a new upper bound
cites work: Families of finite sets in which no set is covered by the union of two others
cites work: Families of finite sets in which no set is covered by the union of \(r\) others
cites work: Bounds on the rate of separating codes
cites work: Simple methods for deriving lower bounds the theory of codes
cites work: Bounds on the length of disjunctive codes
cites work: Improved decoding of Reed-Solomon and algebraic-geometry codes
cites work: Explicit construction of exponential sized families of k-independent sets
cites work: Q5417695
cites work: New upper bounds on cardinality of separating systems
cites work: Separating Partition Systems and Locally Different Sequences
cites work: On the Doubly Sparse Compressed Sensing Problem
cites work: Signature codes for noisy multiple access adder channel
cites work: Superimposed codes in R/sup n/
cites work: An improved upper bound of the rate of Euclidean superimposed codes
cites work: Superimposed codes in the Hamming space
cites work: On error correction with errors in both the channel and syndrome
cites work: An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
cites work: Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
cites work: Fundamentals of Computation Theory
cites work: Superselectors: Efficient Constructions and Applications
cites work: Locally thin set families
cites work: Bounds on the rate of disjunctive codes
cites work: Erratum to: ``Bounds on the rate of disjunctive codes''
full work available at URL: s003294602102006x
OpenAlex ID: W3179955457
description: scientific article; zbMATH DE number 7378228