ON LENGTHENING OF COVERING CODES

: HONKALA I

Publisher: ELSEVIER SCIENCE BV

: 1992

: Discrete Mathematics

: DISCRETE MATHEMATICS

: DISCRETE MATH

: 106

: 291

: 295

: 5

: 0012-365X

DOI: https://doi.org/10.1016/0012-365X(92)90556-U(external)

We study a construction method introduced by Kamps and van Lint and generalized by Blokhuis and Lam, and van Lint jr and show how the theorem of Cauchy and Davenport and other related results about finite fields can be used in the lengthening of covering codes over prime power alphabets.

Mathematics