Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

Searching for voltage graph-based LDPC tailbiting codes with large girth

Publiceringsår: 2012
Språk: Engelska
Sidor: 2265-2279
Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
Volym: 58
Nummer: 4
Dokumenttyp: Artikel i tidskrift
Förlag: IEEE--Institute of Electrical and Electronics Engineers Inc.


The relation between parity-check matrices of quasi-cyclic (QC) low-density parity-check (LDPC) codes and biadjacency matrices of bipartite graphs supports searching for powerful LDPC block codes. Using the principle of tailbiting, compact representations of bipartite graphs based on convolutional codes can be found.

Bounds on the girth and the minimum distance of LDPC block codes constructed in such a way are discussed. Algorithms for searching iteratively for LDPC block codes with large girth and for determining their minimum distance are presented. Constructions based on all-one matrices, Steiner Triple Systems, and QC block codes are introduced. Finally, new QC regular LDPC block codes with girth up to 24 are given.


  • Electrical Engineering, Electronic Engineering, Information Engineering
  • biadjacency matrix
  • convolutional code
  • girth
  • LDPC code
  • minimum distance
  • tailbiting
  • Tanner graph


  • Information Theory-lup-obsolete
  • ISSN: 0018-9448

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen