Title :
The minimal covering radius t[15,6] of a six-dimensional binary linear code of length 15 is equal to 4
Author :
Simonis, Juriaan
Author_Institution :
Dept. of Math. & Inf., Delft Univ. of Technol., Netherlands
fDate :
9/1/1988 12:00:00 AM
Abstract :
The nonexistence of a binary linear [15,6] code with covering radius 3 is proved by geometrically based arguments. The author also considers the wider application of the techniques
Keywords :
codes; encoding; geometry; geometrically based arguments; minimal covering radius; six-dimensional binary linear code; Binary codes; Error correction codes; Informatics; Linear code; Mathematics; Parity check codes; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
