A Class of Quantum LDPC Codes Constructed From Finite Geometries

Download Now Free registration required

Executive Summary

Low-Density Parity Check (LDPC) codes are a significant class of classical codes with many applications. Several good LDPC codes have been constructed using random, algebraic, and finite geometries approaches, with containing cycles of length at least six in their Tanner graphs. However, it is impossible to design a self-orthogonal parity check matrix of an LDPC code without introducing cycles of length four. In this paper, a new class of quantum LDPC codes based on lines and points of finite geometries is constructed.

  • Format: PDF
  • Size: 147.8 KB