메뉴 건너뛰기




Volumn 56, Issue 3, 2010, Pages 1378-1382

Recursive code construction for random networks

Author keywords

Constant dimension codes; Network coding; Operator channel; Rank metric codes

Indexed keywords

CODE CONSTRUCTION; HIGHER INFORMATION RATE; METRIC CODES; NETWORK CODING; RANDOM NETWORK;

EID: 77949505286     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2009.2039163     Document Type: Article
Times cited : (48)

References (13)
  • 2
    • 84939171537 scopus 로고    scopus 로고
    • Network coding and error correction
    • Bangalore, India, Oct.
    • N. Cai and R. W. Yeung, "Network coding and error correction," in Proc. IEEE Inf. Theory Workshop, Bangalore, India, Oct. 2002, pp. 119-122.
    • (2002) Proc. IEEE Inf. Theory Workshop , pp. 119-122
    • Cai, N.1    Yeung, R.W.2
  • 3
    • 67650156080 scopus 로고    scopus 로고
    • Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams
    • Jul.
    • T. Etzion and N. Silberstein, "Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams," IEEE Trans. Inf. Theory, vol.55, pp. 2909-2919, Jul. 2009.
    • (2009) IEEE Trans. Inf. Theory , vol.55 , pp. 2909-2919
    • Etzion, T.1    Silberstein, N.2
  • 4
    • 0021941233 scopus 로고
    • Theory of codes with maximal rank distance
    • Jul.
    • E. M. Gabidulin, "Theory of codes with maximal rank distance," Prob. Inf. Transm., vol.21, pp. 1-12, Jul. 1985.
    • (1985) Prob. Inf. Transm. , vol.21 , pp. 1-12
    • Gabidulin, E.M.1
  • 7
    • 48849089497 scopus 로고    scopus 로고
    • Coding for errors and erasures in random network coding
    • Aug.
    • R. Kötter and F. R. Kschischang, "Coding for errors and erasures in random network coding," IEEE Trans. Inf. Theory, vol.54, pp. 3579-3591, Aug. 2008.
    • (2008) IEEE Trans. Inf. Theory , vol.54 , pp. 3579-3591
    • Kötter, R.1    Kschischang, F.R.2
  • 9
    • 0026116647 scopus 로고
    • Maximum-rank array codes and their application to crisscross error correction
    • Mar.
    • R. M. Roth, "Maximum-rank array codes and their application to crisscross error correction," IEEE Trans. Inf. Theory, vol.37, pp. 328-336, Mar. 1991.
    • (1991) IEEE Trans. Inf. Theory , vol.37 , pp. 328-336
    • Roth, R.M.1
  • 10
    • 77949494761 scopus 로고    scopus 로고
    • Ph.D. Research Proposal, Technion, Haifa, Israel[Online]. Available
    • N. Silberstein, "Coding Theory in Projective Space," Ph.D. Research Proposal, Technion, Haifa, Israel, 2008 [Online]. Available: http://arxiv.org/abs/0805.3528
    • (2008) Coding Theory in Projective Space
    • Silberstein, N.1
  • 11
    • 51349146209 scopus 로고    scopus 로고
    • A rank-metric approach to error-control in random network coding
    • Sep.
    • D. Silva, F. R. Kschischang, and R. Kötter, "A rank-metric approach to error-control in random network coding," IEEE Trans. Inf. Theory, vol.54, pp. 3951-3967, Sep. 2008.
    • (2008) IEEE Trans. Inf. Theory , vol.54 , pp. 3951-3967
    • Silva, D.1    Kschischang, F.R.2    Kötter, R.3
  • 12
    • 67349117683 scopus 로고    scopus 로고
    • Johnson type bounds on constant dimension codes
    • Feb.
    • S. T. Xia and F. W. Fu, "Johnson type bounds on constant dimension codes," Designs, Codes, Cryptogr., vol.50, pp. 163-172, Feb. 2009.
    • (2009) Designs, Codes, Cryptogr. , vol.50 , pp. 163-172
    • Xia, S.T.1    Fu, F.W.2
  • 13
    • 0037399287 scopus 로고    scopus 로고
    • Linear authentication codes: Bounds and constructions
    • Apr.
    • H. Wang, C. Xing, and R. Safavi-Naini, "Linear authentication codes: bounds and constructions," IEEE Trans. Inf. Theory, vol.49, pp. 866-873, Apr. 2003.
    • (2003) IEEE Trans. Inf. Theory , vol.49 , pp. 866-873
    • Wang, H.1    Xing, C.2    Safavi-Naini, R.3


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