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 the Free Distance of LDPC Convolutional Codes

På svenska

Author

Summary, in English

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

Publishing year

2004

Language

English

Pages

312-312

Publication/Series

International Symposium on Information Theory, ISIT 2004. Proceedings.

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

IEEE International Symposium on Information Theory (ISIT), 2004

Conference date

2004-06-27 - 2004-07-02

Conference place

Chicago, IL, United States

Status

Published

ISBN/ISSN/Other

  • ISBN: 0-7803-8280-3