Geodesic
On the minimal distance of a polynomial code
Discrete mathematics & theoretical computer science, Tome 13 (2011) no. 4.

Voir la notice de l'article provenant de la source Episciences

special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity 
@article{DMTCS_2011_13_4_a7,
     author = {Pach, Peter Pal and Szabo, Csaba},
     title = {On the minimal distance of a polynomial code},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {13},
     number = {4},
     year = {2011},
     doi = {10.46298/dmtcs.556},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.556/}
}
TY  - JOUR
AU  - Pach, Peter Pal
AU  - Szabo, Csaba
TI  - On the minimal distance of a polynomial code
JO  - Discrete mathematics & theoretical computer science
PY  - 2011
VL  - 13
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.556/
DO  - 10.46298/dmtcs.556
LA  - en
ID  - DMTCS_2011_13_4_a7
ER  - 
%0 Journal Article
%A Pach, Peter Pal
%A Szabo, Csaba
%T On the minimal distance of a polynomial code
%J Discrete mathematics & theoretical computer science
%D 2011
%V 13
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.556/
%R 10.46298/dmtcs.556
%G en
%F DMTCS_2011_13_4_a7
Pach, Peter Pal; Szabo, Csaba. On the minimal distance of a polynomial code. Discrete mathematics & theoretical computer science, Tome 13 (2011) no. 4. doi : 10.46298/dmtcs.556. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.556/

Cité par Sources :