-
1
-
-
0001780655
-
"Coding for two noisy channels"
-
London, U.K
-
P. Elias, "Coding for two noisy channels," in Proc. 3rd London Symp. Information Theory, , London, U.K., 1955, pp. 61-76.
-
(1955)
Proc. 3rd London Symp. Information Theory
, pp. 61-76
-
-
Elias, P.1
-
2
-
-
0035246316
-
"Efficient erasure correcting codes"
-
Feb
-
M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. 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.4
-
4
-
-
0032178374
-
"A digital fountain approach to reliable distribution of bulk data"
-
Vancouver, BC, Canada, Jan
-
J. Byers, M. Luby, M. Mitzenmacher, and A. Rege, "A digital fountain approach to reliable distribution of bulk data," in Proc. ACM SIGCOMM '98, Vancouver, BC, Canada, Jan. 1998, pp. 56-67.
-
(1998)
Proc. ACM SIGCOMM '98
, pp. 56-67
-
-
Byers, J.1
Luby, M.2
Mitzenmacher, M.3
Rege, A.4
-
5
-
-
33646032175
-
"Information Additive Code Generator and Decoder for Communication Systems"
-
Oct. 23
-
M. Luby, "Information Additive Code Generator and Decoder for Communication Systems," U.S. Patent 6,307,487, Oct. 23, 2001.
-
(2001)
U.S. Patent 6,307,487
-
-
Luby, M.1
-
6
-
-
33646064792
-
"Information Additive Code Generator and Decoder for Communication Systems"
-
Apr. 16
-
M. Luby, "Information Additive Code Generator and Decoder for Communication Systems," U.S. Patent 6,373,406, Apr. 16, 2002.
-
(2002)
U.S. Patent 6,373,406
-
-
Luby, M.1
-
7
-
-
0036953758
-
"LT-codes"
-
Vancouver, BC, Canada, Nov
-
M. Luby, "LT-codes," in Proc. 43rd Annu. IEEE Symp. Foundations of Computer Science (FOCS), Vancouver, BC, Canada, Nov. 2002, pp. 271-280.
-
(2002)
Proc. 43rd Annu. IEEE Symp. Foundations of Computer Science (FOCS)
, pp. 271-280
-
-
Luby, M.1
-
9
-
-
19544363710
-
"Online Codes"
-
Preprint
-
P. Maymounkov, "Online Codes," Preprint, 2002.
-
(2002)
-
-
Maymounkov, P.1
-
10
-
-
33749056367
-
"Technical Specification Group Services and System Aspects; Multimedia Broadcast/Multicast Services (MBMS); Protocols and Codecs (Release 6)"
-
3rd Generation Partnership Project (3GPP), Tech. Rep. 3GPP TS 26.346 V6.3.0, 3GPP
-
"Technical Specification Group Services and System Aspects; Multimedia Broadcast/Multicast Services (MBMS); Protocols and Codecs (Release 6)," 3rd Generation Partnership Project (3GPP), Tech. Rep. 3GPP TS 26.346 V6.3.0, 3GPP, 2005.
-
(2005)
-
-
-
11
-
-
5044251488
-
"Finite length analysis of LT codes"
-
Chicago, IL, Jun./Jul
-
R. Karp, M. Luby, and A. Shokrollahi, "Finite length analysis of LT codes," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./ Jul. 2004, p. 39.
-
(2004)
Proc. IEEE Int. Symp. Information Theory
, pp. 39
-
-
Karp, R.1
Luby, M.2
Shokrollahi, A.3
-
12
-
-
0002449625
-
"Irregular repeat-accumulate codes"
-
Brest, France, Sep
-
H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes," in Proc. 2nd Int. Symp. Turbo Codes, Brest, France, Sep. 2000, pp. 1-8.
-
(2000)
Proc. 2nd Int. Symp. Turbo Codes
, pp. 1-8
-
-
Jin, H.1
Khandekar, A.2
McEliece, R.3
-
13
-
-
23744478375
-
"Capacity-achieving ensembles for the binary erasure channel with bounded complexity"
-
Jul
-
H. Pfister, I. Sason, and R. Urbanke, "Capacity-achieving ensembles for the binary erasure channel with bounded complexity," IEEE Trans. Inf. Theory, vol. 51, no. 7, pp. 2352-2379, Jul. 2005.
-
(2005)
IEEE Trans. Inf. Theory
, vol.51
, Issue.7
, pp. 2352-2379
-
-
Pfister, H.1
Sason, I.2
Urbanke, R.3
-
14
-
-
0035246580
-
"Improved low-density parity-check codes using irregular graphs"
-
Feb
-
M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. 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.4
-
15
-
-
84957715479
-
"New sequences of linear time erasure codes approaching the channel capacity"
-
M. Fossorier, H. Imai, S. Lin, and A. Poli, Eds. Berlin, Germany: Springer-Verlag
-
A. Shokrollahi, "New sequences of linear time erasure codes approaching the channel capacity," in Proc. 13th Int. Symp. Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes (Lecture Notes in Computer Science), M. Fossorier, H. Imai, S. Lin, and A. Poli, Eds. Berlin, Germany: Springer-Verlag, 1999, vol. 1719, , pp. 65-76.
-
(1999)
Proc. 13th Int. Symp. Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes (Lecture Notes in Computer Science)
, vol.1719
, pp. 65-76
-
-
Shokrollahi, A.1
-
16
-
-
0036913621
-
"Capacity-achieving sequences for the erasure channel"
-
Dec
-
P. Oswald and A. Shokrollahi, "Capacity-achieving sequences for the erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 3017-3028, Dec. 2002.
-
(2002)
IEEE Trans. Inf. Theory
, vol.48
, Issue.12
, pp. 3017-3028
-
-
Oswald, P.1
Shokrollahi, A.2
-
17
-
-
33745125774
-
"Finite Length Analysis of a Certain Class of LDPC Codes"
-
Preprint
-
A. Shokrollahi and R. Urbanke, "Finite Length Analysis of a Certain Class of LDPC Codes," Preprint, 2001.
-
(2001)
-
-
Shokrollahi, A.1
Urbanke, R.2
-
18
-
-
0032258155
-
"Analysis of random processes via and-or tree evaluation"
-
San Francisco, CA, Jan
-
M. Luby, M. Mitzenmacher, and A. Shokrollahi, "Analysis of random processes via and-or tree evaluation," in Proc. 9th Annu. ACM-SIAM Symp. Discrete Algorithms, San Francisco, CA, Jan. 1998, pp. 364-373.
-
(1998)
Proc. 9th Annu. ACM-SIAM Symp. Discrete Algorithms
, pp. 364-373
-
-
Luby, M.1
Mitzenmacher, M.2
Shokrollahi, A.3
-
19
-
-
33745132454
-
"A note on the design of degree distributions"
-
unpublished, Private communication
-
M. Luby, "A note on the design of degree distributions," unpublished, 2001 Private communication.
-
(2001)
-
-
Luby, M.1
-
20
-
-
0036612281
-
"Finitelength analysis of low-density parity-check codes on the binary erasure channel"
-
Jun
-
C. Di, D. Proietti, I. E. Telatar, T. Richardson, and R. Urbanke, "Finitelength analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1570-1579, Jun. 2002.
-
(2002)
IEEE Trans. Inf. Theory
, vol.48
, Issue.6
, pp. 1570-1579
-
-
Di, C.1
Proietti, D.2
Telatar, I.E.3
Richardson, T.4
Urbanke, R.5
-
21
-
-
84886604153
-
"Systems and Processes for Decoding Chain Reaction Codes Through Inactivation"
-
Feb. 15
-
A. Shokrollahi, S. Lassen, and R. Karp, "Systems and Processes for Decoding Chain Reaction Codes Through Inactivation," U.S. Patent 6,856,263, Feb. 15, 2005.
-
(2005)
U.S. Patent 6,856,263
-
-
Shokrollahi, A.1
Lassen, S.2
Karp, R.3
-
22
-
-
33745129423
-
"Systematic Encoding and Decoding of Chain Reaction Codes"
-
Jun. 21
-
A. Shokrollahi and M. Luby, "Systematic Encoding and Decoding of Chain Reaction Codes," U.S. Patent 6,909,383, Jun. 21, 2005.
-
(2005)
U.S. Patent 6,909,383
-
-
Shokrollahi, A.1
Luby, M.2
|