Graphs Associated with Codes of Covering Radius 1 and Minimum Distance 2
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 upp
|Collections||ANU Research Publications|
|Source:||Journal of Combinatorics|
|01_Hall_Graphs_Associated_with_Codes_2008.pdf||149.01 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.