Concatenated codes with large minimum distance (Corresp.)
Lih‐Jyh Weng · IEEE Transactions on Information Theory · 1977
Some concatenated codes of length 128 and less are constructed. Nineteen of these codes are superior to the best previously known linear codes, as shown by the fact that the wellknown lower bound on the minimum distance of the concatenated code as the product of the minimum distances of its component codes exceeds the minimum distance of the best previously known code.