Name
Abstract | ||
|---|---|---|
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 ratiodeltaof 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, forsgeq 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. |
Year | DOI | Venue |
|---|---|---|
1980 | 10.1109/TIT.1980.1056267 | Information Theory, IEEE Transactions |
Keywords | Field | DocType |
Concatenated codes | Discrete mathematics,Combinatorics,Concatenated error correction code,Expander code,Reed–Solomon error correction,BCH code,Linear code,Concatenation,Mathematics | Journal |
Volume | Issue | ISSN |
26 | 6 | 0018-9448 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yasuo Sugiyama | 1 | 220 | 131.91 |
| Masao Kasahara | 2 | 290 | 147.60 |
| Shigeichi Hirasawa | 3 | 78 | 53.22 |
| Toshihiko Namekawa | 4 | 90 | 107.56 |