Geodesic
Graphs associated with codes of covering radius 1 and minimum distance 2
The electronic journal of combinatorics, Tome 15 (2008)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
The search for codes of covering radius $1$ led Östergård, Quistorff and Wassermann to the OQW method of associating a unique graph to each code. We present results on the structure and existence of OQW-associated graphs. These are used to find an upper bound on the size of a ball of radius $1$ around a code of length $3$ and minimum distance $2$. OQW-associated graphs and non-extendable partial Latin squares are used to catalogue codes of length $3$ over $4$ symbols with covering radius $1$ and minimum distance $2$.
DOI : 10.37236/792
Classification : 94B65, 05C15, 05B15 
Joanne L. Hall. Graphs associated with codes of covering radius 1 and minimum distance 2. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/792
@article{10_37236_792,
     author = {Joanne L. Hall},
     title = {Graphs associated with codes of covering radius 1 and minimum distance 2},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/792},
     zbl = {1159.94010},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/792/}
}
TY  - JOUR
AU  - Joanne L. Hall
TI  - Graphs associated with codes of covering radius 1 and minimum distance 2
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/792/
DO  - 10.37236/792
ID  - 10_37236_792
ER  - 
%0 Journal Article
%A Joanne L. Hall
%T Graphs associated with codes of covering radius 1 and minimum distance 2
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/792/
%R 10.37236/792
%F 10_37236_792

Cité par Sources :