RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2010 Volume 46, Issue 1, Pages 20–24 (Mi ppi2007)

This article is cited 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.

UDC: 621.391.15

Received: 04.06.2009
Revised: 21.08.2009


 English version:
Problems of Information Transmission, 2010, 46:1, 17–21

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024