151 search results - page 3 / 31 » Concatenated Polar Codes |
GLOBECOM
2010
IEEE
14 years 8 months ago
2010
IEEE
1 Shannon's channel capacity specifies the upper bound on the amount of bits per channel use. In this paper, we explicitly demonstrate that twin-component turbo codes suffer f...
TCOM
2011
14 years 5 months ago
2011
—An improved concatenated code structure, which generalizes parallel and serially concatenated convolutional codes is presented and investigated. The structure is ideal for desig...
101
click to vote
TIT
2010
14 years 4 months ago
2010
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
TIT
2010
14 years 4 months ago
2010
We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar...
117
click to vote
ETT
2000
14 years 10 months ago
2000
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...