메뉴 건너뛰기




Volumn , Issue , 2012, Pages 125-130

Gamma codes: A low-overhead linear-complexity network coding solution

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; ENCODING (SYMBOLS); LINEAR NETWORKS;

EID: 84866707813     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/netcod.2012.6261896     Document Type: Conference Paper
Times cited : (42)

References (21)
  • 3
    • 0242334165 scopus 로고    scopus 로고
    • An algebraic approach to network coding
    • Oct.
    • R. Koetter and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
    • (2003) IEEE/ACM Trans. Netw. , vol.11 , Issue.5 , pp. 782-795
    • Koetter, R.1    Medard, M.2
  • 5
    • 33947399169 scopus 로고    scopus 로고
    • A random linear network coding approach to multicast
    • Oct.
    • T. Ho, M. Medard, R. Koetter, M. Effros, J. Shi, and B. leong, "A random linear network coding approach to multicast," IEEE Trans. Inf Theory, vol. 52, no. 10, pp. 4413-4430, Oct. 2006.
    • (2006) IEEE Trans. Inf Theory , vol.52 , Issue.10 , pp. 4413-4430
    • Ho, T.1    Medard, M.2    Koetter, R.3    Effros, M.4    Shi, J.5    Leong, B.6
  • 10
    • 79251485294 scopus 로고    scopus 로고
    • Effect of the generation size and overlap on throughput and complexity in randomized linear network coding
    • Feb.
    • Y. Li, E. Soljanin, and P. Spasojevć, "Effect of the generation size and overlap on throughput and complexity in randomized linear network coding," IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 1111-1123, Feb. 2011.
    • (2011) IEEE Trans. Inf. Theory , vol.57 , Issue.2 , pp. 1111-1123
    • Li, Y.1    Soljanin, E.2    Spasojevć, P.3
  • 13
    • 0036913621 scopus 로고    scopus 로고
    • Capacity-achieving sequences for era-sure channel
    • Dec.
    • P. Oswald and A. Shokrollahi, "Capacity-achieving sequences for era-sure 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
  • 15
    • 33745166587 scopus 로고    scopus 로고
    • Raptor codes,"
    • Jun.
    • A. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2551-2567, Jun. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.6 , pp. 2551-2567
    • Shokrollahi, A.1
  • 17
    • 84866661702 scopus 로고
    • A generalization of a result of Erdos and Renyi
    • N. Kaplan, "A generalization of a result of Erdos and Renyi," Journal of Applied Probability, vol. 14, pp. 212-216, 1977.
    • (1977) Journal of Applied Probability , vol.14 , pp. 212-216
    • Kaplan, N.1
  • 18
    • 9944260389 scopus 로고
    • Limit theorems for some random variables associated with urn models
    • L. Flatto, "Limit theorems for some random variables associated with urn models," The Annals of Probability, vol. 10, no. 4, pp. 927-934, 1982.
    • (1982) The Annals of Probability , vol.10 , Issue.4 , pp. 927-934
    • Flatto, L.1
  • 21
    • 84866736877 scopus 로고    scopus 로고
    • On Raptor code design for inactivation decoding
    • accepted for publication.
    • K. Mahdaviani, M. Ardakani, and C. Tellambura, "On Raptor code design for inactivation decoding," IEEE Trans. Commun., 2012, accepted for publication.
    • (2012) IEEE Trans. Commun.
    • Mahdaviani, K.1    Ardakani, M.2    Tellambura, C.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.