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 49 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 19 tok/s Pro
GPT-5 High 16 tok/s Pro
GPT-4o 103 tok/s Pro
Kimi K2 172 tok/s Pro
GPT OSS 120B 472 tok/s Pro
Claude Sonnet 4 39 tok/s Pro
2000 character limit reached

All $α+uβ$-constacyclic codes of length $np^{s}$ over $\mathbb{F}_{p^{m}}+u\mathbb{F}_{p^{m}}$ (1606.06428v1)

Published 21 Jun 2016 in cs.IT and math.IT

Abstract: Let $\mathbb{F}{p{m}}$ be a finite field with cardinality $p{m}$ and $R=\mathbb{F}{p{m}}+u\mathbb{F}_{p{m}}$ with $u{2}=0$. We aim to determine all $\alpha+u\beta$-constacyclic codes of length $np{s}$ over $R$, where $\alpha,\beta\in\mathbb{F}{p{m}}{*}$, $n, s\in\mathbb{N}{+}$ and $\gcd(n,p)=1$. Let $\alpha_{0}\in\mathbb{F}{p{m}}{*}$ and $\alpha{0}{p{s}}=\alpha$. The residue ring $R[x]/\langle x{np{s}}-\alpha-u\beta\rangle$ is a chain ring with the maximal ideal $\langle x{n}-\alpha_{0}\rangle$ in the case that $x{n}-\alpha_{0}$ is irreducible in $\mathbb{F}{p{m}}[x]$. If $x{n}-\alpha{0}$ is reducible in $\mathbb{F}_{p{m}}[x]$, we give the explicit expressions of the ideals of $R[x]/\langle x{np{s}}-\alpha-u\beta\rangle$. Besides, the number of codewords and the dual code of every $\alpha+u\beta$-constacyclic code are provided.

Citations (2)

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.

Authors (3)