Du är här

On braided block codes

Publiceringsår: 2003
Språk: Engelska
Sidor: 32-32
Publikation/Tidskrift/Serie: Proceedings 2003 IEEE International Symposium on Information Theory. ISIT 2003 (Cat. No.03CH37432)
Dokumenttyp: Konferensbidrag
Förlag: IEEE

Sammanfattning

Two families of braided block codes are analyzed, tightly braided block codes and sparsely braided block codes. Bounds on the free distance of tightly braided block codes are derived. Asymptotic iterative decoding performance of sparsely braided block codes is studied

Disputation

Nyckelord

  • Technology and Engineering
  • sparsely braided block code family
  • tightly braided block code
  • asymptotic iterative decoding performance

Övrigt

Proceedings 2003 IEEE International Symposium on Information Theory
2003-06-29/2003-07-04
Yokohama, Japan
Published
Yes
  • ISBN: 0-7803-7728-1

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