Minimal codewords in Reed-Muller codes
DOI10.1007/S10623-009-9323-XzbMATH Open1270.94072OpenAlexW2115481128MaRDI QIDQ2267792FDOQ2267792
Authors: Jeroen Schillewaert, Leo Storme, Joseph A. Thas 
Publication date: 2 March 2010
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-009-9323-x
Recommendations
- On the non-minimality of the largest weight codewords in the binary Reed-Muller codes
- On the non-minimal codewords in binary Reed-Muller codes
- scientific article; zbMATH DE number 2143618
- On the weight distribution of some minimal codes
- An extension of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords to a class of Reed-Muller type codes
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Combinatorial structures in finite projective spaces (51E20) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- On the non-minimal codewords in binary Reed-Muller codes
- Title not available (Why is that?)
Cited In (16)
- Title not available (Why is that?)
- On the minimum number of minimal codewords
- Title not available (Why is that?)
- Minimal binary linear codes: a general framework based on bent concatenation
- Construction of minimal linear codes from multi-variable functions
- On the maximum number of minimal codewords
- Ideal access structures based on a class of minimal linear codes
- Minimum distance functions of graded ideals and Reed-Muller-type codes
- On the non-minimality of the largest weight codewords in the binary Reed-Muller codes
- Minimum distance of relative Reed-Muller codes
- Minimum weight bases for quaternary Reed-Muller codes
- Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes
- On the number of minimal codewords in codes generated by the adjacency matrix of a graph
- On the non-minimal codewords in binary Reed-Muller codes
- Minimal trellises for block codes
- Minimum-weight codewords as generators of generalized Reed-Muller codes
This page was built for publication: Minimal codewords in Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267792)
