Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory
DOI10.1134/s0032946022040056OpenAlexW4315562924MaRDI QIDQ6173473
T. F. Rabie, Ibrahim Kamel, A. Janabekova, Grigory Kabatiansky
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
group testingconvex polytopesBoolean cubemultimedia digital fingerprinting codescounterfeit coin detectionsignature codes for noisy multiple access channelsvector support recovery by linear measurements against noise
Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Theory of error-correcting codes and error-detecting codes (94Bxx) General convexity (52Axx) Polytopes and polyhedra (52Bxx)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sidon sets in groups and induced subgraphs of Cayley graphs
- A coding model for a multiple-access adder channel
- Separable collusion-secure multimedia codes
- On metric dimension of nonbinary Hamming spaces
- Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise
- On the metric dimension of Cartesian powers of a graph
- Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Born again group testing: Multiaccess communications
- A Sharp Condition for Exact Support Recovery With Orthogonal Matching Pursuit
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- Collusion-secure fingerprinting for digital data
- Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting
- On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
- Stable signal recovery from incomplete and inaccurate measurements
- Determination of a Subset from Certain Combinatorial Properties
- Compressed sensing
- Binary \(B_2\)-sequences: a new upper bound
This page was built for publication: Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory
