메뉴 건너뛰기




Volumn 43, Issue 2, 1997, Pages 549-557

On the information function of an error-correcting code

Author keywords

Information function; Linear code; Support weight; Weight hierarchy

Indexed keywords

BINARY CODES; ERROR CORRECTION; FUNCTIONS; MATRIX ALGEBRA; SET THEORY; VECTORS;

EID: 0031103067     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.556112     Document Type: Article
Times cited : (24)

References (12)
  • 1
    • 3142533637 scopus 로고
    • Note on a paper of Laksov
    • L. Carlitz, "Note on a paper of Laksov," Math. Scand., vol. 19, pp. 38-40, 1966.
    • (1966) Math. Scand. , vol.19 , pp. 38-40
    • Carlitz, L.1
  • 3
    • 0028547151 scopus 로고
    • Dimension/length profiles and trellis complexity of linear block codes
    • G. D. Forney, "Dimension/length profiles and trellis complexity of linear block codes," IEEE Trans. Inform. Theory, vol. 40, pp. 1741-1752, 1994.
    • (1994) IEEE Trans. Inform. Theory , vol.40 , pp. 1741-1752
    • Forney, G.D.1
  • 6
    • 0027257044 scopus 로고
    • On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
    • T. Kasami, T. Takata, T. Fujiwara, and S. Lin, "On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes," IEEE Trans. Inform. Theory, vol. 39, pp. 242-245, 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , pp. 242-245
    • Kasami, T.1    Takata, T.2    Fujiwara, T.3    Lin, S.4
  • 7
    • 0345809383 scopus 로고
    • l) having generator matrix over GF (q)
    • l) having generator matrix over GF (q)," Discr. Math., vol. 23, pp. 159-168, 1978.
    • (1978) Discr. Math. , vol.23 , pp. 159-168
    • Kløve, T.1
  • 8
    • 3142646055 scopus 로고
    • Linear recurring sequences over finite fields
    • D. Laksov, "Linear recurring sequences over finite fields," Math. Scand., vol. 16, pp. 181-196, 1965.
    • (1965) Math. Scand. , vol.16 , pp. 181-196
    • Laksov, D.1
  • 9
    • 0029378543 scopus 로고
    • Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
    • V. Levenshtein, "Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces," IEEE Trans. Inform. Theory, vol. 41, pp. 1303-1321, 1995.
    • (1995) IEEE Trans. Inform. Theory , vol.41 , pp. 1303-1321
    • Levenshtein, V.1
  • 11
    • 0028388409 scopus 로고
    • Maximum-likelihood soft decision decoding of BCH codes
    • A. Vardy and Y. Be'ery, "Maximum-likelihood soft decision decoding of BCH codes," IEEE Trans. Inform. Theory, vol. 40, pp. 546-554, 1994.
    • (1994) IEEE Trans. Inform. Theory , vol.40 , pp. 546-554
    • Vardy, A.1    Be'ery, Y.2
  • 12
    • 0026219389 scopus 로고
    • Generalized Hamming weights for linear codes
    • V. K. Wei, "Generalized Hamming weights for linear codes," IEEE Trans. Inform. Theory, vol. 37, pp. 1412-1418, 1991.
    • (1991) IEEE Trans. Inform. Theory , vol.37 , pp. 1412-1418
    • Wei, V.K.1


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