메뉴 건너뛰기




Volumn 43, Issue 3, 1997, Pages 953-968

New code parameters from reed-solomon subfield codes

Author keywords

BCH codes; Cyclotomic cosets; Extension; Lengthening; Optimal codes; Orthogonal arrays; Reed Solomon codes

Indexed keywords

BINARY CODES; DATABASE SYSTEMS; INFORMATION THEORY; OPTIMIZATION; PARAMETER ESTIMATION; THEOREM PROVING;

EID: 0031142676     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.568704     Document Type: Article
Times cited : (18)

References (11)
  • 2
    • 84896820280 scopus 로고    scopus 로고
    • J. Bierbrauer. Home page. Available HTTP: http://www.math.mtu.edu/home/math/jbierbra/Home.html.
    • Home Page
    • Bierbrauer, J.1
  • 3
    • 0004339592 scopus 로고    scopus 로고
    • URL http://www.cwi.nl/htbin-/aeb/lincodbd/2/136/114. Also available FTP: URL ftp://ftp.win.tue.nl-/pub/math/codes/table[234].gz
    • A. E. Brouwer. Database of bounds for the minimum distance for binary, ternary, and quaternary codes. Available HTTP: URL http://www.win.-tue.nl/win/math/dw/voorlincod.html or URL http://www.cwi.nl/htbin-/aeb/lincodbd/2/136/114. Also available FTP: URL ftp://ftp.win.tue.nl-/pub/math/codes/table[234].gz.
    • Database of Bounds for the Minimum Distance for Binary, Ternary, and Quaternary Codes
    • Brouwer, A.E.1
  • 5
    • 0027555114 scopus 로고
    • An updated table of minimum-distance bounds for binary linear codes
    • A. E. Brouwer and T. Verhoeff, "An updated table of minimum-distance bounds for binary linear codes," IEEE Trans. Inform. Theory, vol. 39, pp. 662-677, 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , pp. 662-677
    • Brouwer, A.E.1    Verhoeff, T.2
  • 6
    • 0016554120 scopus 로고
    • On subfield subcodes of modified Reed-Solomon codes
    • P. Delsarte, "On subfield subcodes of modified Reed-Solomon codes," IEEE Trans. Inform. Theory, vol. IT-21, pp. 575-576, 1975.
    • (1975) IEEE Trans. Inform. Theory , vol.IT-21 , pp. 575-576
    • Delsarte, P.1


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