Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Globecom Workshops (GC Wkshps)

Protograph Quantum LDPC Codes from Tensor Product of Parity-Check Matrices

Yixuan Xie, Jinhong Yuan

Published Dec 1, 2015• 3 citations
Publisher

Abstract

We propose two constructions, namely Construction 1 and Construction 2, for the design of protograph quantum LDPC codes by exploiting conventional quasi cyclic protograph LDPC codes with lift operation, and tensor product operation, respectively. We show that by carefully designing the proto-matrix using quadratic residue sets of parameters p = 4n ± 1, the proposed Construction 1 yields protograph quantum LDPC codes of various rates. Furthermore, by performing tensor product between two non-binary parity-check matrices obtained from idempotent polynomials of a quadratic residue set, the proposed Construction 2 yields a class of protograph quantum LDPC codes with rate at least 0.9. The performance of the proposed codes over quantum depolarizing channel with iterative sum-product decoding algorithm is shown.

DOI
10.1109/glocomw.2015.7414205

Related papers

Generalized Construction of Quasi-Cyclic Regular LDPC Codes Based on Permutation Matrices

E.M. Gabidulin, Abdolhosein Moinian, Bahram Honary

A new approach is proposed for constructing regular low-density parity-check (LDPC) codes based on tensor product of matrices. In this paper, first a general construction method of regular LDPC codes exploiting permutation matrices is described. Constructed codes have a quasi-cyclic structure with no short cycles of length 4 in their Tanner graph, hence simple encoding while maintaining good performance is achieved. The paper also demonstrates a generalized design, which covers a large family of LDPC codes and number of other construction methods. The new generalized LDPC codes are defined by a small number of parameters and cover a large set of code lengths and rates. Using these codes, LDPC matrices of any column weight and row weight can be constructed. Performance of these codes under iterative decoding compares well with other well-structured as well as random LDPC codes

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2006•16 citations

Design of Quantum LDPC Codes From Quadratic Residue Sets

Yixuan Xie, Jinhong Yuan, Qifu Tyler Sun

We design classes of quantum low-density paritycheck (LDPC) codes, called quasi-cyclic stabilizer (QCS) codes, from conventional QC-LDPC codes. The proposed QCS codes belong to the family of non-Calderbank-Shor-Steane stabilizer codes. The QC-LDPC codes are self-orthogonal with respect to the symplectic inner product (SIP) and are constructed from submatrices of nonorthogonal Latin squares via array dispersion. The Latin squares are constructed using quadratic (non)-residue sets of prime modulus p, where p = 4n ± 1. For p = 4n - 1, two constructions, namely, Type-I-A and Type-I-B QCS codes, are proposed based on matrix superposition and matrix concatenation, respectively. For p = 4n +1, Type-II QCS codes are proposed based on permutations of a base matrix. We show that the parity-check matrix for Type-I-B and Type-II QCS codes is self-orthogonal with respect to the SIP for all orders of circulant permutation matrix. This resulting in ensembles of QCS codes characterized by a single base matrix. We show that the minimum distance of Type-II QCS codes can be lower bounded by the minimum distance of the QC-LDPC codes. Simulation results show that the proposed QCS codes outperform some codes in the literature with a noteworthy low-error floor, below 10-7, over quantum depolarizing channels.

IEEE Transactions on Communications•Apr 17, 2018•14 citations

Quasi-cyclic expansion and encoding algorithms for protograph LDPC codes

Zhongliang Li, Guojiang Xia

Recently, a new class of Low-Density Parity-Check (LDPC) codes constructed from a template was introduced. This kind of codes were called protograph codes. The protograph serves as a blueprint for constructing LDPC codes of arbitrary size whose performance can be predicted by analyzing the protograph. Protograph LDPC codes perform very well and suit for high-speed encoding and decoding. However, there are few researches on expansion and encoding algorithms for them. In this paper, using isomorphism between matrix ring and polynomial ring, we propose efficient quasi-cyclic expansion and encoding algorithms for protograph LDPC codes. Simulation results show that the protograph LDPC codes which were constructed by the algorithm proposed in this paper, outperform the best known unstructured irregular LDPC codes with the same maximum node degrees.

