Name
Title | ||
|---|---|---|
Certain generalizations of concatenated codes--Exponential error bounds and decoding complexity |
Abstract | ||
|---|---|---|
New coding and decoding schemes based on concatenated codes are proposed. The new coding schemes are potentially superior to Forney's original concatenation scheme in the sense that for discrete memoryless channels the former has a smaller upper bound on the probability of decoding error for the same order of decoding complexity. |
Year | DOI | Venue |
|---|---|---|
1980 | 10.1109/TIT.1980.1056243 | Information Theory, IEEE Transactions |
Keywords | Field | DocType |
Concatenated codes,Decoding | Information theory,Discrete mathematics,Combinatorics,Concatenated error correction code,Sequential decoding,Upper and lower bounds,Computer science,Serial concatenated convolutional codes,Concatenation,Decoding methods,List decoding | Journal |
Volume | Issue | ISSN |
26 | 5 | 0018-9448 |
Citations | PageRank | References |
6 | 33.94 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shigeichi Hirasawa | 1 | 322 | 150.91 |
| Masao Kasahara | 2 | 290 | 147.60 |
| Yasuo Sugiyama | 3 | 220 | 131.91 |
| Toshihiko Namekawa | 4 | 90 | 107.56 |