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>or=2R-1. Hence all quasi-perfect codes are normal. Consequently, any (n,k)R binary linear code with minimal distance d>or=2R-1 is normal. >
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
