Minimal codewords in Reed-Muller codes

DOI10.1007/S10623-009-9323-XMaRDI QIDQ2267792zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1101474 (Why is no real title available?)
• scientific article; zbMATH DE number 2143618 (Why is no real title available?)
• Minimal vectors in linear codes
• On the non-minimal codewords in binary Reed-Muller codes
• On the weight enumeration of weights less than 2.5d of Reed—Muller codes
• On the weight structure of Reed-Muller codes

Cited in

(16)

• Minimum weight bases for quaternary Reed-Muller codes
• On the non-minimal codewords in binary Reed-Muller codes
• On the minimum number of minimal codewords
• scientific article; zbMATH DE number 67092 (Why is no real title available?)
• Relative generalized Hamming weights of \(q\)-ary Reed-Muller codes
• Ideal access structures based on a class of minimal linear codes
• On the non-minimality of the largest weight codewords in the binary Reed-Muller codes
• Construction of minimal linear codes from multi-variable functions
• Minimum-weight codewords as generators of generalized Reed-Muller codes
• On the maximum number of minimal codewords
• Minimal binary linear codes: a general framework based on bent concatenation
• Minimum distance of relative Reed-Muller codes
• Minimum distance functions of graded ideals and Reed-Muller-type codes
• On the number of minimal codewords in codes generated by the adjacency matrix of a graph
• scientific article; zbMATH DE number 2143618 (Why is no real title available?)
• Minimal trellises for block 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)