메뉴 건너뛰기




Volumn 44, Issue 7, 1998, Pages 3083-3090

Bit-error probability for maximum-likelihood decoding of linear block codes and related soft-decision decoding methods

Author keywords

Bit error probability; Block codes; Maximum likelihood decoding; Soft decision decoding; Weight distribution

Indexed keywords

APPROXIMATION THEORY; BINARY CODES; BIT ERROR RATE; DECODING; ENCODING (SYMBOLS); MATRIX ALGEBRA; MAXIMUM LIKELIHOOD ESTIMATION; PROBABILITY; SIGNAL TO NOISE RATIO;

EID: 0032202129     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.737537     Document Type: Article
Times cited : (36)

References (19)
  • 3
    • 0029220407 scopus 로고
    • Optimal information bit decoding of linear block codes
    • Jan.
    • A. B. Kiely, J. T. Coffey, and M. R. Bell, "Optimal information bit decoding of linear block codes," IEEE Trans. Inform. Theory, vol. 41, pp. 130-140, Jan. 1995.
    • (1995) IEEE Trans. Inform. Theory , vol.41 , pp. 130-140
    • Kiely, A.B.1    Coffey, J.T.2    Bell, M.R.3
  • 4
    • 0017512588 scopus 로고
    • Asymptotic performance of optimum bit-by-bit decoding for the white Gaussian channel
    • July
    • C. R. P. Hartmann, L. D. Rudolph, and K. G. Mehrotra, "Asymptotic performance of optimum bit-by-bit decoding for the white Gaussian channel," IEEE Trans. Inform. Theory, vol. IT-23, pp. 520-522, July 1977.
    • (1977) IEEE Trans. Inform. Theory , vol.IT-23 , pp. 520-522
    • Hartmann, C.R.P.1    Rudolph, L.D.2    Mehrotra, K.G.3
  • 5
    • 84941860379 scopus 로고
    • Coset codes II: Binary lattices and related codes
    • Sept.
    • G. D. Forney, Jr., "Coset codes II: Binary lattices and related codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, Sept. 1988.
    • (1988) IEEE Trans. Inform. Theory , vol.34 , pp. 1152-1187
    • Forney Jr., G.D.1
  • 6
    • 0024717378 scopus 로고
    • Closest coset decoding of |u|u+v| codes
    • Aug.
    • F. Hemmati, "Closest coset decoding of |u|u+v| codes," IEEE J. Select. Areas Commun., vol. 7, pp. 982-988, Aug. 1989.
    • (1989) IEEE J. Select. Areas Commun. , vol.7 , pp. 982-988
    • Hemmati, F.1
  • 7
    • 0029229981 scopus 로고
    • Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes
    • Jan.
    • G. Schnabl and M. Bossert, "Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes," IEEE Trans. Inform. Theory, vol. 41, pp. 304-308, Jan. 1995.
    • (1995) IEEE Trans. Inform. Theory , vol.41 , pp. 304-308
    • Schnabl, G.1    Bossert, M.2
  • 8
    • 0031121770 scopus 로고    scopus 로고
    • Generalized coset decoding
    • Apr.
    • M. P. C. Fossorier and S. Lin, "Generalized coset decoding," IEEE Trans. Commun., vol. 45, pp. 393-395, Apr. 1997.
    • (1997) IEEE Trans. Commun. , vol.45 , pp. 393-395
    • Fossorier, M.P.C.1    Lin, S.2
  • 9
    • 33746350704 scopus 로고
    • Generalized minimum distance decoding
    • Apr.
    • G. D. Forney, Jr, "Generalized minimum distance decoding," IEEE Trans. Inform. Theory, vol. IT-12, pp. 125-131, Apr. 1966.
    • (1966) IEEE Trans. Inform. Theory , vol.IT-12 , pp. 125-131
    • Forney Jr., G.D.1
  • 10
    • 84941515481 scopus 로고
    • A class of algorithms for decoding block codes with channel measurement information
    • Jan.
    • D. Chase, "A class of algorithms for decoding block codes with channel measurement information," IEEE Trans. Inform. Theory, vol. IT-18, pp. 170-182, Jan. 1972.
    • (1972) IEEE Trans. Inform. Theory , vol.IT-18 , pp. 170-182
    • Chase, D.1
  • 11
    • 0028388696 scopus 로고
    • An efficient maximum likelihood decoding of linear block codes with algebraic decoder
    • Mar.
    • T. Kaneko, T. Nishijima, H. Inazumi, and S. Hirasawa, "An efficient maximum likelihood decoding of linear block codes with algebraic decoder," IEEE Trans. Inform. Theory, vol. 40, pp. 320-327, Mar. 1994.
    • (1994) IEEE Trans. Inform. Theory , vol.40 , pp. 320-327
    • Kaneko, T.1    Nishijima, T.2    Inazumi, H.3    Hirasawa, S.4
  • 12
    • 0031140442 scopus 로고    scopus 로고
    • Soft-decision decoding of binary linear block codes based on an iterative search algorithm
    • May
    • H. T. Moorthy, S. Lin, and T. Kasami, "Soft-decision decoding of binary linear block codes based on an iterative search algorithm," IEEE Trans. Inform. Theory, vol. 43, pp. 1030-1040, May 1997.
    • (1997) IEEE Trans. Inform. Theory , vol.43 , pp. 1030-1040
    • Moorthy, H.T.1    Lin, S.2    Kasami, T.3
  • 13
    • 0031238038 scopus 로고    scopus 로고
    • Complementary reliability-based decodings of binary linear block codes
    • Sept.
    • M. P. C. Fossorier and S. Lin, "Complementary reliability-based decod- ings of binary linear block codes," IEEE Trans. Inform. Theory, vol. 43, pp. 1667-1672, Sept. 1997.
    • (1997) IEEE Trans. Inform. Theory , vol.43 , pp. 1667-1672
    • Fossorier, M.P.C.1    Lin, S.2
  • 15
    • 0021405569 scopus 로고
    • The information-bit error rate for block codes
    • Apr.
    • D. J. Torrieri, "The information-bit error rate for block codes," IEEE Trans. Commun., vol. COM-32, pp. 474-4176, Apr. 1984.
    • (1984) IEEE Trans. Commun. , vol.COM-32 , pp. 474-4176
    • Torrieri, D.J.1
  • 18
    • 0029409370 scopus 로고
    • Viterbi decoding of the (63, 57) Hamming codes - Implementation and performance results
    • Nov.
    • A. M. Michelson and D. F. Freeman, "Viterbi decoding of the (63, 57) Hamming codes - Implementation and performance results," IEEE Trans. Commun., vol. 43, pp. 2653-2656, Nov. 1995.
    • (1995) IEEE Trans. Commun. , vol.43 , pp. 2653-2656
    • Michelson, A.M.1    Freeman, D.F.2


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