On the weight enumeration of weights less than 2.5d of Reed—Muller codes
From MaRDI portal
Publication:4088712
DOI10.1016/S0019-9958(76)90355-7zbMath0324.94003MaRDI QIDQ4088712
Tadao Kasami, Nobuki Tokura, Saburo Azumi
Publication date: 1976
Published in: Information and Control (Search for Journal in Brave)
94B99: Theory of error-correcting codes and error-detecting codes
Related Items
Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions, The degree of functions and weights in linear codes., On the integrality of \(n\)th roots of generating functions, Algebraic theory of block codes detecting independent errors, On the non-minimal codewords in binary Reed-Muller codes, Minimal codewords in Reed-Muller codes, The second weight of generalized Reed-Muller codes in most cases, On the Higher Order Nonlinearities of Boolean Functions and S-Boxes, and Their Generalizations