Some new upper bounds on the covering radius of binary linear codes

1 January 1989

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory

Vol. 35 (1) , 110-122
https://doi.org/10.1109/18.42182

Abstract

A Griesmer-like upper bound on the covering radius, R, is given. To the author's knowledge this is the only upper bound which explicitly depends on all three parameters n, k, and d. An upper bound on R for cyclic codes is then given which depends on the generator polynomial of the cyclic code and which, in many cases, leads to an improvement of the previous bound. An upper bound on the irreducible generator polynomial cyclic codes is also given. New interpretations and applications of the so-called Norse bounds and necessary and sufficient conditions to attain one of these bounds are provided. Generalizations of most of the results for codes over GF(q) are outlined

Keywords

This publication has 25 references indexed in Scilit:

Weight Distributions of Some Irreducible Cyclic Codes
Mathematics of Computation, 1986
On the covering radius of binary, linear codes meeting the Griesmer bound
IEEE Transactions on Information Theory, 1985
Covering radius---Survey and recent results
IEEE Transactions on Information Theory, 1985
The covering radius of cyclic codes of length up to 31 (Corresp.)
IEEE Transactions on Information Theory, 1985
Diagonal Equations Over Large Finite Fields
Canadian Journal of Mathematics, 1984
On the coveting radius of extremal self-dual codes
IEEE Transactions on Information Theory, 1983
Another upper bound on covering radius
IEEE Transactions on Information Theory, 1983
On Uniformly Packed [n , n -k , 4] Codes over GF(q ) and a Class of Caps in PG(k -1, q )
Journal of the London Mathematical Society, 1982
The weight distributions of some minimal cyclic codes (Corresp.)
IEEE Transactions on Information Theory, 1981
On the covering radius of binary codes (Corresp.)
IEEE Transactions on Information Theory, 1978