The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

On braided block codes

På svenska

Author

Summary, in English

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

Publishing year

2003

Language

English

Pages

32-32

Publication/Series

Proceedings 2003 IEEE International Symposium on Information Theory. ISIT 2003 (Cat. No.03CH37432)

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • sparsely braided block code family
  • tightly braided block code
  • asymptotic iterative decoding performance

Conference name

IEEE International Symposium on Information Theory, 2003

Conference date

2003-06-29 - 2003-07-04

Conference place

Yokohama, Japan

Status

Published

ISBN/ISSN/Other

  • ISBN: 0-7803-7728-1