$m$-adic residue codes over $\mathbb{F}_q[v]/(v^s-v)$ and their application to quantum codes
Ferhat Kuruz, Mustafa Sar{\i}, Mehmet E. Koroglu

TL;DR
This paper explores the algebraic structure of $m$-adic residue codes over a specific quotient ring, determines their parameters, and constructs quantum error-correcting codes from their Gray images, advancing coding theory and quantum computing.
Contribution
It studies the structure and parameters of $m$-adic residue codes over a quotient ring and constructs quantum codes from their dual-containing Gray images.
Findings
Determined idempotent generators of $m$-adic residue codes.
Obtained parameters of optimal codes respecting Griesmer bound.
Constructed quantum codes from dual-containing $m$-adic residue codes.
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 -adic residue codes are the generalization of the duadic codes. The aim of this paper is to study the structure of the -adic residue codes over the quotient ring . We determine the idempotent generators of the -adic residue codes over . We obtain some parameters of optimal -adic residue codes over with respect to Griesmer bound for rings. Furthermore, we derive a condition for -adic residue codes over…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cooperative Communication and Network Coding
