-
1
-
-
33750939885
-
Life above threshold: From list decoding to area theorem and MSE
-
San Antonio, TX, Oct
-
C. Méasson, A. Montanari, T. Richardson, and R. Urbanke, "Life above threshold: From list decoding to area theorem and MSE," in Proc. IEEE Information Theory Workshop, San Antonio, TX, Oct. 2004.
-
(2004)
Proc. IEEE Information Theory Workshop
-
-
Méasson, C.1
Montanari, A.2
Richardson, T.3
Urbanke, R.4
-
2
-
-
33749434954
-
Maximum a posteriori decoding and turbo codes for general memoryless channels
-
Adelaide, Australia, Sep
-
C. Méasson, A. Montanari, T. Richardson, and R. Urbanke, "Maximum a posteriori decoding and turbo codes for general memoryless channels," in Proc. e IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 1241-1245.
-
(2005)
Proc. e IEEE Int. Symp. Information Theory
, pp. 1241-1245
-
-
Méasson, C.1
Montanari, A.2
Richardson, T.3
Urbanke, R.4
-
3
-
-
5044245508
-
An upper-bound on the ML thresholds of LDPC ensembles over the BEC
-
Monticello, IL, Oct
-
C. Méasson and R. Urbanke, "An upper-bound on the ML thresholds of LDPC ensembles over the BEC," in Proc. 41th Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Oct. 2003.
-
(2003)
Proc. 41th Annu. Allerton Conf. Communication, Control and Computing
-
-
Méasson, C.1
Urbanke, R.2
-
4
-
-
5044245033
-
Maxwell's construction: The hidden bridge between maximum-likelihood and iterative decoding
-
Chicago, IL, Jun./Jul
-
C. Méasson, A. Montanari, and R. Urbanke, "Maxwell's construction: The hidden bridge between maximum-likelihood and iterative decoding," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 224.
-
(2004)
Proc. IEEE Int. Symp. Information Theory
, pp. 224
-
-
Méasson, C.1
Montanari, A.2
Urbanke, R.3
-
5
-
-
57449105742
-
Maxwell's construction: The hidden bridge between iterative and maximum a posteriori decoding
-
Dec
-
C. Méasson, A. Montanari, and R. Urbanke, "Maxwell's construction: The hidden bridge between iterative and maximum a posteriori decoding," IEEE Trans. Inf. Theory., vol. 54, no. 12, Dec. 2008.
-
(2008)
IEEE Trans. Inf. Theory
, vol.54
, Issue.12
-
-
Méasson, C.1
Montanari, A.2
Urbanke, R.3
-
6
-
-
17644382199
-
-
D. Guo, S. Shamai (Shitz), and S. Verdú, Mutual information and conditional mean estimation in Poisson channels, in Proc. IEEE Informormation Theory Workshop, San Antonio, TX, Oct. 2004, pp. 265-270.
-
D. Guo, S. Shamai (Shitz), and S. Verdú, "Mutual information and conditional mean estimation in Poisson channels," in Proc. IEEE Informormation Theory Workshop, San Antonio, TX, Oct. 2004, pp. 265-270.
-
-
-
-
7
-
-
17644366813
-
-
D. Guo, S. Shamai (Shitz), and S. Verdú, Mutual information and minimum mean-square error in gaussian channels, IEEE Trans. Inf. Theory, 51, no. 4, pp. 1261-1882, Apr. 2005.
-
D. Guo, S. Shamai (Shitz), and S. Verdú, "Mutual information and minimum mean-square error in gaussian channels," IEEE Trans. Inf. Theory, vol. 51, no. 4, pp. 1261-1882, Apr. 2005.
-
-
-
-
8
-
-
33749439323
-
Correlation inequalities: A useful tool in the theory of LDPC codes
-
Adelaide, Australia, Sep
-
N. Macris, "Correlation inequalities: A useful tool in the theory of LDPC codes," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 2369-2373.
-
(2005)
Proc. IEEE Int. Symp. Information Theory
, pp. 2369-2373
-
-
Macris, N.1
-
9
-
-
70350728760
-
-
D. Guo, S. Shamai (Shitz), and S. Verdú, Additive non-gaussian noise channels: Mutual information and conditional mean estimation, in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 719-723.
-
D. Guo, S. Shamai (Shitz), and S. Verdú, "Additive non-gaussian noise channels: Mutual information and conditional mean estimation," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 719-723.
-
-
-
-
10
-
-
26444493543
-
On mutual information, likelihood-ratios and estimation error for the additive gaussian channel
-
submitted for publication
-
M. Zakai, "On mutual information, likelihood-ratios and estimation error for the additive gaussian channel," IEEE Trans. Inf. Theory submitted for publication.
-
IEEE Trans. Inf. Theory
-
-
Zakai, M.1
-
12
-
-
0035246316
-
Efficient erasure correcting codes
-
Feb
-
M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. A. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
-
(2001)
IEEE Trans. Inf. Theory
, vol.47
, Issue.2
, pp. 569-584
-
-
Luby, M.1
Mitzenmacher, M.2
Shokrollahi, A.3
Spielman, D.A.4
-
13
-
-
0035246580
-
Improved low-density parity-check codes using irregular graphs
-
Feb
-
M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. A. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
-
(2001)
IEEE Trans. Inf. Theory
, vol.47
, Issue.2
, pp. 585-598
-
-
Luby, M.1
Mitzenmacher, M.2
Shokrollahi, A.3
Spielman, D.A.4
-
14
-
-
0035246307
-
The capacity of low-density parity check codes under message-passing decoding
-
Feb
-
T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
-
(2001)
IEEE Trans. Inf. Theory
, vol.47
, Issue.2
, pp. 599-618
-
-
Richardson, T.1
Urbanke, R.2
-
15
-
-
0035246127
-
Design of capacity-approaching irregular low-density parity-check codes
-
Feb
-
T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
-
(2001)
IEEE Trans. Inf. Theory
, vol.47
, Issue.2
, pp. 619-637
-
-
Richardson, T.1
Shokrollahi, A.2
Urbanke, R.3
-
16
-
-
2442425417
-
Extrinsic information transfer functions: Model and erasure channel property
-
Nov
-
A. Ashikhmin, G. Kramer, and S. ten Brink, "Extrinsic information transfer functions: Model and erasure channel property," IEEE Trans. Inf. Theory, vol. 50, no. 11, pp. 2657-2673, Nov. 2004.
-
(2004)
IEEE Trans. Inf. Theory
, vol.50
, Issue.11
, pp. 2657-2673
-
-
Ashikhmin, A.1
Kramer, G.2
ten Brink, S.3
-
17
-
-
0032670935
-
Convergence of iterative decoding
-
May
-
S. ten Brink, "Convergence of iterative decoding," Electron. Lett. vol. 35, no. 10, pp. 806-808, May 1999.
-
(1999)
Electron. Lett
, vol.35
, Issue.10
, pp. 806-808
-
-
ten Brink, S.1
-
19
-
-
0034467185
-
Designing iterative decoding schemes with the extrinsic information transfer chart
-
S. ten Brink, "Designing iterative decoding schemes with the extrinsic information transfer chart," AEU Int. J. Electron. Commun., vol. 54, pp. 389-398, 2000.
-
(2000)
AEU Int. J. Electron. Commun
, vol.54
, pp. 389-398
-
-
ten Brink, S.1
-
20
-
-
0003114053
-
Iterative decoding trajectories of parallel concatenated codes
-
Munich, Germany, Jan
-
S. ten Brink, "Iterative decoding trajectories of parallel concatenated codes," in Proc. 3rd IEEE/ITG Conf. Source Channel Coding, Munich, Germany, Jan. 2000, pp. 75-80.
-
(2000)
Proc. 3rd IEEE/ITG Conf. Source Channel Coding
, pp. 75-80
-
-
ten Brink, S.1
-
21
-
-
0035481826
-
Convergence behavior of iteratively decoded parallel concatenated codes
-
Oct
-
S. ten Brink, "Convergence behavior of iteratively decoded parallel concatenated codes," IEEE Trans. Commun., vol. 49, no. 10, pp. 1727-1737, Oct. 2001.
-
(2001)
IEEE Trans. Commun
, vol.49
, Issue.10
, pp. 1727-1737
-
-
ten Brink, S.1
-
23
-
-
2442440469
-
Bounds on information combining
-
Brest, France, Sep
-
I. Land, P. Hoeher, S. Huettinger, and J. B. Huber, "Bounds on information combining," in Proc. 3rd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2003, pp. 39-42.
-
(2003)
Proc. 3rd Int. Symp. Turbo Codes and Related Topics
, pp. 39-42
-
-
Land, I.1
Hoeher, P.2
Huettinger, S.3
Huber, J.B.4
-
25
-
-
70350702754
-
-
I. Sutskover, S. Shamai (Shitz), and J. Ziv, Extremes of information combining, in Proc. 41th Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, 2003.
-
I. Sutskover, S. Shamai (Shitz), and J. Ziv, "Extremes of information combining," in Proc. 41th Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, 2003.
-
-
-
-
26
-
-
3943053975
-
-
D. Guo, S. Shamai (Shitz), and S. Verdú, Mutual information and MMSE in gaussian channels, in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 349.
-
D. Guo, S. Shamai (Shitz), and S. Verdú, "Mutual information and MMSE in gaussian channels," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 349.
-
-
-
-
27
-
-
0000210350
-
The glassy phase of Gallager codes
-
A. Montanari, "The glassy phase of Gallager codes," Eur. Phys. J. B vol. 23, pp. 121-136, 2001.
-
(2001)
Eur. Phys. J. B
, vol.23
, pp. 121-136
-
-
Montanari, A.1
-
28
-
-
26444602447
-
Tight bounds for LDPC and LDGM codes under MAP decoding
-
Sep
-
A. Montanari, "Tight bounds for LDPC and LDGM codes under MAP decoding," IEEE Trans. Infm. Theory, vol. 51, no. 9, pp. 3221-3246, Sep. 2005.
-
(2005)
IEEE Trans. Infm. Theory
, vol.51
, Issue.9
, pp. 3221-3246
-
-
Montanari, A.1
-
29
-
-
70350714396
-
Improved bounds on the parity-check density and achievable rates of binary linear block codes with applications to LDPC codes
-
submitted for publication
-
G.Wiechman and I. Sason, "Improved bounds on the parity-check density and achievable rates of binary linear block codes with applications to LDPC codes," IEEE Trans. Inf. Theory, submitted for publication.
-
IEEE Trans. Inf. Theory
-
-
Wiechman, G.1
Sason, I.2
-
30
-
-
0036714055
-
Upper bounds on the rate of LDPC codes
-
Sep
-
D. Burshtein, M. Krivelevich, S. L. Litsyn, and G. Miller, "Upper bounds on the rate of LDPC codes," IEEE Trans. Inf. Theory, vol. 48, no. 9, pp. 2437-2449, Sep. 2002.
-
(2002)
IEEE Trans. Inf. Theory
, vol.48
, Issue.9
, pp. 2437-2449
-
-
Burshtein, D.1
Krivelevich, M.2
Litsyn, S.L.3
Miller, G.4
-
33
-
-
13444293269
-
Bounds on information combining
-
Feb
-
I. Land, P. Hoeher, S. Huettinger, and J. B. Huber, "Bounds on information combining," IEEE Trans. Inf. Theory, vol. 51, no. 2, pp. 612-619, Feb. 2005.
-
(2005)
IEEE Trans. Inf. Theory
, vol.51
, Issue.2
, pp. 612-619
-
-
Land, I.1
Hoeher, P.2
Huettinger, S.3
Huber, J.B.4
-
34
-
-
70350705926
-
-
I. Sutskover, S. Shamai(Shitz), and J. Ziv, Constrained information combining: Theory and applications for LDPC coded systems, IEEE Trans. Inf. Theory, submitted for publication.
-
I. Sutskover, S. Shamai(Shitz), and J. Ziv, "Constrained information combining: Theory and applications for LDPC coded systems," IEEE Trans. Inf. Theory, submitted for publication.
-
-
-
-
35
-
-
17644370921
-
An MSE based transfer chart to analyze iterative decoding schemes
-
Monticello, IL, Oct
-
K. Bhattad and K. R. Narayanan, "An MSE based transfer chart to analyze iterative decoding schemes," in Proc. Allerton Conf. Communications, Control and Computing, Monticello, IL, Oct. 2004.
-
(2004)
Proc. Allerton Conf. Communications, Control and Computing
-
-
Bhattad, K.1
Narayanan, K.R.2
-
36
-
-
70350704771
-
-
A. Shokrollahi, Capacity-achieving sequences, in Codes, Systems, and Graphical Models, B. Marcus and J. Rosenthal, Eds. New York: Springer-Verlag, 2000, 123, IMA in Mathematics and its Applications, pp. 153-166.
-
A. Shokrollahi, "Capacity-achieving sequences," in Codes, Systems, and Graphical Models, B. Marcus and J. Rosenthal, Eds. New York: Springer-Verlag, 2000, vol. 123, IMA Volumes in Mathematics and its Applications, pp. 153-166.
-
-
-
-
37
-
-
0034857441
-
Capacity achieving sequences for the erasure channel
-
Washington, DC, Jun
-
P. Oswald and A. Shokrollahi, "Capacity achieving sequences for the erasure channel," in Proc. Int. Symp. Information Theory, Washington, DC, Jun. 2001, p. 48.
-
(2001)
Proc. Int. Symp. Information Theory
, pp. 48
-
-
Oswald, P.1
Shokrollahi, A.2
-
39
-
-
0036354703
-
Code rate and the area under extrinsic information transfer curves
-
Lausanne, Switzerland, Jun./Jul
-
A. Ashikhmin, G. Kramer, and S. ten Brink, "Code rate and the area under extrinsic information transfer curves," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun./Jul. 2002, p. 115.
-
(2002)
Proc. IEEE Int. Symp. Information Theory
, pp. 115
-
-
Ashikhmin, A.1
Kramer, G.2
ten Brink, S.3
-
40
-
-
38849147294
-
Asymptotic analysis of turbo codes over the binary erasure channel
-
Saas Fee, Switzerland, Mar
-
C. Méasson and R. Urbanke, "Asymptotic analysis of turbo codes over the binary erasure channel," in Proc. 12th Joint Conf. Communications and Coding, Saas Fee, Switzerland, Mar. 2002.
-
(2002)
Proc. 12th Joint Conf. Communications and Coding
-
-
Méasson, C.1
Urbanke, R.2
-
41
-
-
0141938907
-
Further analytic properties of EXIT-like curves and applications
-
Yokohama, Japan, Jun./Jul
-
C. Méasson and R. Urbanke, "Further analytic properties of EXIT-like curves and applications," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 266.
-
(2003)
Proc. IEEE Int. Symp. Information Theory
, pp. 266
-
-
Méasson, C.1
Urbanke, R.2
-
43
-
-
0030110651
-
Iterative decoding of binary block and convolutional codes
-
Mar
-
J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 429-445, Mar. 1996.
-
(1996)
IEEE Trans. Inf. Theory
, vol.42
, Issue.2
, pp. 429-445
-
-
Hagenauer, J.1
Offer, E.2
Papke, L.3
-
45
-
-
17644404683
-
Gaussian Channels: Information, Estimation and Multiuser Detection,
-
Ph.D. dissertation, Princeton University, Preinceton, NJ
-
D. Guo, "Gaussian Channels: Information, Estimation and Multiuser Detection," Ph.D. dissertation, Princeton University, Preinceton, NJ, 2004.
-
(2004)
-
-
Guo, D.1
|