Error-correcting codes over an alphabet of four elements
Galina T. Bogdanova, Andries E. Brouwer, Stoyan Kapralov, Patric R. J. Östergård · 2002
The problem of finding the values of A/sub q/(n,d)-the maximum size of a code of length n and minimum distance d over an alphabet of q elements-is considered. When q/spl les/M<2q, all parameters for which A/sub q/(n,d)=M are determined. Methods for obtaining upper and lower bounds on A/sub 4/(n,d) are discussed.