Superimposed concatenated codes (Corresp.)
Yasuo Sugiyama, Mone Kasahara, Shigeichi Hirasawa, T. Namekawa · IEEE Transactions on Information Theory · 1980
A family of codes of lengthn=q^{s+l}over GF(q), with2s \leq qare presented which are constructed by superimposing concatenated codes on a concatenated code. The raterand the distance ratio\deltaof the new codes satisfy the relationr=1-\delta+\delta \ln (\delta)for sufficiently large values ofnandq/s. The new codes are superior to the comparable Bose-Chaudhuri-Hocquenghem (BCH) codes, fors\geq 3, in the sense that they contain more codewords. An asymptotically good code constructed using these new codes has a distance ratio greater than those of other asymptotically good codes known to the authors for rates smaller than 0.007.