Bounds on information combining for the accumulator of repeat-accumulate codes without Gaussian assumption

Ingmar Land, Jossy Sayir, Hoeher Peter A.

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearch

1 Citation (Scopus)
287 Downloads (Pure)
Original languageEnglish
Title of host publicationProceedings on the international symposium of information theory, 2004
PublisherSPIE - International Society for Optical Engineering
Publication date2004
Pages443
ISBN (Print)0-7803-8280-3
DOIs
Publication statusPublished - 2004
EventBounds on information combining for the accumulator of repeat-accumulate codes without Gaussian assumption -
Duration: 27 Jun 20042 Jul 2004

Conference

ConferenceBounds on information combining for the accumulator of repeat-accumulate codes without Gaussian assumption
Period27/06/200402/07/2004

Bibliographical note

Personal use of this publication is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
©2004 IEEE.

Cite this

Land, I., Sayir, J., & Peter A., H. (2004). Bounds on information combining for the accumulator of repeat-accumulate codes without Gaussian assumption. In Proceedings on the international symposium of information theory, 2004 (pp. 443). SPIE - International Society for Optical Engineering. https://doi.org/10.1109/ISIT.2004.1365480