Asymptotic analysis of LDGM-based quantum codes

Author

Liu, Kejing ; García-Frías, Javier

Author_Institution

Dept. of Electr. & Comput. Eng., Univ. of Delaware, Newark, DE

fYear

2009

fDate

18-20 March 2009

Firstpage

87

Lastpage

92

Abstract

We study the error floor performance of a proposed family of LDGM-based quantum codes. LDGM-based quantum codes are Calderbank-Shor-Steane (CSS) codes based on the generator and parity-check matrices of a classical LDGM code. Decoding is performed in an iterative manner, by applying message passing over the corresponding graphs. The proposed codes allow greater flexibility and are easier to design than existing sparse-graph CSS quantum codes, while leading to better performance.

Keywords

error correction codes; iterative decoding; matrix algebra; parity check codes; Calderbank-Shor-Steane codes; LDGM-based quantum codes; asymptotic analysis; decoding; iterative manner; message passing; parity-check matrices; sparse-graph CSS codes; Block codes; Cascading style sheets; Computer errors; Error correction codes; Iterative decoding; Message passing; Parity check codes; Performance analysis; Quantum computing; Sparse matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Sciences and Systems, 2009. CISS 2009. 43rd Annual Conference on

Conference_Location

Baltimore, MD

Print_ISBN

978-1-4244-2733-8

Electronic_ISBN

978-1-4244-2734-5

Type

conf

DOI

10.1109/CISS.2009.5054696

Filename

5054696