Quantum Physics
[Submitted on 5 Jan 2007 (v1), last revised 28 Aug 2010 (this version, v4)]
Title:Quantum Quasi-Cyclic LDPC Codes
View PDFAbstract:In this paper, a construction of a pair of "regular" quasi-cyclic LDPC codes as ingredient codes for a quantum error-correcting code is proposed. That is, we find quantum regular LDPC codes with various weight distributions. Furthermore our proposed codes have lots of variations for length, code rate. These codes are obtained by a descrete mathematical characterization for model matrices of quasi-cyclic LDPC codes.
Our proposed codes achieve a bounded distance decoding (BDD) bound, or known as VG bound, and achieve a lower bound of the code length.
Submission history
From: Manabu Hagiwara [view email][v1] Fri, 5 Jan 2007 10:36:46 UTC (229 KB)
[v2] Wed, 18 Apr 2007 07:13:49 UTC (231 KB)
[v3] Thu, 13 May 2010 04:57:03 UTC (233 KB)
[v4] Sat, 28 Aug 2010 11:46:17 UTC (141 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.