On the non-minimal codewords in binary Reed-Muller codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Decoding linear block codes for minimizing word error rate (Corresp.)
- Minimal vectors in linear codes
- On the weight enumeration of weights less than 2.5d of Reed—Muller codes
- On the weight structure of Reed-Muller codes
- Voronoi regions for binary linear block codes
Cited in
(9)- On the next-to-minimal weight of projective Reed-Muller codes
- Minimal codewords in Reed-Muller codes
- scientific article; zbMATH DE number 1933256 (Why is no real title available?)
- On the non-minimality of the largest weight codewords in the binary Reed-Muller codes
- Construction of minimal linear codes from multi-variable functions
- A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller codes
- Even poset and a parity result for binary linear code
- scientific article; zbMATH DE number 2143618 (Why is no real title available?)
- Secret sharing schemes from binary linear codes
This page was built for publication: On the non-minimal codewords in binary Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1811092)