Lower bounds for $q$-ary codes with large covering radius.

Haas, Wolfgang, Halupczok, Immanuel, and Schlage-Puchta, Jan-Christoph. "Lower bounds for -ary codes with large covering radius.." The Electronic Journal of Combinatorics [electronic only] 16.1 (2009): Research Paper R133, 21 p.-Research Paper R133, 21 p.. <http://eudml.org/doc/228107>.

@article{Haas2009,
author = {Haas, Wolfgang, Halupczok, Immanuel, Schlage-Puchta, Jan-Christoph},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {covering codes; lower bounds; partition matrices},
language = {eng},
number = {1},
pages = {Research Paper R133, 21 p.-Research Paper R133, 21 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Lower bounds for -ary codes with large covering radius.},
url = {http://eudml.org/doc/228107},
volume = {16},
year = {2009},
}

TY - JOUR
AU - Haas, Wolfgang
AU - Halupczok, Immanuel
AU - Schlage-Puchta, Jan-Christoph
TI - Lower bounds for -ary codes with large covering radius.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2009
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 16
IS - 1
SP - Research Paper R133, 21 p.
EP - Research Paper R133, 21 p.
LA - eng
KW - covering codes; lower bounds; partition matrices
UR - http://eudml.org/doc/228107
ER -