Nonlinear Codes with Low Redundancy

Shu Liu, Chaoping Xing

Determining the largest size, or equivalently finding the lowest redundancy, of q-ary codes for given length and minimum distance is one of the central and fundamental problems in…