Binary linear quasi-perfect codes are normal |
| |
Authors: | Hou X.-D. |
| |
Affiliation: | Dept. of Math. & Stat., Wright State Univ., Dayton, OH; |
| |
Abstract: | Whether quasi-perfect codes are normal is addressed. Let C be a code of length n, dimension k, covering radius R, and minimal distance d. It is proved that C is normal if d⩾2R-1. Hence all quasi-perfect codes are normal. Consequently, any [n,k ]R binary linear code with minimal distance d⩾2R-1 is normal |
| |
Keywords: | |
|
|