A1 Refereed original research article in a scientific journal
ON LENGTHENING OF COVERING CODES
Authors: HONKALA I
Publisher: ELSEVIER SCIENCE BV
Publication year: 1992
Journal: Discrete Mathematics
Journal name in source: DISCRETE MATHEMATICS
Journal acronym: DISCRETE MATH
Volume: 106
First page : 291
Last page: 295
Number of pages: 5
ISSN: 0012-365X
DOI: https://doi.org/10.1016/0012-365X(92)90556-U
Abstract
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.
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.
UTU Research Portal