Restrictions on the weight distribution of binary linear codes imposed by the structure of Reed-Muller codes
From MaRDI portal
Publication:4307290
DOI10.1109/18.272480zbMATH Open0802.94017OpenAlexW2033041015MaRDI QIDQ4307290FDOQ4307290
Authors: Juriaan Simonis
Publication date: 4 October 1994
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/827b424a4e00394180e547ee2feea0f6b404728a
Recommendations
Cited In (10)
- A lemma on binomial coefficients and applications to Lee weights modulo \(2^e\) of codes over \(\mathbb Z_4\)
- The degree of functions and weights in linear codes.
- On strongly walk regular graphs, triple sum sets and their codes
- Restrictions on weight distribution of Reed-Muller codes
- The \([46, 9, 20]_2\) code is unique
- Weight Distribution and List-Decoding Size of Reed–Muller Codes
- Title not available (Why is that?)
- A lemma on polynomials modulo \(p^m\) and applications to coding theory
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Restrictions on the weight distribution of binary linear codes imposed by the structure of Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4307290)