go-v.orgdoi

Graphs Associated with Codes of Covering Radius 1 and Minimum Distance 2

Joanne L. Hall · The Electronic Journal of Combinatorics · 2008

  • DOI 10.37236/792
  • Publisher Electronic Journal of Combinatorics
  • Type article
  • Issued 2008

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2008

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. 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$.

Open the resolved locator · 10.37236/792

Metadata licence: OpenAlex metadata (CC0)