Hermitian dual-containing constacyclic BCH codes and related quantum codes of length q^2m-1/q+1

07/27/2020
by   X. Zhao, et al.
0

In this paper, we study a family of constacyclic BCH codes over 𝔽_q^2 of length n=q^2m-1/q+1, where q is a prime power, and m≥2 an even integer. The maximum design distance of narrow-sense Hermitian dual-containing constacyclic BCH codes of length n 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 (q=2,3,4), our resultant quantum codes can always yield strict dimension or minimum distance gains than the ones obtained by Yuan et al.. Moreover, fixing length n=q^2m-1/q+1, some constructed quantum codes have better parameters or are beneficial complements compared with some known results (Aly et al., IEEE Trans Inf Theory 53(3): 1183-1188, 2007, Li et al., Quantum Inf Process 18(5): 127, 2019, Wang et al., Quantum Inf Process 18(8): 323, 2019, Song et al., Quantum Inf Process 17(10): 1-24, 2018.).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/12/2019

A Class of Narrow-Sense BCH Codes

BCH codes are an important class of cyclic codes which have applications...
research
05/10/2021

Tamper Detection against Unitary Operators

We consider (Enc, Dec) schemes which are used to encode a classical/quan...
research
10/17/2019

Resource theories of communication with quantum superpositions of processes

A novel approach to quantum communication has demonstrated that placing ...
research
05/01/2023

General Distance Balancing for Quantum Locally Testable Codes

In this paper, we prove a lower bound on the soundness of quantum locall...
research
08/13/2019

On Steane-Enlargement of Quantum Codes from Cartesian Product Point Sets

In this work, we study quantum error-correcting codes obtained by using ...
research
02/28/2022

Quantum Tanner codes

Tanner codes are long error correcting codes obtained from short codes a...
research
09/16/2023

On non-expandable cross-bifix-free codes

A cross-bifix-free code of length n over ℤ_q is defined as a non-empty s...

Please sign up or login with your details

Forgot password? Click here to reset