메뉴 건너뛰기




Volumn 38, Issue 3, 1992, Pages 1125-1130

On the Generalized Hamming Weights of Several Classes of Cyclic Codes

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC - ERROR CORRECTION;

EID: 0026867643     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.135653     Document Type: Article
Times cited : (57)

References (11)
  • 2
    • 84938437623 scopus 로고
    • The second generalized Hamming weight of double-error correcting BCH codes and their dual codes
    • New Orleans, LA
    • H. Chung, “The second generalized Hamming weight of double-error correcting BCH codes and their dual codes,” to appear in Algebraic Algorithms and Error-Correcting Codes Conf., New Orleans, LA, 1991.
    • (1991) Algebraic Algorithms and Error-Correcting Codes Conf
    • Chung, H.1
  • 3
    • 84941459901 scopus 로고
    • Bounds on the generalized Hamming weights for linear codes
    • preprint, Jan.
    • T. Helleseth and O. Ytrehus, “Bounds on the generalized Hamming weights for linear codes,” preprint, Jan. 1991.
    • (1991)
    • Helleseth, T.1    Ytrehus, O.2
  • 4
    • 0003217463 scopus 로고
    • Weight distributions of Bose-Chardhuri-Hocquengherm codes
    • R. C. Bose and T. A. Dowling, Eds. Chapel Hill N.C.: Univ. of North Carolina Press
    • T. Kasami, “Weight distributions of Bose-Chardhuri-Hocquengherm codes,” in Proc. Conf. Combinat. Math. Its Applicat., R. C. Bose and T. A. Dowling, Eds. Chapel Hill, N.C.: Univ. of North Carolina Press, 1968.
    • (1968) Proc. Conf. Combinat. Math. Its Applicat
    • Kasami, T.1
  • 7
    • 0016570133 scopus 로고
    • On extending Goppa codes to cyclic codes
    • K. K. Tzeng and K. P. Zimmerman, “On extending Goppa codes to cyclic codes,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 712–716, 1975.
    • (1975) IEEE Trans. Inform. Theory , vol.IT-21 , pp. 712-716
    • Tzeng, K.K.1    Zimmerman, K.P.2
  • 8
    • 0022564721 scopus 로고
    • On the minimum distance of cyclic codes
    • J. H. van Lint and R. M. Wilson, “On the minimum distance of cyclic codes,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 23–40, 1986.
    • (1986) IEEE Trans. Inform. Theory , vol.IT-32 , pp. 23-40
    • van Lint, J.H.1    Wilson, R.M.2
  • 9
    • 0023415923 scopus 로고
    • An updated table of minimum-distance bounds for binary linear codes
    • T. Verhoeff, “An updated table of minimum-distance bounds for binary linear codes,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 665–680, 1987.
    • (1987) IEEE Trans. Inform. Theory , vol.IT-33 , pp. 665-680
    • Verhoeff, T.1
  • 10
    • 0026219389 scopus 로고
    • Generalized Hamming weights for linear codes
    • Sept.
    • V. K. Wei, “Generalized Hamming weights for linear codes,” IEEE Trans. Inform. Theory, vol. 37, pp. 1412–1418, Sept. 1991.
    • (1991) IEEE Trans. Inform. Theory , vol.37 , pp. 1412-1418
    • Wei, V.K.1
  • 11
    • 84941436459 scopus 로고    scopus 로고
    • The generalized Hamming weights of some product codes
    • in preparation
    • V. K. Wei and K. Yang, “The generalized Hamming weights of some product codes,” in preparation.
    • Wei, V.K.1    Yang, K.2


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