Geodesic
Affine $3$-nonsystematic perfect codes of length~15
Diskretnyj analiz i issledovanie operacij, Tome 22 (2015) no. 1, pp. 32-50.

Voir la notice de l'article provenant de la source Math-Net.Ru

A perfect binary code $C$ of length $n=2^k-1$ is called affine $3$-systematic if there exists a $3$-dimensional subspace $L$ in the space $\{0,1\}^n$ such that the intersection of any of its cosets $L+u$ with $C$ is either empty, or a singleton. Otherwise, the code $C$ is called affine $3$-nonsystematic. In the paper, we construct four nonequivalent affine $3$-nonsystematic codes of length 15. Bibliogr. 12.
Keywords: perfect code, Hamming code, nonsystematic code, affine nonsystematic code, affine $3$-nonsystematic code, component. 
@article{DA_2015_22_1_a2,
     author = {S. A. Malyugin},
     title = {Affine $3$-nonsystematic perfect codes of length~15},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {32--50},
     publisher = {mathdoc},
     volume = {22},
     number = {1},
     year = {2015},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2015_22_1_a2/}
}
TY  - JOUR
AU  - S. A. Malyugin
TI  - Affine $3$-nonsystematic perfect codes of length~15
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2015
SP  - 32
EP  - 50
VL  - 22
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2015_22_1_a2/
LA  - ru
ID  - DA_2015_22_1_a2
ER  - 
%0 Journal Article
%A S. A. Malyugin
%T Affine $3$-nonsystematic perfect codes of length~15
%J Diskretnyj analiz i issledovanie operacij
%D 2015
%P 32-50
%V 22
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2015_22_1_a2/
%G ru
%F DA_2015_22_1_a2
S. A. Malyugin. Affine $3$-nonsystematic perfect codes of length~15. Diskretnyj analiz i issledovanie operacij, Tome 22 (2015) no. 1, pp. 32-50. http://geodesic.mathdoc.fr/item/DA_2015_22_1_a2/

[1] S. V. Avgustinovich, F. I. Solov'eva, “On nonsystematic perfect binary codes”, Probl. Inf. Transm., 32:3 (1996), 258–261 | MR | Zbl

[2] S. A. Malyugin, “On enumeration of the perfect binary codes of length 15”, Diskrete Appl. Math., 135:1–3 (2004), 161–181 | DOI | MR | MR | Zbl

[3] S. A. Malyugin, “Nonsystematic perfect binary codes”, Diskretn. Anal. Issled. Oper., Ser. 1, 8:1 (2001), 55–76 | MR | Zbl

[4] S. A. Malyugin, “On affine nonsystematic codes”, Proc. Conf. Devoted to the 90th Anniversary of A. A. Lyapunov (Novosibirsk, Russia, Oct. 8–11, 2001), Novosibirsk, 2001, 393–394, Accessed Jan. 13, 2015 Available at http://www.sbras.ru/ws/Lyap2001/2288/

[5] S. A. Malyugin, “On enumeration of nonequivalent perfect binary codes of length 15 and rank 15”, J. Appl. Ind. Math., 1:1 (2007), 77–89 | DOI | MR | Zbl

[6] S. A. Malyugin, “Affine nonsystematic codes”, J. Appl. Ind. Math., 6:4 (2012), 451–459 | DOI | MR

[7] S. A. Malyugin, “Affine 3-nonsystematic codes”, J. Appl. Ind. Math., 8:4 (2014), 552–556 | DOI

[8] A. M. Romanov, “On construction of perfect nonlinear binary codes by symbol inversion”, Diskretn. Anal. Issled. Oper., Ser. 1, 4:1 (1997), 46–52 | MR | Zbl

[9] A. M. Romanov, “On nonsystematic perfect codes of length 15”, Discrete Appl. Math., 135:1–3 (2004), 255–258 | DOI | MR | MR | Zbl

[10] Phelps K. T., LeVan M. J., “Kernels of nonlinear Hamming codes”, Des. Codes Criptogr., 6:3 (1995), 247–257 | DOI | MR | Zbl

[11] Phelps K. T., LeVan M. J., “Nonsystematic perfect codes”, SIAM J. Discrete Math., 12:1 (1999), 27–34 | DOI | MR | Zbl

[12] Solov'eva F. I., “Switchings and perfect codes”, Numbers, information and complexity, Kluwer Acad. Publ., Dordrecht, 2000, 311–324 | DOI | MR | Zbl