Optimal linear codes over GF(4)

✍ Scribed by P.P. Greenough; R. Hill

• Publisher: Elsevier Science
• Year: 1994
• Tongue: English
• Weight: 653 KB
• Volume: 125
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/0012-365x(94)90160-0

✦ Synopsis

A central problem in coding theory is that of finding the smallest length for which there exists a linear code of dimension k and minimum distance d, over a field of ~7 elements, We consider here the problem for quaternary codes (q=4), solving the problem for k< 3 for all values of d, and for k=4 for all but ten values of d.