Entanglement-Assisted Quasi-Cyclic LDPC Codes

We provide code constructions along with code properties for a few families of entanglement-assisted (EA) Calderbank-Shor-Steane (CSS) codes derived from quasi-cyclic (QC) low-density parity check (LDPC) codes. These codes require only a minimum number of Bell pairs to be shared between the transmitter and the receiver. The Tanner graph of the proposed EA QC LDPC code has girth <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$&gt; 4$</tex>. We evaluate the performance of these codes using both random and Markovian noise models to assess random and burst error performance using a modified-version of the min-sum algorithm.