Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and 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 164 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 16 tok/s Pro
GPT-5 High 21 tok/s Pro
GPT-4o 117 tok/s Pro
Kimi K2 208 tok/s Pro
GPT OSS 120B 441 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

On $(α+uβ)$-constacyclic codes of length $p^sn$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$ (1511.02743v2)

Published 9 Nov 2015 in cs.IT and math.IT

Abstract: Let $\mathbb{F}{pm}$ be a finite field of cardinality $pm$ and $R=\mathbb{F}{pm}[u]/\langle u2\rangle=\mathbb{F}{pm}+u\mathbb{F}{pm}$ $(u2=0)$, where $p$ is an odd prime and $m$ is a positive integer. For any $\alpha,\beta\in \mathbb{F}{pm}{\times}$, the aim of this paper is to represent all distinct $(\alpha+u\beta)$-constacyclic codes over $R$ of length $psn$ and their dual codes, where $s$ is a nonnegative integer and $n$ is a positive integer satisfying ${\rm gcd}(p,n)=1$. Especially, all distinct $(2+u)$-constacyclic codes of length $6\cdot 5t$ over $\mathbb{F}{3}+u\mathbb{F}_3$ and their dual codes are listed, where $t$ is a positive integer.

Citations (11)

Summary

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

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (2)

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

Collections

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