Du är här

Some Voltage Graph-Based LDPC Tailbiting Codes with Large Girth

Författare:
Publiceringsår: 2011
Språk: Engelska
Dokumenttyp: Konferensbidrag

Sammanfattning

The relation between the parity-check matrices of quasi-cyclic (QC) low-density parity-check (LDPC) codes and the biadjacency matrices of bipartite graphs supports searching for powerful LDPC block codes. Algorithms for searching iteratively for LDPC block codes with large girth are presented and constructions based on Steiner Triple Systems and short QC block codes are introduced, leading to new QC regular LDPC block codes with girth up to 24.

Disputation

Nyckelord

  • Technology and Engineering

Övrigt

International Symposium on Information Theory (ISIT)
2011-07-31/2011-08-05
St. Petersburg, Russia
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