An improved upper bound of the rate of Euclidean superimposed codes

DOI10.1109/18.749032zbMATH Open0945.94031OpenAlexW2133178226MaRDI QIDQ4701336FDOQ4701336

Authors: Miklós Ruszinkó, Zoltán Füredi 

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

Recommendations

• scientific article; zbMATH DE number 4164725
• Some constructions of superimposed codes in Euclidean spaces.
• scientific article; zbMATH DE number 2154117
• Publication:3469037

zbMATH Keywords

growth rateupper boundEuclidean superimposed code

Mathematics Subject Classification ID

Bounds on codes (94B65)

Cited In (6)

• 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
• Title not available (Why is that?)
• Some constructions of superimposed codes in Euclidean spaces.
• An improved analysis of least squares superposition codes with Bernoulli dictionary

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701336)