On the weight structure of Reed-Muller codes
From MaRDI portal
Publication:5604973
DOI10.1109/TIT.1970.1054545zbMath0205.20604OpenAlexW2042993834MaRDI QIDQ5604973
Publication date: 1970
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1970.1054545
Related Items (28)
Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes ⋮ Second weight codewords of generalized Reed-Muller codes ⋮ Algebraic theory of block codes detecting independent errors ⋮ The key space of the McEliece–Sidelnikov cryptosystem ⋮ On the cardinality spectrum and the number of Latin bitrades of order 3 ⋮ The weight spectrum of two families of Reed-Muller codes ⋮ On weight distributions for a class of codes with parameters of Reed-Muller codes ⋮ On the Bias of Reed--Muller Codes over Odd Prime Fields ⋮ Inclusion matrices for rainbow subsets ⋮ Random low-degree polynomials are hard to approximate ⋮ On degree-\(d\) zero-sum sets of full rank ⋮ Three parameters of Boolean functions related to their constancy on affine spaces ⋮ Unnamed Item ⋮ Concatenating indicators of flats for designing cryptographic functions ⋮ Infinite families of 2-designs and 3-designs from linear codes ⋮ Minimal codewords in Reed-Muller codes ⋮ On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations ⋮ Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions ⋮ On the volumes and affine types of trades ⋮ On the computation of the Möbius transform ⋮ Computing the number of affine equivalent classes on \(\mathcal{R}(s,n)/\mathcal{R}(k,n)\) ⋮ On the non-minimal codewords in binary Reed-Muller codes ⋮ Satisfying Degree-d Equations over GF[2 n] ⋮ Locally repairable codes with high availability based on generalised quadrangles ⋮ A survey of constructive coding theory, and a table of binary codes of highest known rate ⋮ Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\) ⋮ On hitting-set generators for polynomials that vanish rarely ⋮ Reed-Muller Codes
This page was built for publication: On the weight structure of Reed-Muller codes
