On the weight enumeration of weights less than 2.5d of Reed—Muller codes

DOI10.1016/S0019-9958(76)90355-7zbMath0324.94003OpenAlexW2038242066MaRDI QIDQ4088712

Tadao Kasami, Saburo Azumi, Nobuki Tokura

Publication date: 1976

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(76)90355-7

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (21)

The second weight of generalized Reed-Muller codes in most cases ⋮ On the integrality of \(n\)th roots of generating functions ⋮ Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes ⋮ Algebraic theory of block codes detecting independent errors ⋮ On low weight codewords of generalized affine and projective Reed-Muller codes ⋮ On the fourth weight of generalized Reed-Muller codes ⋮ On the cardinality spectrum and the number of Latin bitrades of order 3 ⋮ The weight spectrum of two families of Reed-Muller codes ⋮ On the Bias of Reed--Muller Codes over Odd Prime Fields ⋮ Random low-degree polynomials are hard to approximate ⋮ On degree-\(d\) zero-sum sets of full rank ⋮ The degree of functions and weights in linear codes. ⋮ 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 non-minimal codewords in binary Reed-Muller codes ⋮ Polynomials meeting Ax’s bound ⋮ On the third weight of generalized Reed-Muller codes ⋮ Reed-Muller Codes

This page was built for publication: On the weight enumeration of weights less than 2.5d of Reed—Muller codes