Some remarks on the Plotkin bound
The electronic journal of combinatorics, Tome 10 (2003)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In coding theory, Plotkin's upper bound on the maximal cadinality of a code with minimum distance at least $d$ is well known. He presented it for binary codes where Hamming and Lee metric coincide. After a brief discussion of the generalization to $q$-ary codes preserved with the Hamming metric, the application of the Plotkin bound to $q$-ary codes preserved with the Lee metric due to Wyner and Graham is improved.
DOI : 10.37236/1746
Classification : 94B65
Mots-clés : Plotkin's bound, Hamming metric, Lee metric
@article{10_37236_1746,
     author = {J\"orn Quistorff},
     title = {Some remarks on the {Plotkin} bound},
     journal = {The electronic journal of combinatorics},
     year = {2003},
     volume = {10},
     doi = {10.37236/1746},
     zbl = {1029.94042},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1746/}
}
TY  - JOUR
AU  - Jörn Quistorff
TI  - Some remarks on the Plotkin bound
JO  - The electronic journal of combinatorics
PY  - 2003
VL  - 10
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1746/
DO  - 10.37236/1746
ID  - 10_37236_1746
ER  - 
%0 Journal Article
%A Jörn Quistorff
%T Some remarks on the Plotkin bound
%J The electronic journal of combinatorics
%D 2003
%V 10
%U http://geodesic.mathdoc.fr/articles/10.37236/1746/
%R 10.37236/1746
%F 10_37236_1746
Jörn Quistorff. Some remarks on the Plotkin bound. The electronic journal of combinatorics, Tome 10 (2003). doi: 10.37236/1746

Cité par Sources :