Jointly-check iterative decoding algorithm for quantum sparse graph codes

For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding q...

Full description

Saved in:
Bibliographic Details
Published inChinese physics B Vol. 19; no. 8; pp. 116 - 122
Main Author 邵军虎 白宝明 林伟 周林
Format Journal Article
LanguageEnglish
Published IOP Publishing 01.08.2010
Subjects
Algorithms
Back propagation
BP算法
Decoding
Formalism
Graphs
Iterative methods
Mathematical models
Tanner图
形式主义
稀疏图
迭代解码算法
迭代译码算法
Online AccessGet full text
ISSN1674-1056
2058-3834
DOI10.1088/1674-1056/19/8/080307

Cover

More Information
Summary:For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with standard belief-propagation （BP） algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms standard BP algorithm with an obvious performance improvement.
Bibliography:quantum error correction, sparse graph code, iterative decoding, belief-propagation algorithm
TN911.22
TP301.6
11-5639/O4
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
ISSN:1674-1056
2058-3834
DOI:10.1088/1674-1056/19/8/080307