Quantum Codes from Linear Codes over Finite Chain Rings

April 21, 2017 Β· Declared Dead Β· πŸ› Quantum Information Processing

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Xiusheng Liu, Hualu Liu arXiv ID 1704.06375 Category cs.IT: Information Theory Citations 39 Venue Quantum Information Processing Last Checked 6 months ago
Abstract
In this paper, we provide two methods of constructing quantum codes from linear codes over finite chain rings. The first one is derived from the Calderbank-Shor-Steane (CSS) construction applied to self-dual codes over finite chain rings. The second construction is derived from the CSS construction applied to Gray images of the linear codes over finite chain ring $\mathbb{F}_{p^{2m}}+u\mathbb{F}_{p^{2m}}$. The good parameters of quantum codes from cyclic codes over finite chain rings are obtained.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted