Superimposed codes in the Hamming space

DOI10.1109/18.340463zbMath0826.94028OpenAlexW2137268641MaRDI QIDQ4850289

Vladimir I. Levenshtein, Thomas Ericson

Publication date: 9 November 1995

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.340463

zbMATH Keywords

perfect codessuperimposed codesmultiple access communication

Mathematics Subject Classification ID

Cryptography (94A60) Bounds on codes (94B65) Other types of codes (94B60)

Related Items (5)

Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding ⋮ Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise ⋮ Threshold data structures and coding theory ⋮ Separable collusion-secure multimedia codes ⋮ Some constructions of superimposed codes in Euclidean spaces.

This page was built for publication: Superimposed codes in the Hamming space