On the weight structure of Reed-Muller codes
From MaRDI portal
Publication:5604973
DOI10.1109/TIT.1970.1054545zbMATH Open0205.20604OpenAlexW2042993834MaRDI QIDQ5604973FDOQ5604973
Authors: Tadao Kasami, Nobuki Tokura 
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
Recommendations
Cited In (54)
- Three parameters of Boolean functions related to their constancy on affine spaces
- Correctable Errors of Weight Half the Minimum Distance Plus One for the First-Order Reed-Muller Codes
- On hitting-set generators for polynomials that vanish rarely
- The weight distribution of the third-order Reed-Muller code of length 512
- The degree of functions and weights in linear codes.
- A direct proof of the weight retaining property of polynomials over a finite field
- Orphan structure of the first-order Reed--Muller codes
- Families of Reed-Muller canonical forms
- On the volumes and affine types of trades
- Weight enumerator for second-order Reed-Muller codes
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- On the Reed-Muller codes
- Satisfying degree-\(d\) equations over \(\mathrm{GF}[2]^{n}\)
- Infinite families of 2-designs and 3-designs from linear codes
- Title not available (Why is that?)
- Random low-degree polynomials are hard to approximate
- Algebraic theory of block codes detecting independent errors
- The weight spectrum of two families of Reed-Muller codes
- Weight Distribution and List-Decoding Size of Reed–Muller Codes
- Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions
- Inclusion matrices for rainbow subsets
- Title not available (Why is that?)
- On the computation of the Möbius transform
- Concatenating indicators of flats for designing cryptographic functions
- Weight enumerators of Reed-Muller codes from cubic curves and their duals
- Computing the number of affine equivalent classes on \(\mathcal{R}(s,n)/\mathcal{R}(k,n)\)
- Reed-Muller Codes
- On hitting-set generators for polynomials that vanish rarely
- On Subcodes of Generalized Second Order Reed–Muller Codes
- The Poincaré polynomial of a linear code
- On the cardinality spectrum and the number of Latin bitrades of order 3
- An extension of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords to a class of Reed-Muller type codes
- A survey of constructive coding theory, and a table of binary codes of highest known rate
- Polynomials meeting Ax's bound
- Minimum weight bases for quaternary Reed-Muller codes
- Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes
- Weight polarization and divisibility
- Title not available (Why is that?)
- Locally repairable codes with high availability based on generalised quadrangles
- Weight distributions of the cosets of the (32,6) Reed-Muller code
- On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations
- On weight distributions for a class of codes with parameters of Reed-Muller codes
- On the non-minimal codewords in binary Reed-Muller codes
- Weighted external difference families and R-optimal AMD codes
- Second weight codewords of generalized Reed-Muller codes
- A new proof of Delsarte, Goethals and Mac Williams theorem on minimal weight codewords of generalized Reed-Muller codes
- On trellis structures for Reed-Muller codes
- Title not available (Why is that?)
- Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\)
- Title not available (Why is that?)
- Minimal codewords in Reed-Muller codes
- On degree-\(d\) zero-sum sets of full rank
- The key space of the McEliece–Sidelnikov cryptosystem
- On the bias of Reed-Muller codes over odd prime fields
This page was built for publication: On the weight structure of Reed-Muller codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5604973)
