-
2
-
-
0001780655
-
Coding for two noisy channels
-
Third London Symp., London, U.K
-
P. Elias, "Coding for two noisy channels," in Proc. Information Theory, Third London Symp., London, U.K., 1955.
-
(1955)
Proc. Information Theory
-
-
Elias, P.1
-
3
-
-
0035246316
-
Efficient erasure correcting codes
-
Feb
-
M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inform. Theory, vol. 47, pp. 569-584, Feb. 2001.
-
(2001)
IEEE Trans. Inform. Theory
, vol.47
, pp. 569-584
-
-
Luby, M.G.1
Mitzenmacher, M.2
Shokrollahi, M.A.3
Spielman, D.A.4
-
4
-
-
0000934339
-
Capacity-achieving sequences
-
B. Marcus and J. Rosenthal, Eds. Berlin, Germany: Springer-Verlag
-
A. Shokrollahi, "Capacity-achieving sequences," in Codes, Systems and Graphical Models (IMA Volumes in Mathematics and its Applications), B. Marcus and J. Rosenthal, Eds. Berlin, Germany: Springer-Verlag, 2000, vol. 123, pp. 153-166.
-
(2000)
Codes, Systems and Graphical Models (IMA Volumes in Mathematics and Its Applications)
, vol.123
, pp. 153-166
-
-
Shokrollahi, A.1
-
5
-
-
84957715479
-
New sequences of linear time erasure codes approaching the channel capacity
-
Berlin, Germany: Springer-Verlag
-
M. A. Shokrollahi, "New sequences of linear time erasure codes approaching the channel capacity," in Proc. AAECC-13 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1999, vol. 1719, pp. 65-76.
-
(1999)
Proc. AAECC-13 (Lecture Notes in Computer Science)
, vol.1719
, pp. 65-76
-
-
Shokrollahi, M.A.1
-
6
-
-
0036714055
-
Upper bounds on the rate of LDPC codes
-
Sept
-
D. Burshtein, M. Krivelevich, S. Litsyn, and G. Miller, "Upper bounds on the rate of LDPC codes," IEEE Trans. Inform. Theory, vol. 48, pp. 2437-2449, Sept. 2002.
-
(2002)
IEEE Trans. Inform. Theory
, vol.48
, pp. 2437-2449
-
-
Burshtein, D.1
Krivelevich, M.2
Litsyn, S.3
Miller, G.4
-
7
-
-
0038105247
-
Parity-check density versus performance of binary linear block codes over memoryless symmetric channel
-
July
-
I. Sason and R. Urbanke, "Parity-check density versus performance of binary linear block codes over memoryless symmetric channel," IEEE Trans. Inform. Theory, vol. 49, pp. 1611-1635, July 2003.
-
(2003)
IEEE Trans. Inform. Theory
, vol.49
, pp. 1611-1635
-
-
Sason, I.1
Urbanke, R.2
-
8
-
-
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. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
-
(2001)
IEEE Trans. Inform. Theory
, vol.47
, pp. 619-637
-
-
Richardson, T.1
Shokrollahi, A.2
Urbanke, R.3
-
9
-
-
84890245567
-
-
2nd ed. New York: Wiley
-
M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, Nonlinear Programming, Theory and Applications, 2nd ed. New York: Wiley, 1993.
-
(1993)
Nonlinear Programming, Theory and Applications
-
-
Bazaraa, M.S.1
Sherali, H.D.2
Shetty, C.M.3
-
10
-
-
0036913621
-
Capacity-achieving sequences for the erasure channel
-
Dec
-
P. Oswald and M. A. Shokrollahi, "Capacity-achieving sequences for the erasure channel," IEEE Trans. Inform. Theory, vol. 48, pp. 3017-3028, Dec. 2002.
-
(2002)
IEEE Trans. Inform. Theory
, vol.48
, pp. 3017-3028
-
-
Oswald, P.1
Shokrollahi, M.A.2
|