Chinese Journal of Space Science•Jan 1, 2011•0 citations

Quasi-Cyclic LDPC Codes Based on Pre-Lifted Protographs

David G. M. Mitchell, Roxana Smarandache, Daniel J. Costello

Quasi-cyclic low-density parity-check (QC-LDPC) codes based on protographs are of great interest to code designers because analysis and implementation are facilitated by the protograph structure and the use of circulant permutation matrices for protograph lifting. However, these restrictions impose undesirable fixed upper limits on important code parameters, such as minimum distance and girth. In this paper, we consider an approach to constructing QC-LDPC codes that uses a two-step lifting procedure based on a protograph, and, by following this method instead of the usual one-step procedure, we obtain improved minimum distance and girth properties. We also present two new design rules for constructing good QC-LDPC codes using this two-step lifting procedure, and in each case, we obtain a significant increase in minimum distance and achieve a certain guaranteed girth compared with one-step circulant-based liftings. The expected performance improvement is verified by simulation results.

arXiv:1407.5364•IEEE Transactions on Information Theory•Jul 24, 2014•58 citations

Reliable Quantum LDPC Codes over GF(4)

Yixuan Xie, Jinhong Yuan

We propose a method of constructing quantum LDPC codes from multiplicative groups of order p - 1, where p = 4n + 1 is a prime for some positive integer n. The proposed quantum LDPC codes of non-CSS structure are constructed from a pair of classical regular quasi-cyclic (QC) LDPC codes. We show that these classical regular QC-LDPC codes without cycles of length 4 are orthogonal with respect to the symplectic inner product. Moreover, the proposed construction method yields a large number of new quantum LDPC codes with various code lengths and rates. The performance of the proposed quantum LDPC codes over quantum depolarizing channels with an iterative belief-propagation decoding algorithm is evaluated by simulations.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2016•5 citations

Performance of Reed-Solomon Based Quasi-Cyclic LDPC Codes Based on Protograph

Inseon Kim, Hong‐Yeop Song

In this paper, we exploit construction of Reed-Solomon (RS) based Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes using protograph combining two existing QC-LDPC codes construction and experiment the performance of the codes. Two constructions have benefits: One is the construction RS based QC-LDPC codes whose girth is at least 8 and another is protograph based QC-LDPC codes to increase the upper bounds of minimum Hamming distance. We construct the protographs with three strategies and two of them have coding gain in sense of bit error rate compare to existing Reed Solomon based QC-LDPC codes.

