메뉴 건너뛰기




Volumn 51, Issue 12, 2003, Pages 2011-2018

Upper bounds to error probabilities of coded systems beyond the cutoff rate

Author keywords

Cutoff rate; Error probability; Fading channels; Low density parity check (LDPC) codes; Turbo codes

Indexed keywords

BINARY CODES; CODING ERRORS; GAUSSIAN NOISE (ELECTRONIC); PROBABILITY; RAYLEIGH FADING; SIGNAL TO NOISE RATIO; TURBO CODES; WHITE NOISE;

EID: 0742321724     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2003.820746     Document Type: Article
Times cited : (39)

References (24)
  • 1
    • 0029769150 scopus 로고    scopus 로고
    • Voronoi regions for binary linear block codes
    • Jan.
    • E. Agrell, "Voronoi regions for binary linear block codes," IEEE Trans. Inform. Theory, vol. 42, pp. 310-316, Jan. 1996.
    • (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 310-316
    • Agrell, E.1
  • 2
    • 0032202085 scopus 로고    scopus 로고
    • On the Voronoi neighbor ratio for binary linear block codes
    • Nov.
    • ____, "On the Voronoi neighbor ratio for binary linear block codes," IEEE Trans. Inform. Theory, vol. 44, pp. 3064-3072, Nov. 1998.
    • (1998) IEEE Trans. Inform. Theory , vol.44 , pp. 3064-3072
    • Agrell, E.1
  • 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
    • 0030257652 scopus 로고    scopus 로고
    • Near-optimum error-correcting coding and decoding: Turbo-codes
    • Oct.
    • C. Berrou and A. Glavieux, "Near-optimum error-correcting coding and decoding: turbo-codes," IEEE Trans. Commun., vol. 44, pp. 1261-1271, Oct. 1996.
    • (1996) IEEE Trans. Commun. , vol.44 , pp. 1261-1271
    • Berrou, C.1    Glavieux, A.2
  • 8
    • 0032097155 scopus 로고    scopus 로고
    • New performance bounds for turbo codes
    • June
    • T. M. Duman and M. Salehi, "New performance bounds for turbo codes," IEEE Trans. Commun., vol. 46, pp. 717-723, June 1998.
    • (1998) IEEE Trans. Commun. , vol.46 , pp. 717-723
    • Duman, T.M.1    Salehi, M.2
  • 9
    • 0026220377 scopus 로고
    • Geometrically uniform codes
    • Sept.
    • G. D. Forney, Jr., "Geometrically uniform codes," IEEE Trans. Inform. Theory, vol. 37, pp. 1241-1260, Sept. 1991.
    • (1991) IEEE Trans. Inform. Theory , vol.37 , pp. 1241-1260
    • Forney Jr., G.D.1
  • 11
    • 84939732350 scopus 로고
    • A simple derivation of the coding theorem and some applications
    • Jan.
    • ____, "A simple derivation of the coding theorem and some applications," IEEE Trans. Inform. Theory, vol. IT-12, pp. 3-18, Jan. 1965.
    • (1965) IEEE Trans. Inform. Theory , vol.IT-12 , pp. 3-18
    • Gallager, R.G.1
  • 12
    • 0026045314 scopus 로고
    • On the error probability of signals in additive white Gaussian noise
    • Jan.
    • B. Hughes, "On the error probability of signals in additive white Gaussian noise," IEEE Trans. Inform. Theory, vol. 37, pp. 151-155, Jan. 1991.
    • (1991) IEEE Trans. Inform. Theory , vol.37 , pp. 151-155
    • Hughes, B.1
  • 13
    • 0018544749 scopus 로고
    • Decoding linear blocks codes for minimizing word-error rates
    • Nov.
    • T.-Y. Hwang, "Decoding linear blocks codes for minimizing word-error rates," 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
  • 14
    • 0028462704 scopus 로고
    • Bounds on the decoding error probability of binary linear codes via their spectra
    • July
    • G. Poltyrev, "Bounds on the decoding error probability of binary linear codes via their spectra," IEEE Trans. Inform. Theory, vol. 40 pp. 1284-1292, July 1994.
    • (1994) IEEE Trans. Inform. Theory , vol.40 , pp. 1284-1292
    • Poltyrev, G.1
  • 17
    • 0033890903 scopus 로고    scopus 로고
    • Improved upper bounds on the ensemble performance of ML decoded low density parity check codes
    • Mar.
    • ____, "Improved upper bounds on the ensemble performance of ML decoded low density parity check codes," IEEE Commun. Lett., vol. 4, pp. 89-91, Mar. 2000.
    • (2000) IEEE Commun. Lett. , vol.4 , pp. 89-91
    • Sason, I.1    Shamai, S.2
  • 18
    • 0032667177 scopus 로고    scopus 로고
    • Bounds on the error probability of ML decoding for block and turbo block codes
    • Mar.-Apr.
    • ____, "Bounds on the error probability of ML decoding for block and turbo block codes," Ann. Télécommun., vol. 54, no. 3-4, pp. 183-200, Mar.-Apr. 1999.
    • (1999) Ann. Télécommun. , vol.54 , Issue.3-4 , pp. 183-200
    • Sason, I.1    Shamai, S.2
  • 19
    • 0035442510 scopus 로고    scopus 로고
    • On improved bounds on the decoding error probabilities of block codes over interleaved fading channels, with applications to turbo-like codes
    • Sept.
    • ____, "On improved bounds on the decoding error probabilities of block codes over interleaved fading channels, with applications to turbo-like codes," IEEE Trans. Inform. Theory, vol. 47, pp. 2275-2299, Sept. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 2275-2299
    • Sason, I.1    Shamai, S.2
  • 23
    • 0032657646 scopus 로고    scopus 로고
    • New results on serial concatenated and accumulated-convolutional turbo code performance
    • Mar.-Apr.
    • A. J. Viterbi and A. M. Viterbi, "New results on serial concatenated and accumulated-convolutional turbo code performance," Ann. Télécommun., vol. 54, no. 3-4, pp. 173-182, Mar.-Apr. 1999.
    • (1999) Ann. Télécommun. , vol.54 , Issue.3-4 , pp. 173-182
    • Viterbi, A.J.1    Viterbi, A.M.2
  • 24
    • 0003811543 scopus 로고    scopus 로고
    • A simple tight bound on error probability of block codes with application to turbo codes
    • Jet Propulsion Lab., Pasadena, CA, JPL TMO Prog. Rep. 42-139, Nov. 15
    • D. Divsalar, "A simple tight bound on error probability of block codes with application to turbo codes," Jet Propulsion Lab., Pasadena, CA, JPL TMO Prog. Rep. 42-139, Nov. 15, 1999.
    • (1999)
    • Divsalar, D.1


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