2000 character limit reached
An explicit representation and enumeration for negacyclic codes of length $2^kn$ over $\mathbb{Z}_4+u\mathbb{Z}_4$
Published 27 Nov 2018 in cs.IT and math.IT | (1811.10991v2)
Abstract: In this paper, an explicit representation and enumeration for negacyclic codes of length $2kn$ over the local non-principal ideal ring $R=\mathbb{Z}_4+u\mathbb{Z}_4$ $(u2=0)$ is provided, where $k, n$ are any positive integers and $n$ is odd. As a corollary, all distinct negacyclic codes of length $2k$ over $R$ are listed precisely. Moreover, a mass formula for the number of negacyclic codes of length $2kn$ over $R$ is given and a mistake in [Cryptogr. Commun. (2017) 9: 241--272] is corrected.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.