Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 37 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 10 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 84 tok/s Pro
Kimi K2 198 tok/s Pro
GPT OSS 120B 448 tok/s Pro
Claude Sonnet 4 31 tok/s Pro
2000 character limit reached

Hulls of Cyclic Codes over $\mathbb{Z}_4$ (1806.07590v2)

Published 20 Jun 2018 in cs.IT, math.IT, and math.RA

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 $\mathbb{Z}_4$ have been focused on. Their characterization has been established in terms of the generators viewed as ideals in the quotient ring $\mathbb{Z}_4[x]/\langle xn-1\rangle$. An algorithm for computing the types of the hulls of cyclic codes of arbitrary odd length over $\mathbb{Z}_4$ has been given. The average $2$-dimension $E(n)$ of the hulls of cyclic codes of odd length $n$ over $\mathbb{Z}_4$ 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$.

Citations (3)

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.