An upper bound for the number of uniformly packed codes Full article
| Source | IEEE International Symposium on Information Theory Compilation, 2007. |
||||
|---|---|---|---|---|---|
| Output data | Year: 2007, Article number : 4557250, Pages count : DOI: 10.1109/ISIT.2007.4557250 | ||||
| Authors |
|
||||
| Affiliations |
|
Abstract:
Binary uniformly packed in the narrow sense codes were introduced in 1971 by Semakov, Zinoviev and Zaitsev. Later more general definitions were proposed by Bassalygo, Zaitsev and Zinoviev (uniformly packed in the wide sense codes) and by Goethals and Tilborg (uniformly packed codes). We consider binary uniformly packed in the wide sense codes. These codes are well known for their remarkable properties and have been intensively studied. In this paper we give an upper bound on the number of distinct uniformly packed in the wide sense codes of length n with constant odd minimum distance d and fixed parameters of packing. In particular, we give nontrivial upper bounds on the numbers of Preparata codes with d = 5, primitive BCH codes with d equal to 5 or 7, Goethals codes with d = 7, et al. The result obtained generalizes the upper bound for the number of perfect codes with d = 3 that was derived by Avgustinovich in 1995.
Cite:
Tokareva N.N.
An upper bound for the number of uniformly packed codes
In compilation IEEE International Symposium on Information Theory. 2007. DOI: 10.1109/ISIT.2007.4557250 Scopus OpenAlex
An upper bound for the number of uniformly packed codes
In compilation IEEE International Symposium on Information Theory. 2007. DOI: 10.1109/ISIT.2007.4557250 Scopus OpenAlex
Identifiers:
| Scopus: | 2-s2.0-51649106197 |
| OpenAlex: | W1968407972 |