Minimal codewords in Reed-Muller codes
From MaRDI portal
Publication:2267792
DOI10.1007/s10623-009-9323-xzbMath1270.94072OpenAlexW2115481128MaRDI QIDQ2267792
Storme, L., Joseph A. Thas, Jeroen Schillewaert
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
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Combinatorial structures in finite projective spaces (51E20)
Related Items
On the minimum number of minimal codewords ⋮ Ideal access structures based on a class of minimal linear codes ⋮ Construction of minimal linear codes from multi-variable functions ⋮ On the maximum number of minimal codewords ⋮ On the number of minimal codewords in codes generated by the adjacency matrix of a graph
Cites Work