Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/629418
Title: Construction of Quantum LDPC Codes From Classical Row-Circulant QC-LDPCs
Authors: Zunaira Babar;Panagiotis Botsinis;Dimitrios Alanis;Soon Xin Ng;Lajos Hanzo
subject: Quantum Error Correction|Low Density Parity Check Codes|Iterative Decoding
Year: 2016
Publisher: IEEE
Abstract: Classical row-circulant quasi-cyclic (QC) low-density parity check (LDPC) matrices are known to generate efficient high-rate short and moderate-length QC-LDPC codes, while the comparable random structures exhibit numerous short cycles of length-4. Therefore, we conceive a general formalism for constructing nondual-containing Calderbank-Shor-Steane (CSS)-type quantum low-density parity check (QLDPC) codes from arbitrary classical row-circulant QC-LDPC matrices. We apply our proposed formalism to the classical balanced incomplete block design (BIBD)-based row-circulant QC-LDPC codes for demonstrating that our designed codes outperform their dual-containing CSS-type counterparts as well as the entanglement-assisted (EA)-QLDPC codes.
Description: 
URI: http://localhost/handle/Hannan/164033
http://localhost/handle/Hannan/629418
ISSN: 1089-7798
volume: 20
issue: 1
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7350103.pdf281.31 kBAdobe PDFThumbnail
Preview File
Title: Construction of Quantum LDPC Codes From Classical Row-Circulant QC-LDPCs
Authors: Zunaira Babar;Panagiotis Botsinis;Dimitrios Alanis;Soon Xin Ng;Lajos Hanzo
subject: Quantum Error Correction|Low Density Parity Check Codes|Iterative Decoding
Year: 2016
Publisher: IEEE
Abstract: Classical row-circulant quasi-cyclic (QC) low-density parity check (LDPC) matrices are known to generate efficient high-rate short and moderate-length QC-LDPC codes, while the comparable random structures exhibit numerous short cycles of length-4. Therefore, we conceive a general formalism for constructing nondual-containing Calderbank-Shor-Steane (CSS)-type quantum low-density parity check (QLDPC) codes from arbitrary classical row-circulant QC-LDPC matrices. We apply our proposed formalism to the classical balanced incomplete block design (BIBD)-based row-circulant QC-LDPC codes for demonstrating that our designed codes outperform their dual-containing CSS-type counterparts as well as the entanglement-assisted (EA)-QLDPC codes.
Description: 
URI: http://localhost/handle/Hannan/164033
http://localhost/handle/Hannan/629418
ISSN: 1089-7798
volume: 20
issue: 1
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7350103.pdf281.31 kBAdobe PDFThumbnail
Preview File
Title: Construction of Quantum LDPC Codes From Classical Row-Circulant QC-LDPCs
Authors: Zunaira Babar;Panagiotis Botsinis;Dimitrios Alanis;Soon Xin Ng;Lajos Hanzo
subject: Quantum Error Correction|Low Density Parity Check Codes|Iterative Decoding
Year: 2016
Publisher: IEEE
Abstract: Classical row-circulant quasi-cyclic (QC) low-density parity check (LDPC) matrices are known to generate efficient high-rate short and moderate-length QC-LDPC codes, while the comparable random structures exhibit numerous short cycles of length-4. Therefore, we conceive a general formalism for constructing nondual-containing Calderbank-Shor-Steane (CSS)-type quantum low-density parity check (QLDPC) codes from arbitrary classical row-circulant QC-LDPC matrices. We apply our proposed formalism to the classical balanced incomplete block design (BIBD)-based row-circulant QC-LDPC codes for demonstrating that our designed codes outperform their dual-containing CSS-type counterparts as well as the entanglement-assisted (EA)-QLDPC codes.
Description: 
URI: http://localhost/handle/Hannan/164033
http://localhost/handle/Hannan/629418
ISSN: 1089-7798
volume: 20
issue: 1
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7350103.pdf281.31 kBAdobe PDFThumbnail
Preview File