Title :
Lower bounds on t[n, k] from linear inequalities
Author :
Zhang, Zhen ; Lo, Chiaming
Author_Institution :
Dept. of Electr. Eng.-Syst., Commun. Sci. Inst., Univ. of Southern California, Los Angeles, CA, USA
fDate :
1/1/1992 12:00:00 AM
Abstract :
The linear inequality method for covering codes is used to improve the lower bounds of t[n, k], the smallest covering radius of any [n, k] binary linear code. To make better use of the strength of this method, the relation between the covering radius of a code and the minimum distance of its dual code is studied. The authors obtained 65 improved lower bounds for t[ n, k] within the range of n⩽64
Keywords :
codes; binary linear code; covering codes; covering radius; dual code; linear inequality method; lower bounds; minimum distance; Combinatorial mathematics; Error correction codes; Lattices; Linear code; Notice of Violation; Polarization; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
