|
Problemy Peredachi Informatsii, 2010, Volume 46, Issue 1, Pages 20–24
(Mi ppi2007)
|
|
|
|
This article is cited in 2 scientific papers (total in 2 papers)
Coding Theory
Binary perfect and extended perfect codes of lengths 15 and 16 with ranks 13 and 14
V. A. Zinoviev, D. V. Zinoviev A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences
Abstract:
Inaccuracies in computations in the paper of the authors on classification of perfect binary codes of lengths 15 and 16 and of rank 13 are fixed. An explicit construction of all extended perfect codes of length 16 and rank 13 with a given kernel size is presented. Perfect binary codes of length 15 and rank 14 obtained by the general doubling construction are classified.
Received: 04.06.2009 Revised: 21.08.2009
Citation:
V. A. Zinoviev, D. V. Zinoviev, “Binary perfect and extended perfect codes of lengths 15 and 16 with ranks 13 and 14”, Probl. Peredachi Inf., 46:1 (2010), 20–24; Problems Inform. Transmission, 46:1 (2010), 17–21
Linking options:
https://www.mathnet.ru/eng/ppi2007 https://www.mathnet.ru/eng/ppi/v46/i1/p20
|
Statistics & downloads: |
Abstract page: | 468 | Full-text PDF : | 109 | References: | 51 | First page: | 10 |
|