메뉴 건너뛰기




Volumn 43, Issue 1, 1997, Pages 239-249

Reliability-based code-search algorithms for maximum-likelihood decoding of block codes

Author keywords

Block codes; Code search; Maximum likelihood decoding; Ordered basis; Ordered information set; Partial ordering

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECODING; MATHEMATICAL MODELS; MATRIX ALGEBRA; STATISTICAL METHODS;

EID: 0030786226     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.567691     Document Type: Article
Times cited : (78)

References (22)
  • 1
    • 0029251668 scopus 로고    scopus 로고
    • Soft syndrome decoding of binary convolutional codes
    • Feb./Apr.
    • M. Ariel and J. Snyders, "Soft syndrome decoding of binary convolutional codes," IEEE Trans. Commun., vol. 43, pp. 288-297, Feb./Apr. 1996.
    • (1996) IEEE Trans. Commun. , vol.43 , pp. 288-297
    • Ariel, M.1    Snyders, J.2
  • 2
    • 0022719911 scopus 로고
    • Optimal soft decision block decoders based on fast Hadamard transform
    • May
    • Y. Be'ery and J. Snyders, "Optimal soft decision block decoders based on fast Hadamard transform," IEEE Trans. Inform. Theory, vol. IT-32, pp. 355-364, May 1986.
    • (1986) IEEE Trans. Inform. Theory , vol.IT-32 , pp. 355-364
    • Be'ery, Y.1    Snyders, J.2
  • 3
    • 0022563696 scopus 로고
    • Decoding techniques for codes and lattices, including the Golay code and the Leech lattice
    • Jan.
    • J. H. Conway and N. J. A. Sloane, "Decoding techniques for codes and lattices, including the Golay code and the Leech lattice," IEEE Trans. Inform. Theory, vol. IT-32, pp. 41-50, Jan. 1986.
    • (1986) IEEE Trans. Inform. Theory , vol.IT-32 , pp. 41-50
    • Conway, J.H.1    Sloane, N.J.A.2
  • 4
    • 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
  • 5
    • 84941860379 scopus 로고
    • Coset codes II: Binary codes, lattices and related codes
    • Sept.
    • _, "Coset codes II: Binary codes, 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
  • 6
    • 0029373149 scopus 로고
    • Soft-decision decoding of linear block codes based on ordered statistics
    • Sept.
    • M. P. C. Fossorier and S. Lin, "Soft-decision decoding of linear block codes based on ordered statistics," IEEE Trans. Inform. Theory, vol. 41, pp. 1379-1396, Sept. 1995.
    • (1995) IEEE Trans. Inform. Theory , vol.41 , pp. 1379-1396
    • Fossorier, M.P.C.1    Lin, S.2
  • 7
    • 0030150390 scopus 로고    scopus 로고
    • Computationally efficient soft decision decoding of linear block codes based on ordered statistics
    • May
    • _, "Computationally efficient soft decision decoding of linear block codes based on ordered statistics," IEEE Trans. Inform. Theory, vol. 42, pp. 738-750, May 1996.
    • (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 738-750
  • 9
    • 0027668419 scopus 로고
    • Efficient priority first search maximum-likelihood soft decision decoding of linear block codes
    • Sept.
    • Y. S. Han, C. R. P. Hartmann, and C. C. Chen, "Efficient priority first search maximum-likelihood soft decision decoding of linear block codes," IEEE Trans. Inform. Theory, vol. 39, pp. 1514-1523, Sept. 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , pp. 1514-1523
    • Han, Y.S.1    Hartmann, C.R.P.2    Chen, C.C.3
  • 10
    • 0018544749 scopus 로고
    • Decoding linear block codes for minimizing word error rate
    • Nov.
    • T.-Y. Hwang, "Decoding linear block codes for minimizing word error rate," IEEE Trans. Inform. Theory, vol. IT-25, pp. 733-737, Nov. 1979.
    • (1979) IEEE Trans. Inform. Theory , vol.IT-25 , pp. 733-737
    • Hwang, T.-Y.1
  • 11
    • 0019055681 scopus 로고
    • Efficient optimal decoding of linear block codes
    • Sept.
    • _, "Efficient optimal decoding of linear block codes," IEEE Trans. Inform. Theory, vol. IT-26, pp. 603-606, Sept. 1980.
    • (1980) IEEE Trans. Inform. Theory , vol.IT-26 , pp. 603-606
  • 12
    • 0028388696 scopus 로고
    • An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder
    • Mar.
    • T. Kaneko, T. Nishijima, H. Inazumi, and S. Hirasawa, "An efficient maximum-likelihood-decoding algorithm for 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
  • 13
    • 0027303537 scopus 로고
    • On maximum likelihood soft decision decoding of binary linear block codes
    • Jan.
    • N. J. C. Lous, P. A. H. Bours, and H. C. A. van Tilborg, "On maximum likelihood soft decision decoding of binary linear block codes," IEEE Trans. Inform. Theory, vol. 39, pp. 197-203, Jan. 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , pp. 197-203
    • Lous, N.J.C.1    Bours, P.A.H.2    Van Tilborg, H.C.A.3
  • 15
    • 0016410298 scopus 로고
    • Decoding algorithm of error-correcting codes by use of analog weights
    • Jan.
    • H. Miyakawa and T. Kaneko, "Decoding algorithm of error-correcting codes by use of analog weights," Elec. and Comm. in Japan, vol. 58-A, no. 1, pp. 18-27, Jan. 1975.
    • (1975) Elec. and Comm. in Japan , vol.58 A , Issue.1 , pp. 18-27
    • Miyakawa, H.1    Kaneko, T.2
  • 16
    • 0024078703 scopus 로고
    • Minimal trellises for block codes
    • Sept.
    • D. J. Muder, "Minimal trellises for block codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1049-1053, Sept. 1988.
    • (1988) IEEE Trans. Inform. Theory , vol.34 , pp. 1049-1053
    • Muder, D.J.1
  • 17
    • 0024733559 scopus 로고
    • Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes
    • Sept.
    • J. Snyders and Y. Be'ery, "Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes," IEEE Trans. Inform. Theory, vol. 35, pp. 963-975, Sept. 1989.
    • (1989) IEEE Trans. Inform. Theory , vol.35 , pp. 963-975
    • Snyders, J.1    Be'ery, Y.2
  • 18
    • 0026187202 scopus 로고
    • Reduced lists of error patterns for maximum likelihood soft decoding
    • July
    • J. Snyders, "Reduced lists of error patterns for maximum likelihood soft decoding," IEEE Trans. Inform. Theory, vol. 37, pp. 1194-1200, July 1991.
    • (1991) IEEE Trans. Inform. Theory , vol.37 , pp. 1194-1200
    • Snyders, J.1
  • 19
    • 84939390537 scopus 로고
    • Partial ordering of error patterns for maximum likelihood soft decoding
    • New York: Springer-Verlag
    • _, "Partial ordering of error patterns for maximum likelihood soft decoding," in Algebraic Coding-Lecture Notes in Computer Science, vol. 573. New York: Springer-Verlag, 1992, pp. 120-125.
    • (1992) Algebraic Coding-lecture Notes in Computer Science , vol.573 , pp. 120-125
  • 20
    • 0026018282 scopus 로고
    • An improvement to generalized minimum distance decoding
    • Jan.
    • D. J. Taipale and M. B. Pursley, "An improvement to generalized minimum distance decoding," IEEE Trans, Inform. Theory, vol. 37, pp. 167-172, Jan. 1991.
    • (1991) IEEE Trans, Inform. Theory , vol.37 , pp. 167-172
    • Taipale, D.J.1    Pursley, M.B.2
  • 21
    • 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
  • 22
    • 0017922440 scopus 로고
    • Efficient maximum likelihood decoding of linear block codes using a trellis
    • Jan.
    • J. K. Wolf, "Efficient maximum likelihood decoding of linear block codes using a trellis," IEEE Trans. Inform. Theory, vol. IT-24, pp. 76-80. Jan. 1978.
    • (1978) IEEE Trans. Inform. Theory , vol.IT-24 , pp. 76-80
    • Wolf, J.K.1


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