Hulls of Cyclic Codes over Z4
Abstract
The hulls of linear and cyclic codes over finite fields have been of interest and extensively studied due to their wide applications. In this paper, the hulls of cyclic codes of length n over the ring Z4 have been focused on. Their characterization has been established in terms of the generators viewed as ideals in the quotient ring Z4[x]/ xn-1. An algorithm for computing the types of the hulls of cyclic codes of arbitrary odd length over Z4 has been given. The average 2-dimension E(n) of the hulls of cyclic codes of odd length n over Z4 has been established. A general formula for E(n) has been provided together with its upper and lower bounds. It turns out that E(n) grows the same rate as n.
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.