Geodesic
On reconstruction of binary codes by dimensions of their subcodes
Diskretnyj analiz i issledovanie operacij, Tome 17 (2010) no. 5, pp. 15-21.

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

It is proved that if there is a bijection between two binary codes that preserves dimensions of their subcodes with even cardinality, then the codes are equivalent. It is shown that this theorem is unimprovable. Bibliogr. 9.
Keywords: binary code, strong isometry
Mots-clés : reconstruction, equivalent codes. 
@article{DA_2010_17_5_a1,
     author = {E. V. Gorkunov and S. V. Avgustinovich},
     title = {On reconstruction of binary codes by dimensions of their subcodes},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {15--21},
     publisher = {mathdoc},
     volume = {17},
     number = {5},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2010_17_5_a1/}
}
TY  - JOUR
AU  - E. V. Gorkunov
AU  - S. V. Avgustinovich
TI  - On reconstruction of binary codes by dimensions of their subcodes
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2010
SP  - 15
EP  - 21
VL  - 17
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2010_17_5_a1/
LA  - ru
ID  - DA_2010_17_5_a1
ER  - 
%0 Journal Article
%A E. V. Gorkunov
%A S. V. Avgustinovich
%T On reconstruction of binary codes by dimensions of their subcodes
%J Diskretnyj analiz i issledovanie operacij
%D 2010
%P 15-21
%V 17
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2010_17_5_a1/
%G ru
%F DA_2010_17_5_a1
E. V. Gorkunov; S. V. Avgustinovich. On reconstruction of binary codes by dimensions of their subcodes. Diskretnyj analiz i issledovanie operacij, Tome 17 (2010) no. 5, pp. 15-21. http://geodesic.mathdoc.fr/item/DA_2010_17_5_a1/

[1] Abdurakhmanov Zh. K., O geometricheskoi strukture kodov, ispravlyayuschikh oshibki, Dis. $\dots$ kand. fiz.-mat. nauk: 01.01.09, Tashkent, 1991, 66 pp.

[2] Avgustinovich S. V., “K stroeniyu grafov minimalnykh rasstoyanii sovershennykh binarnykh $(n,3)$-kodov”, Diskret. analiz i issled. operatsii. Ser. 1, 5:4 (1998), 3–5 | MR | Zbl

[3] Avgustinovich S. V., “Ob izometrichnosti plotno upakovannykh binarnykh kodov”, Diskret. analiz, Tr. RAN. Sib. otd-nie. In-t matematiki, 27, In-t matematiki, Novosibirsk, 1994, 3–5 | MR | Zbl

[4] Avgustinovich S. V., “O silnoi izometrii binarnykh kodov”, Diskret. analiz i issled. operatsii. Ser. 1, 7:3 (2000), 3–5 | MR | Zbl

[5] Avgustinovich S. V., Solovëva F. I., “K metricheskoi zhestkosti dvoichnykh kodov”, Probl. peredachi inform., 39:2 (2003), 23–28 | MR | Zbl

[6] Krasin V. Yu., “O slabykh izometriyakh buleva kuba”, Diskret. analiz i issled. operatsii. Ser. 1, 13:4 (2006), 26–32 | MR

[7] Mogilnykh I. Yu., “O slabykh izometriyakh kodov Preparaty”, Probl. peredachi inform., 45:2 (2009), 78–83 | MR | Zbl

[8] Mogilnykh I. Yu., Östergård P. R. J., Pottonen O., Solov'eva F. I., “Reconstructing extended perfect binary one-error-correcting codes from their minimum distance graphs”, IEEE Trans. Inform. Theory, 55 (2009), 2622–2625 | DOI | MR

[9] Solov'eva F. I., Avgustinovich S. V., Honold T., Heise W., “On the extendability of code isometries”, J. Geom., 61 (1998), 3–16 | MR