Quantum Bicyclic Hyperbolic Codes

September 26, 2019 Β· 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 Sankara Sai Chaithanya Rayudu, Pradeep Kiran Sarvepalli arXiv ID 1909.11846 Category quant-ph: Quantum Computing Cross-listed cs.IT, math.CO Citations 0 Venue Quantum Information Processing Last Checked 5 months ago
Abstract
Bicyclic codes are a generalization of the one dimensional (1D) cyclic codes to two dimensions (2D). Similar to the 1D case, in some cases, 2D cyclic codes can also be constructed to guarantee a specified minimum distance. Many aspects of these codes are yet unexplored. Motivated by the problem of constructing quantum codes, in this paper, we study some structural properties of certain bicyclic codes. We show that a primitive narrow-sense bicyclic hyperbolic code of length $n^2$ contains its dual if and only if its design distance is lower than $n-Ξ”$, where $Ξ”=\mathcal{O}(\sqrt{n})$. We extend the sufficiency condition to the non-primitive case as well. We also show that over quadratic extension fields, a primitive bicyclic hyperbolic code of length $n^2$ contains Hermitian dual if and only if its design distance is lower than $n-Ξ”_h$, where $Ξ”_h=\mathcal{O}(\sqrt{n})$. Our results are analogous to some structural results known for BCH and Reed-Solomon codes. They further our understanding of bicyclic codes. We also give an application of these results by showing that we can construct two classes of quantum bicyclic codes based on our results.
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 β€” Quantum Computing

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