International Conference on Information and Communication Technology Convergence (ICTC)•Oct 1, 2018•0 citations
We propose two constructions, namely Construction 1 and Construction 2, for the design of protograph quantum LDPC codes by exploiting conventional quasi cyclic protograph LDPC codes with lift operation, and tensor product operation, respectively. We show that by carefully designing the proto-matrix using quadratic residue sets of parameters p = 4n ± 1, the proposed Construction 1 yields protograph quantum LDPC codes of various rates. Furthermore, by performing tensor product between two non-binary parity-check matrices obtained from idempotent polynomials of a quadratic residue set, the proposed Construction 2 yields a class of protograph quantum LDPC codes with rate at least 0.9. The performance of the proposed codes over quantum depolarizing channel with iterative sum-product decoding algorithm is shown.
A new approach is proposed for constructing regular low-density parity-check (LDPC) codes based on tensor product of matrices. In this paper, first a general construction method of regular LDPC codes exploiting permutation matrices is described. Constructed codes have a quasi-cyclic structure with no short cycles of length 4 in their Tanner graph, hence simple encoding while maintaining good performance is achieved. The paper also demonstrates a generalized design, which covers a large family of LDPC codes and number of other construction methods. The new generalized LDPC codes are defined by a small number of parameters and cover a large set of code lengths and rates. Using these codes, LDPC matrices of any column weight and row weight can be constructed. Performance of these codes under iterative decoding compares well with other well-structured as well as random LDPC codes
We design classes of quantum low-density paritycheck (LDPC) codes, called quasi-cyclic stabilizer (QCS) codes, from conventional QC-LDPC codes. The proposed QCS codes belong to the family of non-Calderbank-Shor-Steane stabilizer codes. The QC-LDPC codes are self-orthogonal with respect to the symplectic inner product (SIP) and are constructed from submatrices of nonorthogonal Latin squares via array dispersion. The Latin squares are constructed using quadratic (non)-residue sets of prime modulus p, where p = 4n ± 1. For p = 4n - 1, two constructions, namely, Type-I-A and Type-I-B QCS codes, are proposed based on matrix superposition and matrix concatenation, respectively. For p = 4n +1, Type-II QCS codes are proposed based on permutations of a base matrix. We show that the parity-check matrix for Type-I-B and Type-II QCS codes is self-orthogonal with respect to the SIP for all orders of circulant permutation matrix. This resulting in ensembles of QCS codes characterized by a single base matrix. We show that the minimum distance of Type-II QCS codes can be lower bounded by the minimum distance of the QC-LDPC codes. Simulation results show that the proposed QCS codes outperform some codes in the literature with a noteworthy low-error floor, below 10-7, over quantum depolarizing channels.
Recently, a new class of Low-Density Parity-Check (LDPC) codes constructed from a template was introduced. This kind of codes were called protograph codes. The protograph serves as a blueprint for constructing LDPC codes of arbitrary size whose performance can be predicted by analyzing the protograph. Protograph LDPC codes perform very well and suit for high-speed encoding and decoding. However, there are few researches on expansion and encoding algorithms for them. In this paper, using isomorphism between matrix ring and polynomial ring, we propose efficient quasi-cyclic expansion and encoding algorithms for protograph LDPC codes. Simulation results show that the protograph LDPC codes which were constructed by the algorithm proposed in this paper, outperform the best known unstructured irregular LDPC codes with the same maximum node degrees.
Quasi-cyclic low-density parity-check (QC-LDPC) codes based on protographs are of great interest to code designers because analysis and implementation are facilitated by the protograph structure and the use of circulant permutation matrices for protograph lifting. However, these restrictions impose undesirable fixed upper limits on important code parameters, such as minimum distance and girth. In this paper, we consider an approach to constructing QC-LDPC codes that uses a two-step lifting procedure based on a protograph, and, by following this method instead of the usual one-step procedure, we obtain improved minimum distance and girth properties. We also present two new design rules for constructing good QC-LDPC codes using this two-step lifting procedure, and in each case, we obtain a significant increase in minimum distance and achieve a certain guaranteed girth compared with one-step circulant-based liftings. The expected performance improvement is verified by simulation results.
We propose a method of constructing quantum LDPC codes from multiplicative groups of order p - 1, where p = 4n + 1 is a prime for some positive integer n. The proposed quantum LDPC codes of non-CSS structure are constructed from a pair of classical regular quasi-cyclic (QC) LDPC codes. We show that these classical regular QC-LDPC codes without cycles of length 4 are orthogonal with respect to the symplectic inner product. Moreover, the proposed construction method yields a large number of new quantum LDPC codes with various code lengths and rates. The performance of the proposed quantum LDPC codes over quantum depolarizing channels with an iterative belief-propagation decoding algorithm is evaluated by simulations.
In this paper, we exploit construction of Reed-Solomon (RS) based Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes using protograph combining two existing QC-LDPC codes construction and experiment the performance of the codes. Two constructions have benefits: One is the construction RS based QC-LDPC codes whose girth is at least 8 and another is protograph based QC-LDPC codes to increase the upper bounds of minimum Hamming distance. We construct the protographs with three strategies and two of them have coding gain in sense of bit error rate compare to existing Reed Solomon based QC-LDPC codes.