Let q be a power of an odd prime number p. We use finite fields to character q-ary BCH codes, then use puncturing and gluing methods to construct self-orthogonal BCH codes. Finally we obtain families of q-ary quantum codes by using the self-orthogonal BCH codes constructed.
Three code constructions generating new families of good nonbinary quantum codes are presented in this paper. The first two ones are derived from Hermitian self-orthogonal non-narrow-sense Bose-Chaudhuri-Hocquenghem (BCH) codes. The third one is derived from q-ary ($q\ensuremath{\ne}2$ is a prime power) Steane's enlargement of Calderbank-Shor-Steane codes applied to Euclidean self-orthogonal non-narrow-sense BCH codes. The quantum nonbinary BCH codes presented here have parameters better than the ones available in the literature.
Let q ≥ 3 be odd prime power. Maximal designed distances of non-primitive Hermitian dual containing q2- ary BCH codes of length n = (q4-1)/2 and 2(q2-1) are determined. For each given n, a group of non-narrow-sense Hermitian dual containing BCH codes are constructed and their dimensions are computed. Using these non-narrow-sense BCH codes, many new quantum codes are constructed. Our maximal designed distances improve upon the known results in the literature and many of new quantum BCH codes are better than those constructed from narrow-sense BCH codes.
Self-orthogonal codes have nice applications in many areas including quantum codes, lattices and LCD codes. For a prime powerq, it is in general difficult to constructq-ary self-orthogonal codes. In the literature, there exists no simple method to judge whether a generalq-ary linear code is self-orthogonal or not. In this paper, we mainly present several families ofq-ary self-orthogonal codes and study their applications in quantum codes and LCD codes. Firstly, several families ofq-ary linear codes are constructed by some special defining sets. These codes are proved to be self-orthogonal. To this end, we determine the numbers of solutions of some systems of equations over finite fields. Secondly, three families ofq-ary quantum codes with unbounded length and minimum distance three are constructed from the self-orthogonal codes. These quantum codes are optimal according to the quantum Hamming bound. In particular, some of them have better parameters than known ones. Thirdly, several families ofq-ary LCD codes are constructed from the self-orthogonal codes. Many optimal or almost optimal binary and ternary LCD codes are produced by our constructions. Some binary and ternary LCD codes have better parameters than known ones.
Abstract We introduce homothetic-BCH codes. These are a family of q2 q 2 -ary classical codes C C of length λn1 λ n 1 , where λ λ and n1 n 1 are suitable positive integers such that the punctured code B B of C C in the last λn1−n1 λ n 1 - n 1 coordinates is a narrow-sense BCH code of length n1 n 1 . We prove that whenever B B is Hermitian self-orthogonal, so is C C . As a consequence, we present a procedure to obtain quantum stabilizer codes with lengths that cannot be reached by BCH codes. With this procedure, we get new quantum codes according to Grassl’s table (Grassl 2025). To prove our results, we give necessary and sufficient conditions for Hermitian self-orthogonality of BCH codes of a wide range of lengths.