Nonstandard linear recurring sequence subgroups in finite fields and automorphisms of cyclic codes
Henk D.L. Hollmann

TL;DR
This paper classifies nonstandard elements in finite fields, linking them to cyclic codes with automorphisms, and fully characterizes degree two cases using subgroup classifications and recent results.
Contribution
It provides a complete classification of nonstandard elements of degree two over finite fields, connecting them to cyclic codes with extra automorphisms and introducing new types of nonstandard elements.
Findings
Two sporadic nonstandard elements related to Golay codes.
Nonstandard elements of degree two are either of type I or type II.
Complete classification of degree two nonstandard elements achieved.
Abstract
Let be a prime power, and let be an irreducible polynomial over the finite field of size . A zero of is called {\em nonstandard (of degree ) over } if the recurrence relation with characteristic polynomial can generate the powers of in a nontrivial way, that is, with and . In 2003, Brison and Nogueira asked for a characterisation of all nonstandard cases in the case , and solved this problem for a prime, and later for with . In this paper, we first show that classifying nonstandard finite field elements is equivalent to classifying those cyclic codes over generated by a single zero that posses extra permutation automorphisms. Apart from two sporadic examples of degree 11 over…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · graph theory and CDMA systems
