Papers
Topics
Authors
Recent
Search
2000 character limit reached

$m$-adic residue codes over $\mathbb{F}_q[v]/(v^s-v)$ and their application to quantum codes

Published 28 Oct 2018 in cs.IT and math.IT | (1810.11826v2)

Abstract: Due to their rich algebraic structure, cyclic codes have a great deal of significance amongst linear codes. Duadic codes are the generalization of the quadratic residue codes, a special case of cyclic codes. The $m$-adic residue codes are the generalization of the duadic codes. The aim of this paper is to study the structure of the $m$-adic residue codes over the quotient ring $\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{vs} - v} \right\rangle }}$. We determine the idempotent generators of the $m$-adic residue codes over $\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{vs} - v} \right\rangle }}$. We obtain some parameters of optimal $m$-adic residue codes over $\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{vs} - v} \right\rangle }}$ with respect to Griesmer bound for rings. Furthermore, we derive a condition for $m$-adic residue codes over $\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{vs} - v} \right\rangle }}$ to contain their dual. By making use of a preserving-orthogonality Gray map, we construct a family of quantum error correcting codes from the Gray images of dual-containing $m$-adic residue codes over $\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{vs} - v} \right\rangle }}$ and give some examples to illustrate our findings.

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.

Collections

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

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.