Sciweavers

8 search results - page 1 / 2
» Coding theorems for turbo code ensembles
Sort
View
TIT
2002
87views more  TIT 2002»
13 years 4 months ago
Coding theorems for turbo code ensembles
This paper is devoted to a Shannon-theoretic study of turbo codes. We prove that ensembles of parallel and serial turbo codes are "good" in the following sense. For a tur...
Hui Jin, Robert J. McEliece
ETT
2000
106views Education» more  ETT 2000»
13 years 4 months ago
On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice ov...
Igal Sason, Shlomo Shamai
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 4 months ago
On a Low-Rate TLDPC Code Ensemble and the Necessary Condition on the Linear Minimum Distance for Sparse-Graph Codes
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
Iryna Andriyanova, Jean-Pierre Tillich
IEEEMSP
2002
IEEE
166views Multimedia» more  IEEEMSP 2002»
13 years 9 months ago
Joint source-channel coding of binary sources with side information at the decoder using IRA codes
— We use systematic irregular repeat accumulate (IRA) codes as source-channel codes for the transmission of an equiprobable memoryless binary source with side information at the ...
Angelos D. Liveris, Zixiang Xiong, Costas N. Georg...
CADE
1998
Springer
13 years 9 months ago
A Proof Environment for the Development of Group Communication Systems
Abstract. We present a theorem proving environment for the development of reliable and efficient group communication systems. Our approach makes methods of automated deduction appl...
Christoph Kreitz, Mark Hayden, Jason Hickey