메뉴 건너뛰기




Volumn , Issue , 2011, Pages

Rank distribution analysis for sparse random linear network coding

Author keywords

Constant dimension code; rank analysis; sparse random linear combinations; zero pattern

Indexed keywords

BOUNDED DISTANCE DECODING; COMBINATORICS; CONSTANT DIMENSION CODE; DECODING FAILURE; DISTRIBUTION ANALYSIS; FINITE FIELDS; INDEPENDENTLY AND IDENTICALLY DISTRIBUTED; LINEAR COMBINATIONS; MATRIX; NETWORK RESOURCE; NETWORK TRANSFERS; PROBABILISTIC NETWORK; RANDOM MATRIX; RANDOM TRANSFER; RANK ANALYSIS; SUBSPACE CODES; UPPER AND LOWER BOUNDS; ZERO PATTERNS;

EID: 80052972595     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISNETCOD.2011.5978939     Document Type: Conference Paper
Times cited : (16)

References (10)
  • 2
    • 0040517363 scopus 로고    scopus 로고
    • The Rank of Sparse Random Matrices over Finite Fields
    • J. Blömer, R. Karp and E. Welzl, "The Rank of Sparse Random Matrices Over Finite Fields," Random Structures and Algorithms, vol. 10, 1997, pp. 407-419.
    • (1997) Random Structures and Algorithms , vol.10 , pp. 407-419
    • Blömer, J.1    Karp, R.2    Welzl, E.3
  • 3
    • 0034356854 scopus 로고    scopus 로고
    • On the Distribution of Rank of a Random Matrix over a Finite Field
    • C. Cooper, "On the Distribution of Rank of a Random Matrix over a Finite Field," Random Structures and Algorithms, vol. 36, 2000, pp. 197-212.
    • (2000) Random Structures and Algorithms , vol.36 , pp. 197-212
    • Cooper, C.1
  • 5
    • 48849089497 scopus 로고    scopus 로고
    • Coding for Errors and Erasures in Random Network Coding
    • R. Kötter and F. R. Kschischang, "Coding for Errors and Erasures in Random Network Coding," IEEE Trans. Inform. Theory, vol. 54, 2008, pp. 3549-3591.
    • (2008) IEEE Trans. Inform. Theory , vol.54 , pp. 3549-3591
    • Kötter, R.1    Kschischang, F.R.2
  • 9
    • 77951613596 scopus 로고    scopus 로고
    • Packing and Covering Properties of Subspace Codes for Error Control in Random Linear Network Coding
    • May
    • M. Gadouleau and Z.Y. Yan, "Packing and Covering Properties of Subspace Codes for Error Control in Random Linear Network Coding," IEEE Trans. Inform. Theory, vol. 56, May 2010, pp. 2097-2108.
    • (2010) IEEE Trans. Inform. Theory , vol.56 , pp. 2097-2108
    • Gadouleau, M.1    Yan, Z.Y.2
  • 10
    • 58849158404 scopus 로고    scopus 로고
    • Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
    • A. Kohnert and S. Kurz, "Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance," Proc. MMICS'08, pp. 31-42.
    • Proc. MMICS'08 , pp. 31-42
    • Kohnert, A.1    Kurz, S.2


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