Optimal linear codes over GF(4)
โ
P.P. Greenough; R. Hill
๐
Article
๐
1994
๐
Elsevier Science
๐
English
โ 653 KB
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 fo