Name
Abstract | ||
|---|---|---|
A decoding scheme is given for some block codes for which it is known how to decode a subcode. It is shown that the proposed decoding scheme can be applied to several BCH codes making it possible to correct many errors beyond the ones guaranteed by the known minimum distance and also the codes will be "effectively" majority decodable. |
Year | DOI | Venue |
|---|---|---|
1969 | 10.1109/TIT.1969.1054345 | Information Theory, IEEE Transactions |
Keywords | Field | DocType |
BCH codes,Block codes,Decoding | Discrete mathematics,Concatenated error correction code,Sequential decoding,Berlekamp–Welch algorithm,Computer science,Serial concatenated convolutional codes,Block code,Algorithm,Reed–Muller code,Linear code,List decoding | Journal |
Volume | Issue | ISSN |
15 | 5 | 0018-9448 |
Citations | PageRank | References |
1 | 0.56 | 3 |
Authors | ||
1 | ||