Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

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

In English

Författare

Summary, in English

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.

Publiceringsår

2012

Språk

Engelska

Sidor

2265-2279

Publikation/Tidskrift/Serie

IEEE Transactions on Information Theory

Volym

58

Issue

4

Dokumenttyp

Artikel i tidskrift

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • biadjacency matrix
  • convolutional code
  • girth
  • LDPC code
  • minimum distance
  • tailbiting
  • Tanner graph

Status

Published

Forskningsgrupp

  • Information Theory

ISBN/ISSN/Övrigt

  • ISSN: 0018-9448