메뉴 건너뛰기




Volumn , Issue , 2010, Pages

Optimality of subspace coding for linear operator channels over finite fields

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABLE RATE; ARBITRARY DISTRIBUTION; CHANNEL PARAMETER; DIMENSIONAL SUBSPACE; FINITE FIELDS; INPUT VECTOR; LINEAR NETWORK CODING; LINEAR OPERATIONS; LINEAR OPERATORS; LINEAR TRANSFORM; LOWER BOUNDS; OPTIMALITY; OUTPUT VECTORS; THROUGH CHANNEL; TRANSFORMATION MATRICES;

EID: 77954830712     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITWKSPS.2010.5503160     Document Type: Conference Paper
Times cited : (13)

References (13)
  • 2
    • 0242334165 scopus 로고    scopus 로고
    • An algebraic approach to network coding
    • Oct.
    • R. Koetter and M. Medard, "An algebraic approach to network coding," IEEE/ACM Trans. Networking, vol. 11, no. 5, pp. 782-795, Oct. 2003.
    • (2003) IEEE/ACM Trans. Networking , vol.11 , Issue.5 , pp. 782-795
    • Koetter, R.1    Medard, M.2
  • 4
    • 48849089497 scopus 로고    scopus 로고
    • Coding for errors and erasures in random network coding
    • Aug.
    • R. Koetter and F. R. Kschischang, "Coding for errors and erasures in random network coding," IEEE Trans. Inform. Theory, vol. 54, no. 8, pp. 3579-3591, Aug. 2008.
    • (2008) IEEE Trans. Inform. Theory , vol.54 , Issue.8 , pp. 3579-3591
    • Koetter, R.1    Kschischang, F.R.2
  • 5
    • 51349146209 scopus 로고    scopus 로고
    • A rank-metric approach to error control in random network coding
    • Sept.
    • D. Silva, F. Kschischang, and R. Koetter, "A rank-metric approach to error control in random network coding," IEEE Trans. Inform. Theory, vol. 54, no. 9, pp. 3951-3967, Sept. 2008.
    • (2008) IEEE Trans. Inform. Theory , vol.54 , Issue.9 , pp. 3951-3967
    • Silva, D.1    Kschischang, F.2    Koetter, R.3


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