Meny

Javascript is not activated in your browser. This website needs javascript activated to work properly.
Du är här

On the Free Distance of LDPC Convolutional Codes

Författare:
Publiceringsår: 2004
Språk: Engelska
Sidor:
Publikation/Tidskrift/Serie: International Symposium on Information Theory, ISIT 2004. Proceedings.
Dokumenttyp: Konferensbidrag
Förlag: IEEE

Sammanfattning

A lower bound on the free distance of LDPC convolutional codes defined by syndrome former matrices comprised of MtimesM permutation matrices is derived. We show that asymptotically, i.e., as Mrarrinfin, for almost all codes in the ensemble the free distance grows linearly with constraint length

Disputation

Nyckelord

  • Technology and Engineering

Övriga

International Symposium on Information Theory, ISIT 2004
2004-07-02
Published
Yes
  • ISBN: 0-7803-8280-3

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