A Note on The Enumeration of Euclidean Self-Dual Skew-Cyclic Codes over Finite Fields
Abstract
In this paper we give the enumeration formulas for Euclidean self-dual skew-cyclic codes over finite fields when (n,|θ|)=1 and for some cases when (n,|θ|)>1, where n is the length of the code and |θ| is the order of automorphism θ.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.