Abstract | ||
---|---|---|
In this correspondence, we present a new class of binary codes that are constructed on the basis of BCH codes. Some examples of these codes are given, having more codewords than the best codes previously known (to the authors) with the same minimum distance and number of check symbols. A decoding algorithm for the codes is also described. |
Year | DOI | Venue |
---|---|---|
1975 | 10.1109/TIT.1975.1055427 | Information Theory, IEEE Transactions |
Keywords | Field | DocType |
BCH codes,Error-correcting codes | Discrete mathematics,BCJR algorithm,Combinatorics,Berlekamp–Welch algorithm,Computer science,Block code,Expander code,BCH code,Reed–Muller code,Linear code,Tornado code | Journal |
Volume | Issue | ISSN |
21 | 5 | 0018-9448 |
Citations | PageRank | References |
4 | 3.64 | 4 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Masao Kasahara | 1 | 290 | 147.60 |
Yasuo Sugiyama | 2 | 220 | 131.91 |
Shigeichi Hirasawa | 3 | 78 | 53.22 |
Toshihiko Namekawa | 4 | 90 | 107.56 |