Hermitian dual-containing constacyclic BCH codes and related quantum codes of length $\frac{q^{2m}-1}{q+1}$
X. Zhao, X. Li, Q. Wang, T. Yan

TL;DR
This paper investigates a special class of constacyclic BCH codes over finite fields, determines their parameters, and constructs improved quantum codes with better or comparable properties to existing results.
Contribution
It provides explicit parameters for Hermitian dual-containing constacyclic BCH codes of specific length and derives quantum codes with enhanced dimensions or minimum distances.
Findings
Maximum design distance of codes determined
Exact code dimensions computed
Quantum codes with improved parameters constructed
Abstract
In this paper, we study a family of constacyclic BCH codes over of length , where is a prime power, and an even integer. The maximum design distance of narrow-sense Hermitian dual-containing constacyclic BCH codes of length is determined. Furthermore, the exact dimension of the constacyclic BCH codes with given design distance is computed. As a consequence, we are able to derive the parameters of quantum codes as a function of their design parameters of the associated constacyclic BCH codes. This improves the result by Yuan et al. (Des Codes Cryptogr 85(1): 179-190, 2017), showing that with the same lengths, except for three trivial cases (), our resultant quantum codes can always yield strict dimension or minimum distance gains than the ones obtained by Yuan et al.. Moreover, fixing length ,…
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
TopicsQuantum Computing Algorithms and Architecture · Coding theory and cryptography
