×

zbMATH — the first resource for mathematics

Bounds on constant weight binary superimposed codes. (English) Zbl 0652.94021
Summary: The asymptotic bounds on the minimal length of binary superimposed codes are investigated. We give an improvement for the Dyachkov–Rykov upper bound. The bounds of the classical coding theory for this kind of codes are applied, too. The Reed–Solomon code with componentwise binary mapping can asymptotically reach the lower bound under certain condition.

MSC:
94B60 Other types of codes
94B15 Cyclic codes
PDF BibTeX XML Cite