Quantum Synchronizable Codes From Finite Geometries
From MaRDI portal
Abstract: Quantum synchronizable error-correcting codes are special quantum error-correcting codes that are designed to correct both the effect of quantum noise on qubits and misalignment in block synchronization. It is known that in principle such a code can be constructed through a combination of a classical linear code and its subcode if the two are both cyclic and dual-containing. However, finding such classical codes that lead to promising quantum synchronizable error-correcting codes is not a trivial task. In fact, although there are two families of classical codes that are proved to produce quantum synchronizable codes with good minimum distances and highest possible tolerance against misalignment, their code lengths have been restricted to primes and Mersenne numbers. In this paper, examining the incidence vectors of projective spaces over the finite fields of characteristic , we give quantum synchronizable codes from cyclic codes whose lengths are not primes or Mersenne numbers. These projective geometric codes achieve good performance in quantum error correction and possess the best possible ability to recover synchronization, thereby enriching the variety of good quantum synchronizable codes. We also extend the current knowledge of cyclic codes in classical coding theory by explicitly giving generator polynomials of the finite geometric codes and completely characterizing the minimum weight nonzero codewords. In addition to the codes based on projective spaces, we carry out a similar analysis on the well-known cyclic codes from Euclidean spaces that are known to be majority logic decodable and determine their exact minimum distances.
Cited in
(15)- Algebraic quantum synchronizable codes
- Two classes of quantum synchronizable codes
- Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)
- QSCs from the Euclidean sums of cyclic codes over finite rings
- Two new families of quantum synchronizable codes
- New quantum codes derived from cyclic codes
- Non-binary quantum synchronizable codes based on cyclic codes over \(\mathrm{F}_q\)
- Quantum synchronizable codes from finite rings
- Quantum synchronizable codes from repeated-root quasi-cyclic codes
- Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\)
- Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)
- Some quantum synchronizable codes with explicit distance
- Quantum synchronizable codes from quaternary cyclotomy over \(Z_{2n}\)
- Construction of good cyclic codes and quantum error correcting codes using reversed Dickson polynomials
- Applications of order six cyclotomy to construct CSS quantum codes and quantum synchronizable codes
This page was built for publication: Quantum Synchronizable Codes From Finite Geometries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983377)
