|
Problemy Peredachi Informatsii, 2006, Volume 42, Issue 2, Pages 63–80
(Mi ppi45)
|
|
|
|
This article is cited in 11 scientific papers (total in 11 papers)
Coding Theory
Binary Extended Perfect Codes of Length 16 and Rank 14
V. A. Zinov'ev, D. V. Zinov'ev Institute for Information Transmission Problems, Russian Academy of Sciences
Abstract:
All extended binary perfect $(16,4,2^11)$ codes of rank 14 over the field $\mathbb F_2$ are classified.
It is proved that among all nonequivalent extended binary perfect $(16,4,2^11)$ codes there
are exactly 1719 nonequivalent codes of rank 14 over $\mathbb F_2$. Among these codes there are 844 codes classified by Phelps (Solov?eva–Phelps codes) and 875 other codes obtained by the construction
of Etzion–Vardy and by a new general doubling construction, presented in the paper. Thus,
the only open question in the classification of extended binary perfect $(16,4,2^11)$ codes is that
on such codes of rank 15 over $\mathbb F_2$.
Received: 11.01.2005 Revised: 02.03.2006
Citation:
V. A. Zinov'ev, D. V. Zinov'ev, “Binary Extended Perfect Codes of Length 16 and Rank 14”, Probl. Peredachi Inf., 42:2 (2006), 63–80; Problems Inform. Transmission, 42:2 (2006), 123–138
Linking options:
https://www.mathnet.ru/eng/ppi45 https://www.mathnet.ru/eng/ppi/v42/i2/p63
|
Statistics & downloads: |
Abstract page: | 435 | Full-text PDF : | 105 | References: | 73 | First page: | 7 |
|