Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
166 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Explicit representation for a class of Type 2 constacyclic codes over the ring $\mathbb{F}_{2^m}[u]/\langle u^{2λ}\rangle$ with even length (1905.03621v1)

Published 8 May 2019 in cs.IT and math.IT

Abstract: Let $\mathbb{F}{2m}$ be a finite field of cardinality $2m$, $\lambda$ and $k$ be integers satisfying $\lambda,k\geq 2$ and denote $R=\mathbb{F}{2m}[u]/\langle u{2\lambda}\rangle$. Let $\delta,\alpha\in \mathbb{F}_{2m}{\times}$. For any odd positive integer $n$, we give an explicit representation and enumeration for all distinct $(\delta+\alpha u2)$-constacyclic codes over $R$ of length $2kn$, and provide a clear formula to count the number of all these codes. As a corollary, we conclude that every $(\delta+\alpha u2)$-constacyclic code over $R$ of length $2kn$ is an ideal generated by at most $2$ polynomials in the residue class ring $R[x]/\langle x{2kn}-(\delta+\alpha u2)\rangle$.

Summary

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