메뉴 건너뛰기




Volumn 45, Issue 5, 1999, Pages 1392-1405

On the complexity of minimum distance decoding of long linear codes

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; ERRORS; MAXIMUM LIKELIHOOD ESTIMATION; PROBABILITY;

EID: 0032649630     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.771141     Document Type: Article
Times cited : (33)

References (32)
  • 3
    • 0032165566 scopus 로고    scopus 로고
    • Minimal vectors in linear codes
    • Sept.
    • A. Ashikhmin and A. Barg, "Minimal vectors in linear codes," IEEE Trans. Inform. Theory, vol. 44, pp. 2010-2017, Sept. 1998.
    • (1998) IEEE Trans. Inform. Theory , vol.44 , pp. 2010-2017
    • Ashikhmin, A.1    Barg, A.2
  • 4
    • 0001949079 scopus 로고    scopus 로고
    • Complexity issues in coding theory
    • V. Pless and W. C. Huffman, Eds. Amsterdam, The Netherlands: Elsevier Science
    • A. Barg, "Complexity issues in coding theory," in Handbook of Coding Theory, vol. 1, V. Pless and W. C. Huffman, Eds. Amsterdam, The Netherlands: Elsevier Science, 1998, pp. 649-754.
    • (1998) Handbook of Coding Theory , vol.1 , pp. 649-754
    • Barg, A.1
  • 5
    • 0022453064 scopus 로고
    • Concatenated decoding algorithm with incomplete inspection of code vectors
    • in Russian and pp. 1-7 (English translation)
    • A. Barg and I. Dumer, "Concatenated decoding algorithm with incomplete inspection of code vectors," Probl. Inform. Transm., vol. 22, no. 1, pp. 3-8 (in Russian) and pp. 1-7 (English translation), 1986.
    • (1986) Probl. Inform. Transm. , vol.22 , Issue.1 , pp. 3-8
    • Barg, A.1    Dumer, I.2
  • 7
    • 0023326290 scopus 로고
    • n
    • in Russian and pp. 130-132 (English translation)
    • n," Probl. Inform. Transm., vol. 23, no. 2, pp. 50-53 (in Russian) and pp. 130-132 (English translation), 1987.
    • (1987) Probl. Inform. Transm. , vol.23 , Issue.2 , pp. 50-53
    • Blinovskii, V.M.1
  • 8
    • 0031675932 scopus 로고    scopus 로고
    • A new algorithm for finding minimum-weight words in a linear code: Application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
    • Jan.
    • A. Canteaut and F. Chabaud, " A new algorithm for finding minimum-weight words in a linear code: Application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511," IEEE Trans. Inform. Theory, vol. 44, pp. 367-378, Jan. 1998.
    • (1998) IEEE Trans. Inform. Theory , vol.44 , pp. 367-378
    • Canteaut, A.1    Chabaud, F.2
  • 9
    • 9644299527 scopus 로고
    • (n, k, t)-covering systems and error-trapping decoding
    • A. H. Chan and R. A. Games, "(n, k, t)-covering systems and error-trapping decoding," IEEE Trans. Inform. Theory, vol. IT-27, pp. 643-646, 1981.
    • (1981) IEEE Trans. Inform. Theory , vol.IT-27 , pp. 643-646
    • Chan, A.H.1    Games, R.A.2
  • 11
    • 0025484012 scopus 로고
    • The complexity of information set decoding
    • Sept.
    • J. T. Coffey and R. M. F. Goodman, "The complexity of information set decoding," IEEE Trans. Inform. Theory, vol. 35, pp. 1031-1037, Sept. 1990.
    • (1990) IEEE Trans. Inform. Theory , vol.35 , pp. 1031-1037
    • Coffey, J.T.1    Goodman, R.M.F.2
  • 12
    • 28844446710 scopus 로고
    • New approaches to reduced complexity decoding
    • J. T. Coffey, R. M. F. Goodman, and P. Farrell, "New approaches to reduced complexity decoding," Discr. Appl. Math., vol. 33, pp. 43-60, 1991.
    • (1991) Discr. Appl. Math. , vol.33 , pp. 43-60
    • Coffey, J.T.1    Goodman, R.M.F.2    Farrell, P.3
  • 14
    • 0024482748 scopus 로고
    • Two decoding algorithms for linear codes
    • in Russian and pp. 17-23 (English translation)
    • I. Dumer, "Two decoding algorithms for linear codes," Probl. Inform. Transm., vol. 25, no. 1, pp. 24-32 (in Russian) and pp. 17-23 (English translation), 1989.
    • (1989) Probl. Inform. Transm. , vol.25 , Issue.1 , pp. 24-32
    • Dumer, I.1
  • 16
    • 0030286942 scopus 로고    scopus 로고
    • Suboptimal decoding of linear codes: Partition technique
    • Nov.
    • _, "Suboptimal decoding of linear codes: Partition technique," IEEE Trans. Inform. Theory, vol. 42, pp. 1971-1986, Nov. 1996.
    • (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 1971-1986
  • 19
    • 0020633678 scopus 로고
    • Complexity of decoding for linear codes
    • in Russian and pp. 1-6 (English translation)
    • G. S. Evseev, "Complexity of decoding for linear codes," Probl. Inform. Transm., vol. 19, no. 1, pp. 3-8 (in Russian) and pp. 1-6 (English translation), 1983.
    • (1983) Probl. Inform. Transm. , vol.19 , Issue.1 , pp. 3-8
    • Evseev, G.S.1
  • 21
    • 0020128021 scopus 로고
    • Minimal permutation sets for decoding the binary Golay code
    • May
    • D. M. Gordon, "Minimal permutation sets for decoding the binary Golay code," IEEE Trans. Inform. Theory, vol. IT-28, pp. 541-543, May 1982.
    • (1982) IEEE Trans. Inform. Theory , vol.IT-28 , pp. 541-543
    • Gordon, D.M.1
  • 22
    • 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
  • 24
    • 18544388541 scopus 로고
    • Decoding complexity bound for linear block codes
    • in Russian and pp. 251-254 (English translation)
    • E. A. Krouk, "Decoding complexity bound for linear block codes," Problems of Info. Trans., vol. 25, no. 3, pp. 103-107 (in Russian) and pp. 251-254 (English translation), 1989.
    • (1989) Problems of Info. Trans. , vol.25 , Issue.3 , pp. 103-107
    • Krouk, E.A.1
  • 25
    • 0029280351 scopus 로고
    • Decoding by generalized information sets
    • in Russian and pp. 134-139 (English translation)
    • E. A. Krouk and S. V. Fedorenko, "Decoding by generalized information sets," Probl. Inform. Transm., vol. 31, no. 2, pp. 54-61 (in Russian) and pp. 134-139 (English translation), 1995.
    • (1995) Probl. Inform. Transm. , vol.31 , Issue.2 , pp. 54-61
    • Krouk, E.A.1    Fedorenko, S.V.2
  • 26
    • 0022056547 scopus 로고
    • A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm
    • May
    • L. Levitin and C. R. P. Hartmann, "A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm," IEEE Trans. Inform. Theory, vol. IT-31, pp. 378-384, May 1985.
    • (1985) IEEE Trans. Inform. Theory , vol.IT-31 , pp. 378-384
    • Levitin, L.1    Hartmann, C.R.P.2
  • 27
    • 33746812562 scopus 로고
    • The use of information sets in decoding cyclic codes
    • E. Prange, "The use of information sets in decoding cyclic codes," IRE Trans. Inform. Theory, vol. IT-8, pp. S5-S9, 1962.
    • (1962) IRE Trans. Inform. Theory , vol.IT-8
    • Prange, E.1
  • 28
    • 0014596262 scopus 로고
    • "The complexity of decoders," I, II
    • Nov.
    • J. E. Savage, "The complexity of decoders," I, II, IEEE Trans. Inform. Theory, vol. IT-15, pp. 689-695, Nov. 1969
    • (1969) IEEE Trans. Inform. Theory , vol.IT-15 , pp. 689-695
    • Savage, J.E.1
  • 31
    • 0020822106 scopus 로고
    • A permutation decoding of the (24, 12, 8) Golay code
    • Sept.
    • J. Wolfmann, "A permutation decoding of the (24, 12, 8) Golay code," IEEE Trans. Inform. Theory, vol. IT-29, pp. 748-751, Sept. 1983.
    • (1983) IEEE Trans. Inform. Theory , vol.IT-29 , pp. 748-751
    • Wolfmann, J.1
  • 32
    • 0027629275 scopus 로고
    • Bounds to the trellis decoding complexity of linear block codes
    • in Russian and pp. 202-207 (English translation)
    • V. V. Zyablov and V. R. Sidorenko, "Bounds to the trellis decoding complexity of linear block codes," Probl. Inform. Transm., vol. 29, no. 3, pp. 3-9 (in Russian) and pp. 202-207 (English translation) 1993.
    • (1993) Probl. Inform. Transm. , vol.29 , Issue.3 , pp. 3-9
    • Zyablov, V.V.1    Sidorenko, V.R.2


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