메뉴 건너뛰기




Volumn 40, Issue 12, 2004, Pages 750-752

Optimal augmentation of product codes

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; DECODING; MATRIX ALGEBRA; PRODUCT DESIGN; TRELLIS CODES; TURBO CODES;

EID: 3042643200     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:20040461     Document Type: Article
Times cited : (7)

References (13)
  • 2
    • 0032140566 scopus 로고    scopus 로고
    • Near-optimum decoding of product codes: Block turbo codes
    • Pyndiah, R.: 'Near-optimum decoding of product codes: block turbo codes', IEEE Trans. Commun., 1998, 46, (8), pp. 1003-1010
    • (1998) IEEE Trans. Commun. , vol.46 , Issue.8 , pp. 1003-1010
    • Pyndiah, R.1
  • 4
    • 0041694226 scopus 로고    scopus 로고
    • Adaptive soft-decision decoding for array codes
    • Peng, X.-H., and Farrell, P.G.: 'Adaptive soft-decision decoding for array codes', Euro. Trans. Telecommun., 2001, 12, (6), pp. 487-500
    • (2001) Euro. Trans. Telecommun. , vol.12 , Issue.6 , pp. 487-500
    • Peng, X.-H.1    Farrell, P.G.2
  • 5
    • 3042566242 scopus 로고    scopus 로고
    • Adaptive soft-decision decoding in two dimensions
    • Kluwer Academic Publishers
    • Peng, X.-H., Farrell, P.G., and Coulton, P.: 'Adaptive soft-decision decoding in two dimensions' in 'Information, coding and mathematics' (Kluwer Academic Publishers, 2002), pp. 299-321
    • (2002) Information, Coding and Mathematics , pp. 299-321
    • Peng, X.-H.1    Farrell, P.G.2    Coulton, P.3
  • 7
    • 0016975277 scopus 로고
    • New classes of binary codes constructed on the basis of concatenated codes and product codes
    • Kasahara, M., Sugiyama, Y., Hirasawa, S., and Namekawa, T.: 'New classes of binary codes constructed on the basis of concatenated codes and product codes', IEEE Trans. Inf. Theory, 1976, 22, pp. 462-468
    • (1976) IEEE Trans. Inf. Theory , vol.22 , pp. 462-468
    • Kasahara, M.1    Sugiyama, Y.2    Hirasawa, S.3    Namekawa, T.4
  • 8
    • 0027565774 scopus 로고
    • Generalised array codes and their trellis structure
    • Honary, B., Markarian, G.S., and Farrell, P.G.: 'Generalised array codes and their trellis structure', Electron. Lett., 1993, 29, pp. 541-543
    • (1993) Electron. Lett. , vol.29 , pp. 541-543
    • Honary, B.1    Markarian, G.S.2    Farrell, P.G.3
  • 9
    • 84941860379 scopus 로고
    • Coset codes II: Binary lattices and related codes
    • Forney, G.D. Jr.: 'Coset codes II: binary lattices and related codes', IEEE Trans. Inf. Theory 1988, 34, pp. 1152-1187
    • (1988) IEEE Trans. Inf. Theory , vol.34 , pp. 1152-1187
    • Forney Jr., G.D.1
  • 10
    • 0027555114 scopus 로고
    • An updated table of minimum-distance bounds for binary linear codes
    • Brouwer, A.E., and Verhoeff, T.: 'An updated table of minimum-distance bounds for binary linear codes', IEEE Trans. Inf. Theory, 1993, 39, (2), pp. 662-674
    • (1993) IEEE Trans. Inf. Theory , vol.39 , Issue.2 , pp. 662-674
    • Brouwer, A.E.1    Verhoeff, T.2
  • 11
    • 33749932775 scopus 로고
    • Binary codes with specified minimum distance
    • September
    • Plotkin, M.: 'Binary codes with specified minimum distance', IRE Trans. Inf. Theory, September 1960, pp. 445-450
    • (1960) IRE Trans. Inf. Theory , pp. 445-450
    • Plotkin, M.1
  • 13
    • 0030836168 scopus 로고    scopus 로고
    • Good trellises for IC implementation of Viterbi decoders for linear block codes
    • Moorthy, H.T., Lin, S., and Uehara, G.T.: 'Good trellises for IC implementation of Viterbi decoders for linear block codes', IEEE Trans. Commun., 1997, 45, pp. 52-63
    • (1997) IEEE Trans. Commun. , vol.45 , pp. 52-63
    • Moorthy, H.T.1    Lin, S.2    Uehara, G.T.3


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