Constructions of subsystem codes over finite fields
From MaRDI portal
Abstract: Subsystem codes protect quantum information by encoding it in a tensor factor of a subspace of the physical state space. Subsystem codes generalize all major quantum error protection schemes, and therefore are especially versatile. This paper introduces numerous constructions of subsystem codes. It is shown how one can derive subsystem codes from classical cyclic codes. Methods to trade the dimensions of subsystem and co-subystem are introduced that maintain or improve the minimum distance. As a consequence, many optimal subsystem codes are obtained. Furthermore, it is shown how given subsystem codes can be extended, shortened, or combined to yield new subsystem codes. These subsystem code constructions are used to derive tables of upper and lower bounds on the subsystem code parameters.
Recommendations
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1836559 (Why is no real title available?)
- Nonbinary Stabilizer Codes Over Finite Fields
- Nonbinary quantum codes
- On Quantum and Classical BCH Codes
- On subsystem codes beating the quantum Hamming or Singleton bound
- Quantum error correction via codes over GF(4)
Cited in
(15)- Sparse quantum codes from quantum circuits
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- Quantum data-syndrome codes: subsystem and impure code constructions
- Constructions and noise threshold of topological subsystem codes
- On the dimension of subfield subcodes
- New subsystem codes from matrix-product codes
- On subsystem codes beating the quantum Hamming or Singleton bound
- New MDS operator quantum error-correcting codes derived from constacyclic codes over \(\mathbb{F}_{q^2} + v\mathbb{F}_{q^2}\)
- Quantum subsystem codes, CFTs and their \(\mathbb{Z}_2\)-gaugings
- The construction of LDPC codes based on the subspaces of singular linear space over finite field
- Encoding classical information in gauge subsystems of quantum codes
- New optimal asymmetric quantum codes derived from negacyclic codes
- New optimal subsystem codes
- New constructions of optimal subsystem codes
- Some constructions of optimal subsystem codes derived from GRS codes
This page was built for publication: Constructions of subsystem codes over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401875)
