메뉴 건너뛰기




Volumn , Issue , 1997, Pages 430-

The least stringent sufficient condition on the optimality of a suboptimally decoded codeword using the most reliable basis

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; BINARY SEQUENCES; BLOCK CODES; PHASE SHIFT KEYING; SET THEORY; TRELLIS CODES; VECTORS;

EID: 0030720705     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1997.613367     Document Type: Conference Paper
Times cited : (9)

References (5)
  • 1
    • 0029373149 scopus 로고
    • Soft-decisiondecoding of linear block codes based on ordered statistics
    • September
    • M. P. C. Fossorier and S. Lin, "Soft-DecisionDecoding of Linear Block Codes based on Ordered Statistics," IEEE Transactzons on Information Theory, vol. IT-41, pp. 1379-1396, September 1995.
    • (1995) IEEE Transactzons on Information Theory , vol.IT-41 , pp. 1379-1396
    • Fossorier, M.P.C.1    Lin, S.2
  • 2
    • 0030786226 scopus 로고    scopus 로고
    • Reliability-based code-search algorithms for maximum-likelihood decoding of block codes
    • January
    • D. Gazelle and J. Snyders, "Reliability-Based Code-Search Algorithms for Maximum-Likelihood Decoding of Block Codes," IEEE Transactions on Information Theory, vol. IT-43, pp. 239-249, January 1997.
    • (1997) IEEE Transactions on Information Theory , vol.IT-43 , pp. 239-249
    • Gazelle, D.1    Snyders, J.2
  • 4
    • 0026018282 scopus 로고
    • An improvement to generalized-minimum-distance decoding
    • January
    • D. J. Taipale and M. B. Pursley, "An Improvement to Generalized-Minimum-Distance Decoding," IEEE Transactions on Information Theory, vol. IT-37, pp. 167-172, January 1991.
    • (1991) IEEE Transactions on Information Theory , vol.IT-37 , pp. 167-172
    • Taipale, D.J.1    Pursley, M.B.2
  • 5
    • 0029179920 scopus 로고
    • The least stringent snfficient condition on the optimality of suboptimally decoded codewords
    • January
    • T. Kasami, T. Koumoto, T. Takata, T. Fujiwara and S. Lin, "The Least Stringent Snfficient Condition on the Optimality of Suboptimally Decoded Codewords," Technical Report of IEICE, IT-94-82, January 1995.
    • (1995) Technical Report of IEICE , vol.IT-94-82
    • Kasami, T.1    Koumoto, T.2    Takata, T.3    Fujiwara, T.4    Lin, S.5


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