메뉴 건너뛰기




Volumn 2005, Issue , 2005, Pages 121-123

On subcodes of codes in rank metric

Author keywords

[No Author keywords available]

Indexed keywords

ERROR-CORRECTING CAPABILITY; MAXIMUM RANK DISTANCE CODES; POLYNOMIAL-TIME ENCODING-DECODING;

EID: 33749427186     PISSN: 21578099     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2005.1523305     Document Type: Conference Paper
Times cited : (10)

References (8)
  • 1
    • 0016554120 scopus 로고
    • On subfield subcodes of modified Reed-Solomon codes
    • P. Delsarte. On subfield subcodes of modified Reed-Solomon codes. IEEE Transactions on Information Theory, 20:575-576, 1975.
    • (1975) IEEE Transactions on Information Theory , vol.20 , pp. 575-576
    • Delsarte, P.1
  • 3
    • 85013087026 scopus 로고
    • A fast matrix decoding algorithm for rank-error correcting codes
    • G. Cohen, S. Litsyn, A. Lobstein, and G. Zémor, editors, Algebraic coding. Springer-Verlag
    • E. M. Gabidulin. A fast matrix decoding algorithm for rank-error correcting codes. In G. Cohen, S. Litsyn, A. Lobstein, and G. Zémor, editors, Algebraic coding, volume 573 of LNCS, pages 126-133. Springer-Verlag, 1991.
    • (1991) LNCS , vol.573 , pp. 126-133
    • Gabidulin, E.M.1
  • 6
    • 5044246918 scopus 로고    scopus 로고
    • Fast decoding of rank-codes with rank errors and column erasures
    • G. Richter and S. Plass. Fast decoding of rank-codes with rank errors and column erasures. In Proceedings of ISIT 2004, 2004.
    • (2004) Proceedings of ISIT 2004
    • Richter, G.1    Plass, S.2
  • 7
    • 0026116647 scopus 로고
    • Maximum-Rank array codes and their application to crisscross error correction
    • March
    • R. M. Roth. Maximum-Rank array codes and their application to crisscross error correction. IEEE Transactions on Information Theory, 37(2):328-336, March 1991.
    • (1991) IEEE Transactions on Information Theory , vol.37 , Issue.2 , pp. 328-336
    • Roth, R.M.1


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