|
Problemy Peredachi Informatsii, 2005, Volume 41, Issue 3, Pages 23–31
(Mi ppi104)
|
|
|
|
This article is cited in 15 scientific papers (total in 15 papers)
Coding Theory
On Construction of Transitive Codes
F. I. Solov'eva Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Abstract:
Application of some known methods of code construction (such as the Vasil'ev,
Plotkin, and Mollard methods) to transitive codes satisfying certain auxiliary conditions yields
infinite classes of large-length transitive codes, in particular, at least $\lfloor k/2\rfloor^2$ nonequivalent perfect
transitive codes of length $n=2^k-1$, $k>4$. A similar result is valid for extended perfect
transitive codes.
Received: 05.04.2005 Revised: 30.05.2005
Citation:
F. I. Solov'eva, “On Construction of Transitive Codes”, Probl. Peredachi Inf., 41:3 (2005), 23–31; Problems Inform. Transmission, 41:3 (2005), 204–211
Linking options:
https://www.mathnet.ru/eng/ppi104 https://www.mathnet.ru/eng/ppi/v41/i3/p23
|
Statistics & downloads: |
Abstract page: | 397 | Full-text PDF : | 128 | References: | 56 |
|