A (48, 31, 8) linear code (Corresp.)
V. Rao, Sane Umesh Reddy · IEEE Transactions on Information Theory · 1973
In this paper we construct a linear code having length 48, minimum distance 8, and containing2^{31}codewords. This code is obtained by augmenting a (48,22,8) linear code with2^9- 1 cosets so that the minimum distance is not reduced. The (48,22,8) code used is the direct product of a (16,11,4) extended Hamming code and a (3,2,2) single-parity-check code. The new code has twice as many codewords as the best linear or nonlinear code previously known.