|
Problemy Peredachi Informatsii, 2002, Volume 38, Issue 4, Pages 56–84
(Mi ppi1325)
|
|
|
|
This article is cited in 14 scientific papers (total in 14 papers)
Information Theory and Coding Theory
Binary Extended Perfect Codes of Length 16 by the Generalized Concatenated Construction
V. A. Zinov'ev, D. V. Zinov'ev
Abstract:
We enumerate binary extended nonlinear perfect codes of length 16 obtained by the generalized concatenated construction (GC-construction). There are 15 different types of such codes. They are defined by pairs of MDS codes $A_i:(4,2,64)_4$. For every pair, we give the number of nonequivalent codes of this type. In total, there are 285 nonequivalent binary extended nonlinear perfect codes of length 16 obtained by the GC-construction, including the Hamming (i.e., linear) code. Thus, we obtain all binary extended perfect codes of length 16 and rank 13. Their total number is equal to 272.
Received: 09.10.2001 Revised: 15.08.2002
Citation:
V. A. Zinov'ev, D. V. Zinov'ev, “Binary Extended Perfect Codes of Length 16 by the Generalized Concatenated Construction”, Probl. Peredachi Inf., 38:4 (2002), 56–84; Problems Inform. Transmission, 38:4 (2002), 296–322
Linking options:
https://www.mathnet.ru/eng/ppi1325 https://www.mathnet.ru/eng/ppi/v38/i4/p56
|
Statistics & downloads: |
Abstract page: | 422 | Full-text PDF : | 139 | References: | 61 |
|