Du är här

New low-density parity-check codes with large girth based on hypergraphs

Författare:
Publiceringsår: 2010
Språk: Engelska
Sidor: 5
Dokumenttyp: Konferensbidrag

Sammanfattning

The relation between low-density parity-check (LDPC) codes and hypergraphs supports searching for powerful LDPC codes based on hypergraphs. On the other hand, coding theory methods can be used in searching for hypergraphs with large girth. Moreover, compact representations of hypergraphs based on convolutional codes can be found. Algorithms for iteratively constructing LDPC codes with large girths and for determining their minimum distances are introduced. New quasi-cyclic (QC) LDPC codes are presented, some having both optimal girth and optimal minimum distance.

Disputation

Nyckelord

  • Technology and Engineering

Övrigt

International Symposium on Information Theory (ISIT)
2010-06-13/2010-06-18
Austin
Published
Yes
  • Information Theory

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

LERU logo U21 logo