Geodesic
Ternary constant weight codes
The electronic journal of combinatorics, Tome 9 (2002)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Let $A_3(n,d,w)$ denote the maximum cardinality of a ternary code with length $n$, minimum distance $d$, and constant Hamming weight $w$. Methods for proving upper and lower bounds on $A_3(n,d,w)$ are presented, and a table of exact values and bounds in the range $n \leq 10$ is given.
DOI : 10.37236/1657
Classification : 94B25, 05B40, 94B65
Mots-clés : ternary codes, constant weight codes, bounds for codes 
@article{10_37236_1657,
     author = {Patric R. J. \"Osterg\r{a}rd and Mattias Svanstr\"om},
     title = {Ternary constant weight codes},
     journal = {The electronic journal of combinatorics},
     year = {2002},
     volume = {9},
     doi = {10.37236/1657},
     zbl = {1027.94029},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1657/}
}
TY  - JOUR
AU  - Patric R. J. Östergård
AU  - Mattias Svanström
TI  - Ternary constant weight codes
JO  - The electronic journal of combinatorics
PY  - 2002
VL  - 9
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1657/
DO  - 10.37236/1657
ID  - 10_37236_1657
ER  - 
%0 Journal Article
%A Patric R. J. Östergård
%A Mattias Svanström
%T Ternary constant weight codes
%J The electronic journal of combinatorics
%D 2002
%V 9
%U http://geodesic.mathdoc.fr/articles/10.37236/1657/
%R 10.37236/1657
%F 10_37236_1657
Patric R. J. Östergård; Mattias Svanström. Ternary constant weight codes. The electronic journal of combinatorics, Tome 9 (2002). doi: 10.37236/1657

Cité par Sources :