Graphs associated with codes of covering radius 1 and minimum distance 2
type: Item
instance of: scholarly article
title: Graphs associated with codes of covering radius 1 and minimum distance 2
zbMATH Open document ID: 1159.94010
author: Joanne L. Hall
published in: The Electronic Journal of Combinatorics
publication date: 2009-04-07T00:00:00Z
full work available at URL: https://eudml.org/doc/129806
full work available at URL: v15i1r68.html
review text: Summary: The search for codes of covering radius 1 led \textit{P. R. J. Östergård, J. Quistorff} and \textit{A. Wassermann} [Des. Codes Cryptography 35, No. 2, 241--250 (2005; Zbl 1081.94041)] 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.
Mathematics Subject Classification ID: 94B65
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05B15
zbMATH DE Number: 5540973
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5540973