Publication:
Counting permutation equivalent degree six binary polynomials invariant under the cyclic group

Loading...
Thumbnail Image
Authors
Luca, Florian
Stănică, Pantelimon
Subjects
Prime numbers
Permutations
Affine equivalence
Rotation symmetric
Boolean functions
Advisors
Date of Issue
2016-06-15
Date
2016-06-15
Publisher
Springer
Language
Abstract
In this paper we find an exact formula for the number of affine equivalence classes under permutations for binary polynomials degree d = 6 invariant under the cyclic group (also, called monomial rotation symmetric), for a prime number of variables; this extends previous work for 2 ≤ d ≤ 5.
Type
Article
Description
The article of record as published may be found at http://dx.doi.org/10.1007/s00200-016-0294-7
Series/Report No
Department
Applied Mathematics
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
F. Luca, P. Stănică, "Counting permutation equivalent degree six binary polynomials invariant under the cyclic group," AAECC, v. 28 (2017), pp. 1-10
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Collections