메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Mutual dependence for secret key agreement

Author keywords

Mutual dependence; Network coding; Partition connectivity; Secret key agreement; Supermodularity

Indexed keywords

MAXIMUM NETWORKS; NETWORK CODING; NETWORK INFORMATION FLOW; SECRECY CAPACITY; SECRET KEY AGREEMENT; SUPERMODULARITY; UPPER BOUND;

EID: 77953720376     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2010.5464805     Document Type: Conference Paper
Times cited : (75)

References (11)
  • 1
    • 77953705173 scopus 로고    scopus 로고
    • Related work
    • Related work: http://mit.edu/chungc/dissertation.
  • 4
    • 0018020371 scopus 로고
    • Polymatroidal dependence structure of a set of random variables
    • S. Fujishige, "Polymatroidal dependence structure of a set of random variables," Information and Control, vol. 39, no. 1, pp. 55-72, 1978.
    • (1978) Information and Control , vol.39 , Issue.1 , pp. 55-72
    • Fujishige, S.1
  • 6
    • 77953711233 scopus 로고    scopus 로고
    • Preprint no. 10, Department of Mathematics and Computer Science, University of Southern Denmark, May
    • J. Bang-Jensen and S. Thomassé, "Decompositions and orientations of hypergraphs." Preprint no. 10, Department of Mathematics and Computer Science, University of Southern Denmark, May 2001.
    • (2001) Decompositions and Orientations of Hypergraphs
    • Bang-Jensen, J.1    Thomassé, S.2
  • 8
    • 0042329697 scopus 로고    scopus 로고
    • On decomposing a hypergraph into k-connected sub-hypergraphs
    • September
    • T. K. A. Frank and M. Kriesell, "On decomposing a hypergraph into k-connected sub-hypergraphs," Discrete Applied Mathematics, vol. 131, pp. 373-383, September 2003.
    • (2003) Discrete Applied Mathematics , vol.131 , pp. 373-383
    • Frank, T.K.A.1    Kriesell, M.2


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