메뉴 건너뛰기




Volumn 5130 LNCS, Issue , 2008, Pages 157-173

On field size and success probability in network coding

Author keywords

Distributed networking; Linear network coding; Multicast; Network coding; Random network coding

Indexed keywords

DIGITAL ARITHMETIC; ESTIMATION; LINEAR NETWORKS; PROBABILITY; PROGRAMMING THEORY; RANDOM PROCESSES;

EID: 49949101716     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69499-1_14     Document Type: Conference Paper
Times cited : (5)

References (11)
  • 2
    • 49949089507 scopus 로고    scopus 로고
    • Becker, T., Weispfenning, V.: Gröbner Bases - A Computational Approach to Commutative Algebra. Springer, Berlin (1993)
    • Becker, T., Weispfenning, V.: Gröbner Bases - A Computational Approach to Commutative Algebra. Springer, Berlin (1993)
  • 5
    • 0038349656 scopus 로고    scopus 로고
    • On codes from norm-trace curves
    • Geil, O.: On codes from norm-trace curves. Finite Fields and their Applications 9(3), 351-371 (2003)
    • (2003) Finite Fields and their Applications , vol.9 , Issue.3 , pp. 351-371
    • Geil, O.1


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