|
Problemy Peredachi Informatsii, 2007, Volume 43, Issue 4, Pages 13–36
(Mi ppi24)
|
|
|
|
This article is cited in 10 scientific papers (total in 10 papers)
Coding Theory
On the Construction of $q$-ary Equidistant Codes
G. T. Bogdanovaa, V. A. Zinov'evb, T. J. Todorova a Institute of Mathematics and Informatics, Bulgarian Academy of Sciences
b A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences
Abstract:
The problem of constructing equidistant codes over an alphabet of an arbitrary
size $q$ is considered. Some combinatorial constructions and computer-based search methods are
presented. All maximal equidistant codes with distances 3 and 4 are found.
Received: 19.12.2006 Revised: 03.10.2007
Citation:
G. T. Bogdanova, V. A. Zinov'ev, T. J. Todorov, “On the Construction of $q$-ary Equidistant Codes”, Probl. Peredachi Inf., 43:4 (2007), 13–36; Problems Inform. Transmission, 43:4 (2007), 280–302
Linking options:
https://www.mathnet.ru/eng/ppi24 https://www.mathnet.ru/eng/ppi/v43/i4/p13
|
Statistics & downloads: |
Abstract page: | 871 | Full-text PDF : | 126 | References: | 63 | First page: | 11 |
|