메뉴 건너뛰기




Volumn 3, Issue 6, 2004, Pages 2353-2361

Extended Hamming product codes analytical performance evaluation for low error rate applications

Author keywords

Automorphism group; Hamming codes; Multiplicity; Product codes

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BIT ERROR RATE; BROADCASTING; COMPUTER SIMULATION; DECODING; ERROR ANALYSIS; ITERATIVE METHODS; MULTIMEDIA SYSTEMS; WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 11844304148     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2004.837405     Document Type: Article
Times cited : (45)

References (28)
  • 1
    • 85071200014 scopus 로고    scopus 로고
    • DVB-S2 Standardization Committee, Geneva, Switzerland, Jan.
    • ESA, "DVB-S2 coding standard proposal," DVB-S2 Standardization Committee, Geneva, Switzerland, Jan. 2003.
    • (2003) DVB-S2 Coding Standard Proposal
  • 3
    • 0027297425 scopus 로고
    • Near Shannon limit error-correcting coding: Turbo-codes
    • Geneve, May
    • C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding: Turbo-codes," in Proc. Int. Conf. ICC '93, Geneve, May 1993, pp. 1064-1070.
    • (1993) Proc. Int. Conf. ICC '93 , pp. 1064-1070
    • Berrou, C.1    Glavieux, A.2    Thitimajshima, P.3
  • 4
    • 84925405668 scopus 로고
    • Low-density parity-check codes
    • Jan.
    • R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, pp. 21-28, Jan. 1962.
    • (1962) IRE Trans. Inform. Theory , pp. 21-28
    • Gallager, R.G.1
  • 6
    • 0030106621 scopus 로고    scopus 로고
    • Unveiling turbo-codes: Some results on parallel concatenated coding schemes
    • Mar.
    • S. Benedetto and G. Montorsi, "Unveiling turbo-codes: Some results on parallel concatenated coding schemes," IEEE Trans. Inform. Theory, vol. 42, pp. 409-428, Mar. 1996.
    • (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 409-428
    • Benedetto, S.1    Montorsi, G.2
  • 7
    • 0035088975 scopus 로고    scopus 로고
    • Code construction and decoding of parallel concatenated tail-biting codes
    • Jan.
    • C. Weiß, C. Bettstetter, and S. Riedel, "Code construction and decoding of parallel concatenated tail-biting codes," IEEE Trans. Inform. Theory, vol. 47, pp. 366-386, Jan. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 366-386
    • Weiß, C.1    Bettstetter, C.2    Riedel, S.3
  • 8
  • 9
    • 0035333909 scopus 로고    scopus 로고
    • Computing the free distance of turbo codes and serially concatenated codes with interleavers
    • May
    • R. Garello, S. Benedetto, and P. Pierleoni, "Computing the free distance of turbo codes and serially concatenated codes with interleavers, " IEEE J. Select. Areas Commun., vol. 19, pp. 800-812, May 2001.
    • (2001) IEEE J. Select. Areas Commun. , vol.19 , pp. 800-812
    • Garello, R.1    Benedetto, S.2    Pierleoni, P.3
  • 10
    • 0008956724 scopus 로고    scopus 로고
    • Recent simplifications and improvements in block turbo codes
    • Brest, France, Sept.
    • P. Adde and R. Pyndiah, "Recent simplifications and improvements in block turbo codes," in Proc. 2nd Int. Symp. Turbo Codes Related Topics, Brest, France, Sept. 2000, pp. 133-136.
    • (2000) Proc. 2nd Int. Symp. Turbo Codes Related Topics , pp. 133-136
    • Adde, P.1    Pyndiah, R.2
  • 11
    • 0032202129 scopus 로고    scopus 로고
    • Bit-error probability for maximum-likelihood decoding of linear block codes and related soft-decision decoding methods
    • Nov.
    • M. P. C. Fossorier, S. Lin, and D. Rhee, "Bit-error probability for maximum-likelihood decoding of linear block codes and related soft-decision decoding methods," IEEE Trans. Inform. Theory, vol. 44, pp. 3083-3090, Nov. 1998.
    • (1998) IEEE Trans. Inform. Theory , vol.44 , pp. 3083-3090
    • Fossorier, M.P.C.1    Lin, S.2    Rhee, D.3
  • 12
    • 0024011920 scopus 로고
    • Information-bit, information-symbol, and decoded-symbol error rates for linear block codes
    • May
    • D. Torrieri, "Information-bit, information-symbol, and decoded-symbol error rates for linear block codes," IEEE Trans. Commun., pp. 613-617, May 1988.
    • (1988) IEEE Trans. Commun. , pp. 613-617
    • Torrieri, D.1
  • 13
    • 0028427354 scopus 로고
    • Perfect binary codes: Constructions, properties, and enumeration
    • May
    • T. Etzion and A. Vardy, "Perfect binary codes: Constructions, properties, and enumeration," IEEE Trans. Inform. Theory, pp. 754-763, May 1994.
    • (1994) IEEE Trans. Inform. Theory , pp. 754-763
    • Etzion, T.1    Vardy, A.2
  • 16
    • 0036712243 scopus 로고    scopus 로고
    • More results on the weight enumerator of product codes
    • Sept.
    • L. M. G. M. Tolhuizen, "More results on the weight enumerator of product codes," IEEE Trans. Inform. Theory, vol. 48, pp. 2573-2577, Sept. 2002.
    • (2002) IEEE Trans. Inform. Theory , vol.48 , pp. 2573-2577
    • Tolhuizen, L.M.G.M.1
  • 17
    • 0032140566 scopus 로고    scopus 로고
    • Near optimum decoding of product codes: Block turbo codes
    • Aug.
    • R. Pyndiah, "Near optimum decoding of product codes: Block turbo codes," IEEE Trans. Commun., vol. 46, pp. 1003-1010, Aug. 1998.
    • (1998) IEEE Trans. Commun. , vol.46 , pp. 1003-1010
    • Pyndiah, R.1
  • 18
    • 0016037512 scopus 로고
    • Optimal decoding of linear codes for minimizing symbol error rate
    • Mar.
    • L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. 20, pp. 284-287, Mar. 1974.
    • (1974) IEEE Trans. Inform. Theory , vol.20 , pp. 284-287
    • Bahl, L.R.1    Cocke, J.2    Jelinek, F.3    Raviv, J.4
  • 19
    • 0027257044 scopus 로고
    • On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
    • Jan.
    • T. Kasami, T. Takata, T. Fujiwara, and S. Lin, "On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes," IEEE Trans. Inform. Theory, vol. 39, pp. 242-245, Jan. 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , pp. 242-245
    • Kasami, T.1    Takata, T.2    Fujiwara, T.3    Lin, S.4
  • 20
    • 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. 18, pp. 170-182, Jan. 1972.
    • (1972) IEEE Trans. Inform. Theory , vol.18 , pp. 170-182
    • Chase, D.1
  • 21
    • 0035481846 scopus 로고    scopus 로고
    • Fast chase algorithm with an application in turbo decoding
    • Oct.
    • S. A. Hirst, B. Honary, and G. Markarian, "Fast Chase algorithm with an application in turbo decoding," IEEE Trans. Commun., vol. 49, pp. 1693-1699, Oct. 2001.
    • (2001) IEEE Trans. Commun. , vol.49 , pp. 1693-1699
    • Hirst, S.A.1    Honary, B.2    Markarian, G.3
  • 22
    • 0033293465 scopus 로고    scopus 로고
    • Extrinsic information in turbo decoding: A unified view
    • Rio de Janeiro, Brazil, Dec.
    • G. Colavolpe, G. Ferrari, and R. Raheli, "Extrinsic information in turbo decoding: A unified view," in Proc. GLOBECOM 99, vol. 1A, Rio de Janeiro, Brazil, Dec. 1999, pp. 505-509.
    • (1999) Proc. GLOBECOM 99 , vol.1 A , pp. 505-509
    • Colavolpe, G.1    Ferrari, G.2    Raheli, R.3
  • 23
    • 0035509847 scopus 로고    scopus 로고
    • On multilevel codes and iterative multi-stage decoding
    • Nov.
    • P. A. Martin and D. P. Taylor, "On multilevel codes and iterative multi-stage decoding," IEEE Trans. Commun., vol. 49, pp. 1916-1925, Nov. 2001.
    • (2001) IEEE Trans. Commun. , vol.49 , pp. 1916-1925
    • Martin, P.A.1    Taylor, D.P.2
  • 24
    • 0034321356 scopus 로고    scopus 로고
    • Improving the Max-log-MAP turbo decoder
    • Nov.
    • J. Vogt and A. Finger, "Improving the Max-Log-MAP turbo decoder," Electronics Lett., vol. 36, pp. 1937-1939, Nov. 2000.
    • (2000) Electronics Lett. , vol.36 , pp. 1937-1939
    • Vogt, J.1    Finger, A.2
  • 25
    • 11844251957 scopus 로고    scopus 로고
    • Bandwidth-efficient coding schemes
    • University of Ancona, Ancona, Italy, ESA/ESOC Contract 14128/00/D/SW, Dec.
    • "Bandwidth-Efficient Coding Schemes," University of Ancona, Ancona, Italy, ESA/ESOC Contract 14128/00/D/SW, Final Rep., Dec. 2000.
    • (2000) Final Rep.
  • 26
    • 11844263873 scopus 로고    scopus 로고
    • Uniform puncturing approach to the performance evaluation of punctured turbo product codes
    • Oct.
    • F. Chiaraluce and R. Garello, "Uniform puncturing approach to the performance evaluation of punctured turbo product codes," in Proc. SoftCOM 2003, Oct. 2003, pp. 170-174.
    • (2003) Proc. SoftCOM 2003 , pp. 170-174
    • Chiaraluce, F.1    Garello, R.2
  • 27
    • 11844268621 scopus 로고    scopus 로고
    • Applications of the simple bound: Random codes, serial turbo codes, and punctured codes
    • Baveno, Italy, Sept.
    • A. Martinez, S. Morosi, and B. Ponticelli, "Applications of the simple bound: Random codes, serial turbo codes, and punctured codes," in Proc. V Eur. Workshop Mobile/Personal Satcoms, Baveno, Italy, Sept. 2002, pp. 147-151.
    • (2002) Proc. V Eur. Workshop Mobile/personal Satcoms , pp. 147-151
    • Martinez, A.1    Morosi, S.2    Ponticelli, B.3


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