Name
Abstract | ||
|---|---|---|
An extensive study of binary triple-error-correcting codes of primitive lengthn = 2^{m} - 1is reported that results in a complete decoding algorithm whenever the maximum coset weightW_{max}is five. In this regard it is shown thatW_{max} = 5when four dividesm, and strong support is provided for the validity of the conjecture thatW_{max} = 5for allm. The coset weight distribution is determined exactly in some cases and bounded in others. |
Year | DOI | Venue |
|---|---|---|
1976 | 10.1109/TIT.1976.1055530 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
polynomials,weight distribution,frequency,error correction,error correction code,null space,source coding,encoding,information theory,decoding,bch code,bch codes | Discrete mathematics,Combinatorics,Berlekamp–Welch algorithm,BCH code,Decoding methods,Weight distribution,Coset,Mathematics,MAXEkSAT,Binary number,Bounded function | Journal |
Volume | Issue | ISSN |
22 | 2 | 0018-9448 |
Citations | PageRank | References |
12 | 1.96 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jose Antonio van der Horst | 1 | 12 | 2.30 |
| Toby Berger | 2 | 90 | 24.05 |