Two new binary codes obtained by shortening a generalized concatenated code
Ludo Tolhuizen · IEEE Transactions on Information Theory · 1991
The authors construct a (75,13,30) code and a (75,11,32) code. The minimum distances of these codes are one larger than the largest known (T. Verhoeff 1987) minimum distances of codes with the same length and dimension. As a (75,11,33) code does not exist, the (75,11,32) code is, in a sense, optimal. Both codes are obtained by judiciously shortening a (80,14,32) code that is obtained as a generalized concatenated code.>