Show simple item record

dc.contributor.authorLuca, Florian
dc.contributor.authorStănică, Pantelimon
dc.date2016-06-15
dc.date.accessioned2017-04-10T16:55:07Z
dc.date.available2017-04-10T16:55:07Z
dc.date.issued2016-06-15
dc.identifier.citationF. Luca, P. Stănică, "Counting permutation equivalent degree six binary polynomials invariant under the cyclic group," AAECC, v. 28 (2017), pp. 1-10
dc.identifier.urihttp://hdl.handle.net/10945/52632
dc.descriptionThe article of record as published may be found at http://dx.doi.org/10.1007/s00200-016-0294-7
dc.description.abstractIn 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.
dc.publisherSpringer
dc.rightsThis 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.
dc.titleCounting permutation equivalent degree six binary polynomials invariant under the cyclic groupen_US
dc.typeArticle
dc.contributor.corporateNaval Postgraduate School (U.S.)
dc.contributor.departmentApplied Mathematics
dc.subject.authorPrime numbers
dc.subject.authorPermutations
dc.subject.authorAffine equivalence
dc.subject.authorRotation symmetric
dc.subject.authorBoolean functions


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record