Combinatorial lemma and structure of a class of binary codes
Matematičeskie zametki, Tome 7 (1970) no. 3, pp. 325-331 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

A class of complete binary code systems is presented in which one of the symbols of the alphabet is used in any code combination not more than once, in terms of prefix codes of this class and of the operations of inversion and substitution of codes.
@article{MZM_1970_7_3_a9,
     author = {Al. A. Markov},
     title = {Combinatorial lemma and structure of a class of binary codes},
     journal = {Matemati\v{c}eskie zametki},
     pages = {325--331},
     year = {1970},
     volume = {7},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_1970_7_3_a9/}
}
TY  - JOUR
AU  - Al. A. Markov
TI  - Combinatorial lemma and structure of a class of binary codes
JO  - Matematičeskie zametki
PY  - 1970
SP  - 325
EP  - 331
VL  - 7
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/MZM_1970_7_3_a9/
LA  - ru
ID  - MZM_1970_7_3_a9
ER  - 
%0 Journal Article
%A Al. A. Markov
%T Combinatorial lemma and structure of a class of binary codes
%J Matematičeskie zametki
%D 1970
%P 325-331
%V 7
%N 3
%U http://geodesic.mathdoc.fr/item/MZM_1970_7_3_a9/
%G ru
%F MZM_1970_7_3_a9
Al. A. Markov. Combinatorial lemma and structure of a class of binary codes. Matematičeskie zametki, Tome 7 (1970) no. 3, pp. 325-331. http://geodesic.mathdoc.fr/item/MZM_1970_7_3_a9/