Name
Abstract | ||
|---|---|---|
For1 leq i leq m - s- 2and0 leq s leq m -2i, the intersection of the binary BCH code of designed distance2 ^{m-s-1} - 2 ^{m-s-t-1} - 1and length2^m - 1with the shortened(s + 2)th-order Reed-Muller code of length2^m -- 1has codewords of weight2^{m-s-1} - 2^{m-s-t-1} - 1. |
Year | DOI | Venue |
|---|---|---|
1972 | 10.1109/TIT.1972.1054903 | Information Theory, IEEE Transactions |
Keywords | Field | DocType |
binary bch code,primitive bch code,th-order reed-muller code,minimum weight,leq m,bch code,reed muller code,polynomials,bch codes | Discrete mathematics,Combinatorics,Computer science,BCH code,Minimum weight,Binary number | Journal |
Volume | Issue | ISSN |
18 | 6 | 0018-9448 |
Citations | PageRank | References |
14 | 2.18 | 2 |
Authors | ||
2 | ||