Geodesic
Ternary Covering Codes
The electronic journal of combinatorics, The Foata Festschrift volume, Tome 3 (1996) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

In [5], we studied binary codes with covering radius one via their characteristic functions. This gave us an easy way of obtaining congruence properties and of deriving interesting linear inequalities. In this paper we extend this approach to ternary covering codes. We improve on lower bounds for ternary $1$-covering codes, the so-called football pool problem, when $3$ does not divide $n-1$. We also give new lower bounds for some covering codes with a covering radius greater than one. 
@article{10_37236_1281,
     author = {Laurent Habsieger},
     title = {Ternary {Covering} {Codes}},
     journal = {The electronic journal of combinatorics},
     year = {1996},
     volume = {3},
     number = {2},
     doi = {10.37236/1281},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1281/}
}
TY  - JOUR
AU  - Laurent Habsieger
TI  - Ternary Covering Codes
JO  - The electronic journal of combinatorics
PY  - 1996
VL  - 3
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1281/
DO  - 10.37236/1281
ID  - 10_37236_1281
ER  - 
%0 Journal Article
%A Laurent Habsieger
%T Ternary Covering Codes
%J The electronic journal of combinatorics
%D 1996
%V 3
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/1281/
%R 10.37236/1281
%F 10_37236_1281
Laurent Habsieger. Ternary Covering Codes. The electronic journal of combinatorics, The Foata Festschrift volume, Tome 3 (1996) no. 2. doi: 10.37236/1281

Cité par Sources :