scientific article; zbMATH DE number 1189005
From MaRDI portal
Publication:3838697
If the codeword symbols in a Reed-Solomon code over \(\text{GF}(2^m)\) are replaced by the corresponding binary \(m\)-tuples, the result is a binary linear code. For dimensions \(k \leq 3\), the weight distribution of these binary codes is given. This is done by first extending the Reed-Solomon code, then finding the binary weight distribution of some subsets of this code, and finally reducing the codewords by deleting the extra coordinate. Codes obtained by adding a parity check bit to each of the \(m\)-tuples is also considered. For the entire collection see [Zbl 0889.00044].
Recommendations
- scientific article; zbMATH DE number 4193605
- The binary weight distribution of the extended (2 m,2 m-4) code of the Reed-Solomon code over GF(2 m) with generator polynomial (x- )(x- 2)(x- 3)
- Binary weight spectrum of the extended \([2^m,5]\) Reed-Solomon code and its dual code
- Gaps in the binary weight distributions of Reed-Solomon codes
- Restrictions on weight distribution of Reed-Muller codes
Cited in
(7)- The binary weight distribution of the extended (2 m,2 m-4) code of the Reed-Solomon code over GF(2 m) with generator polynomial (x- )(x- 2)(x- 3)
- Binary weight spectrum of the extended \([2^m,5]\) Reed-Solomon code and its dual code
- Gaps in the binary weight distributions of Reed-Solomon codes
- Sparse and Balanced Reed–Solomon and Tamo–Barg Codes
- An average weight-distance enumerator for binary expansions of Reed-Solomon codes
- scientific article; zbMATH DE number 4193605 (Why is no real title available?)
- Non binary codes and ``Mathematica calculations: Reed-Solomon codes over \(\text{GF}(2^n)\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3838697)
