A Classification of the Cosets of the Reed-Muller Code R (1, 6)

DOI10.2307/2938682zbMath0724.94016OpenAlexW4229758966MaRDI QIDQ5202627

James Maiorana

Publication date: 1991

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2938682

zbMATH Keywords

symmetry groupsweight distributiontransformation grouporbit representativesaffine rearrangements of a vector spacecoset of a Reed-Muller code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Other finite incidence structures (geometric aspects) (51E30) Software, source code, etc. for problems pertaining to combinatorics (05-04) Software, source code, etc. for problems pertaining to information and communication theory (94-04)

Related Items (22)

Can a differential attack work for an arbitrarily large number of rounds? ⋮ Analysis of affinely equivalent Boolean functions ⋮ Affine equivalence of monomial rotation symmetric Boolean functions: a Pólya's theorem approach ⋮ Unnamed Item ⋮ The Multiplicative Complexity of Boolean Functions on Four and Five Variables ⋮ Affine Equivalency and Nonlinearity Preserving Bijective Mappings over $$\mathbb {F}_2$$ ⋮ Classification of some cosets of the Reed-Muller code ⋮ On the covering radius of the third order Reed-Muller code \(\mathrm{RM}(3, 7)\) ⋮ An Algorithm for Linear, Affine and Spectral Classification of Boolean Functions ⋮ Affine equivalence of quartic homogeneous rotation symmetric Boolean functions ⋮ Counting all bent functions in dimension eight 99270589265934370305785861242880 ⋮ Minimal Sign Representation of Boolean Functions: Algorithms and Exact Results for Low Dimensions ⋮ The number of affine equivalent classes and extended affine equivalent classes of vectorial Boolean functions ⋮ New bounds on the covering radius of the second order Reed-Muller code of length 128 ⋮ The multiplicative complexity of 6-variable Boolean functions ⋮ Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions ⋮ Boolean functions with multiplicative complexity 3 and 4 ⋮ Computing the number of affine equivalent classes on \(\mathcal{R}(s,n)/\mathcal{R}(k,n)\) ⋮ A group algebraic approach to NPN classification of Boolean functions ⋮ Transparency order for Boolean functions: analysis and construction ⋮ On a method of synthesis of correlation-immune Boolean functions ⋮ The covering radius of the Reed-Muller code \(\text{RM}(2, 7)\) is \(40\)

This page was built for publication: A Classification of the Cosets of the Reed-Muller Code R (1, 6)