Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory
DOI10.1134/S0032946022040056OpenAlexW4315562924MaRDI QIDQ6173473FDOQ6173473
Authors: A. Janabekova, Grigory Kabatiansky, Ibrahim Kamel, T. F. Rabie 
Publication date: 21 July 2023
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946022040056
convex polytopesgroup testingBoolean cubemultimedia digital fingerprinting codescounterfeit coin detectionsignature codes for noisy multiple access channelsvector support recovery by linear measurements against noise
Cryptography (94A60) Polytopes and polyhedra (52Bxx) Authentication, digital signatures and secret sharing (94A62) General convexity (52Axx) Theory of error-correcting codes and error-detecting codes (94Bxx)
Cites Work
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
- Title not available (Why is that?)
- Determination of a Subset from Certain Combinatorial Properties
- On parity check \((0, 1)\)-matrix over \(\mathbb{Z}_p\)
- Collusion-secure fingerprinting for digital data
- On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
- Born again group testing: Multiaccess communications
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting
- Sidon sets in groups and induced subgraphs of Cayley graphs
- Title not available (Why is that?)
- A coding model for a multiple-access adder channel
- On metric dimension of nonbinary Hamming spaces
- Binary \(B_2\)-sequences: a new upper bound
- On the metric dimension of Cartesian powers of a graph
- A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit
- Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise
- Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate
- Separable collusion-secure multimedia codes
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)
