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

DOI10.1016/S0019-9958(76)90355-7MaRDI QIDQ4088712zbMATH OpenOpenAlexFDO

Authors Tadao Kasami, Nobuki Tokura, Saburo Azumi

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)

Cited in

(21)

• On the bias of Reed-Muller codes over odd prime fields
• The degree of functions and weights in linear codes.
• On the volumes and affine types of trades
• Infinite families of 2-designs and 3-designs from linear codes
• Random low-degree polynomials are hard to approximate
• Algebraic theory of block codes detecting independent errors
• The second weight of generalized Reed-Muller codes in most cases
• The weight spectrum of two families of Reed-Muller codes
• Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions
• On the fourth weight of generalized Reed-Muller codes
• On the integrality of \(n\)th roots of generating functions
• Reed-Muller Codes
• On the cardinality spectrum and the number of Latin bitrades of order 3
• Polynomials meeting Ax's bound
• Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes
• On the third weight of generalized Reed-Muller codes
• On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations
• On the non-minimal codewords in binary Reed-Muller codes
• On low weight codewords of generalized affine and projective Reed-Muller codes
• Minimal codewords in Reed-Muller codes
• On degree-d zero-sum sets of full rank

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4088712)