Error-correcting codes over an alphabet of four elements (Q5943691)

This papers presents bounds on the maximum size of a code of length \(n\) and minimum distance \(d\), denoted \(A_q(n,d)\). Combinatorial bounds are given, and it is determined when \(A_q(n,d) = M\) for \(q < M < 2q\). Numerous constructions are presented, and a table of the best known bounds on \(A_4(n,d)\) is given for \(n \leq 12\).