Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory
From MaRDI portal
Publication:6173473
Cites work
- scientific article; zbMATH DE number 3248638 (Why is no real title available?)
- scientific article; zbMATH DE number 3194843 (Why is no real title available?)
- A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit
- A coding model for a multiple-access adder channel
- Binary \(B_2\)-sequences: a new upper bound
- Born again group testing: Multiaccess communications
- Collusion-secure fingerprinting for digital data
- Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate
- Compressed sensing
- Determination of a Subset from Certain Combinatorial Properties
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
- On metric dimension of nonbinary Hamming spaces
- On parity check \((0, 1)\)-matrix over \(\mathbb{Z}_p\)
- On the metric dimension of Cartesian powers of a graph
- Separable collusion-secure multimedia codes
- Sidon sets in groups and induced subgraphs of Cayley graphs
- Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting
- Stable signal recovery from incomplete and inaccurate measurements
Cited in
(1)
This page was built for publication: Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173473)