Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Note on Hamming distance of constacyclic codes of length $p^s$ over $\mathbb F_{p^m} + u\mathbb F_{p^m}$

Published 12 Dec 2016 in cs.IT and math.IT | (1612.03731v1)

Abstract: For any prime $p$, $\lambda$-constacyclic codes of length $ps$ over ${\cal R}=\mathbb{F}{pm} + u\mathbb{F}{pm}$ are precisely the ideals of the local ring ${\cal R}{\lambda}=\frac{{\cal R}[x]}{\left\langle x{ps}-\lambda \right\rangle}$, where $u2=0$. In this paper, we first investigate the Hamming distances of cyclic codes of length $ps$ over ${\cal R}$. The minimum Hamming distances of all cyclic codes of length $ps$ over ${\cal R}$ are determined. Moreover, an isometry between cyclic and $\alpha$-constacyclic codes of length $ps$ over ${\cal R}$ is established, where $\alpha$ is a nonzero element of $\mathbb{F}{pm}$, which carries over the results regarding cyclic codes corresponding to $\alpha$-constacyclic codes of length $ps$ over ${\cal R}$.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

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

Continue Learning

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

Authors (2)

Collections

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