메뉴 건너뛰기




Volumn , Issue , 2006, Pages

An analysis of finite-memory random linear coding on packet streams

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATIC REPEAT REQUEST; END-TO-END CONNECTIONS; FINITE MEMORY; INCOMING PACKETS; INTERMEDIATE NODE; LINEAR COMBINATIONS; PACKET STREAMS; RANDOM LINEAR CODING;

EID: 84886542392     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WIOPT.2006.1666502     Document Type: Conference Paper
Times cited : (42)

References (12)
  • 1
    • 19544363710 scopus 로고    scopus 로고
    • NYU, Technical Report TR2002-833, Nov.
    • P. Maymounkov, "Online codes," NYU, Technical Report TR2002-833, Nov. 2002
    • (2002) Online Codes
    • Maymounkov, P.1
  • 7
    • 24144470872 scopus 로고    scopus 로고
    • Reliability analysis of a convolutional-code-based packet level FEC under limited buffer size
    • Apr.
    • M. Arai, S. Fukumoto, and K. Iwasaki, "Reliability analysis of a convolutional-code-based packet level FEC under limited buffer size," IEICE Trans. Fundamentals, vol. E88-A, no. 4, pp. 1047-1054, Apr. 2005
    • (2005) IEICE Trans. Fundamentals , vol.E88-A , Issue.4 , pp. 1047-1054
    • Arai, M.1    Fukumoto, S.2    Iwasaki, K.3
  • 10
    • 84886500882 scopus 로고    scopus 로고
    • Algebraic gossip: A network coding approach to optimal multiple rumor mongering
    • S. Deb and M. Médard, "Algebraic gossip: A network coding approach to optimal multiple rumor mongering," submitted to IEEE Trans. Inform. Theory
    • IEEE Trans. Inform. Theory
    • Deb, S.1    Médard, M.2


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