Result 1 to 20 of 53 total
On universal LDPC code ensembles over memoryless symmetric channels (English)
IEEE Transactions on Information Theory 57, No. 8, 5182-5202 (2011).
1
Polar coding for reliable communications over parallel channels. (English)
Comput. Res. Repos. 2010, Article No. 1005.2770 (2010).
2
Performance bounds for erasure, list and decision feedback schemes with linear block codes (English)
IEEE Transactions on Information Theory 56, No. 8, 3754-3778 (2010).
3
Performance bounds for nonbinary linear block codes over memoryless symmetric channels (English)
IEEE Transactions on Information Theory 55, No. 3, 977-996 (2009).
4
On universal properties of capacity-approaching LDPC code ensembles (English)
IEEE Transactions on Information Theory 55, No. 7, 2956-2990 (2009).
5
Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel (English)
IEEE Transactions on Information Theory 55, No. 6, 2602-2617 (2009).
6
Correction to "On achievable rates and complexity of LDPC codes over parallel channels: Bounds and applications" [Feb 07 580-598]. (English)
IEEE Trans. Inf. Theory 54, No. 7, 3368 (2008).
7
An improved sphere-packing bound for finite-length codes over symmetric memoryless channels. (English)
IEEE Trans. Inf. Theory 54, No. 5, 1962-1990 (2008).
8
Coding for parallel channels: Gallager bounds and applications to turbo-like codes. (English)
IEEE Trans. Inf. Theory 53, No. 7, 2394-2428 (2007).
9
Tightened upper bounds on the ML decoding error probability of binary linear block codes. (English)
IEEE Trans. Inf. Theory 53, No. 4, 1495-1510 (2007).
10
On achievable rates and complexity of LDPC codes over parallel channels: Bounds and applications. (English)
IEEE Trans. Inf. Theory 53, No. 2, 580-598 (2007).
11
Parity-check density versus performance of binary linear block codes: New bounds and applications. (English)
IEEE Trans. Inf. Theory 53, No. 2, 550-579 (2007).
12
On the error exponents of improved tangential sphere bounds. (English)
IEEE Trans. Inf. Theory 53, No. 3, 1196-1210 (2007).
13
Accumulate-repeat-accumulate codes: Capacity-achieving ensembles of systematic codes for the erasure channel with bounded complexity. (English)
IEEE Trans. Inf. Theory 53, No. 6, 2088-2115 (2007).
14
Bounds on the number of iterations for turbo-like ensembles over the binary erasure channe. (English)
Comput. Res. Repos. 2007, Article No. 0711.1056 (2007).
15
On universal properties of capacity-approaching LDPC ensembles. (English)
Comput. Res. Repos. 2007, Article No. 0709.0599 (2007).
16
An improved sphere-packing bound for finite-length codes on symmetric memoryless channels. (English)
Comput. Res. Repos. 2006, Article No. 0608042 (2006).
17
On the error exponents of some improved tangential-sphere bounds. (English)
Comput. Res. Repos. 2006, Article No. 0607004 (2006).
18
Tightened upper bounds on the ML decoding error probability of binary linear block codes. (English)
Comput. Res. Repos. 2006, Article No. 0607003 (2006).
19
Coding for parallel channels: Gallager bounds for binary linear codes with applications to repeat-accumulate codes and variations. (English)
Comput. Res. Repos. 2006, Article No. 0607002 (2006).
20
Result 1 to 20 of 53 total
Start
Contact
Print
General Help
