Geodesic
Construction of Optimal Linear Codes by Geometric Puncturing
Serdica Journal of Computing, Tome 7 (2013) no. 1, pp. 73-80 Cet article a éte moissonné depuis la source Bulgarian Digital Mathematics Library

Voir la notice de l'article

Dedicated to the memory of S.M. Dodunekov (1945–2012)Abstract. Geometric puncturing is a method to construct new codes. ACM Computing Classification System (1998): E.4.
Keywords: Optimal Linear Codes, Finite Fields, Projective Geometry 
@article{SJC_2013_7_1_a4,
     author = {Maruta, Tatsuya},
     title = {Construction of {Optimal} {Linear} {Codes} by {Geometric} {Puncturing}},
     journal = {Serdica Journal of Computing},
     pages = {73--80},
     year = {2013},
     volume = {7},
     number = {1},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/SJC_2013_7_1_a4/}
}
TY  - JOUR
AU  - Maruta, Tatsuya
TI  - Construction of Optimal Linear Codes by Geometric Puncturing
JO  - Serdica Journal of Computing
PY  - 2013
SP  - 73
EP  - 80
VL  - 7
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/SJC_2013_7_1_a4/
LA  - en
ID  - SJC_2013_7_1_a4
ER  - 
%0 Journal Article
%A Maruta, Tatsuya
%T Construction of Optimal Linear Codes by Geometric Puncturing
%J Serdica Journal of Computing
%D 2013
%P 73-80
%V 7
%N 1
%U http://geodesic.mathdoc.fr/item/SJC_2013_7_1_a4/
%G en
%F SJC_2013_7_1_a4
Maruta, Tatsuya. Construction of Optimal Linear Codes by Geometric Puncturing. Serdica Journal of Computing, Tome 7 (2013) no. 1, pp. 73-80. http://geodesic.mathdoc.fr/item/SJC_2013_7_1_a4/