An improved upper bound of the rate of Euclidean superimposed codes

DOI10.1109/18.749032zbMath0945.94031OpenAlexW2133178226MaRDI QIDQ4701336

Miklós Ruszinkó, Zoltan Fueredi

Publication date: 21 November 1999

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

Full work available at URL: https://semanticscholar.org/paper/df038a8b411d7363eda7b379151d876a013d2269

zbMATH Keywords

upper boundgrowth rateEuclidean superimposed code

Mathematics Subject Classification ID

Bounds on codes (94B65)

Related Items (4)

Uniform hypergraphs containing no grids ⋮ Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise ⋮ Separable collusion-secure multimedia codes ⋮ Some constructions of superimposed codes in Euclidean spaces.

This page was built for publication: An improved upper bound of the rate of Euclidean superimposed codes