Graphs associated with codes of covering radius 1 and minimum distance 2

Joanne L. Hall

doi:10.37236/792

Graphs associated with codes of covering radius 1 and minimum distance 2

Joanne L. Hall

Research output: Contribution to journal › Article › peer-review

Abstract

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 [9]. 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.

Original language	English
Article number	R68
Journal	Electronic Journal of Combinatorics
Volume	15
Issue number	1 R
DOIs	https://doi.org/10.37236/792
Publication status	Published - 5 May 2008

Access to Document

10.37236/792

Cite this

@article{d3643f0c01aa42f1b26809cd4dc1f528,

title = "Graphs associated with codes of covering radius 1 and minimum distance 2",

abstract = "The search for codes of covering radius 1 led {\"O}sterg{\aa}rd, Quistorff and Wassermann to the OQW method of associating a unique graph to each code [9]. 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.",

author = "Hall, {Joanne L.}",

year = "2008",

month = may,

day = "5",

doi = "10.37236/792",

language = "English",

volume = "15",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "1 R",

}

TY - JOUR

T1 - Graphs associated with codes of covering radius 1 and minimum distance 2

AU - Hall, Joanne L.

PY - 2008/5/5

Y1 - 2008/5/5

N2 - 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 [9]. 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.

AB - 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 [9]. 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.

UR - http://www.scopus.com/inward/record.url?scp=43849094484&partnerID=8YFLogxK

U2 - 10.37236/792

DO - 10.37236/792

M3 - Article

SN - 1077-8926

VL - 15

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 1 R

M1 - R68

ER -

Graphs associated with codes of covering radius 1 and minimum distance 2

Abstract

Access to Document

Other files and links

Fingerprint

Cite this