Enumeration of Markov chains and burst error statistics for finite state channel models

IEEE Transactions on Vehicular Technology

Volumn 48, Issue 2, 1999, Pages 415-428

  Pimentel, Cecilio ^a   Blake, Lan F ^a  

^a FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; ERROR STATISTICS; FINITE AUTOMATA; MARKOV PROCESSES; MATHEMATICAL MODELS;

FINITE STATE CHANNELS (FSC);

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 0033099779     PISSN: 00189545     EISSN: None     Source Type: Journal    
DOI: 10.1109/25.752565     Document Type: Article

References (19)

1. L.N. Kanal and A.R. K. Sastry, quot;Models for channels with memory and their applications to error control,quot; Proc. IEEE, vol. 66, pp. 724-744, July 1978.
2. J.A. Adoul, B. D. Fritchman, and L. Kanal, quot;A critical statistic for channels with memory,quot; IEEE Trans. Inform. Theory, vol. 18, pp. 133-141, Jan. 1972.
3. A. Ephremides and R.O. Snyder, quot;Modeling of high error rate binary communication channels,quot; IEEE Trans. Inform. Theory, vol. 28, pp. 549-555, May 1982.
4. E.N. Gilbert, quot;Capacity of a burst-noise channel,quot; Bell Syst. Tech. J., vol. 39, pp. 1253-1265, Sept. 1960.
5. B.D. Fritchman, quot;A binary channel characterization using partitioned Markov chains,quot; IEEE Trans. Inform. Theory, vol. 13, pp. 221-227, Apr. 1967.
6. E.O. Elliott, quot;Estimates of error rates for codes on burst-noise channels,quot; Bell Syst. Tech. J., vol. 42, pp. 1977-1997, Sept. 1963.
7. J.A. Adoul, quot;Error intervals and cluster density in channel modeling,quot; IEEE Trans. Inform. Theory, vol. 20, pp. 125-129, Jan. 1974.
8. A.I. Drukarev and K. P. Yiu, quot;Performance of error-correcting codes on channels with memory,quot; IEEE Trans. Commun., vol. 34, pp. 513-521, June 1986.
9. I.P. Goulden and D. M. Jackson, Combinatorial Enumeration. New York: Wiley, 1983.
10. L. Kittel, quot;Applications of the Viterbi Algorithm to error control coding design,quot; in Proc. IEEE Int. Zurich Seminar on Digital Commun., Zurich, Switzerland, Mar. 1984, pp. E2.1-E2.9.
11. quot;The set-up and use of generative stochastic channel mod-els for mobile radio data communication,quot; in Proc. IEEE Int. Conf. Commun.-ICC, Philadelphia, PA, June 1982, pp. 2H.4.1-2H.4.5.
12. A.R. K. Sastry and L. N. Kanal, quot;Channels with memory: Error statistics pertinent to evaluation of error control schemes,quot; in Proc. IEEE National Telecommunication Conf.-NTC, 1976, pp. 24.1.1-24.1.6.
13. J.R. Yee and E. J. Weldon, Jr., quot;Evaluation of the performance of error-correcting codes on a Gilbert channel,quot; IEEE Trans. Commun., vol. 43, pp. 2316-2323, Aug. 1995.
14. V. Cuperman, quot;An upper bound for the error probability on the Gilbert channel,quot; IEEE Trans. Commun. Technol, vol. COM-17, pp. 532-535, Oct. 1969.
15. B. Wong and C. Leung, quot;On computing undetected error probabilities on the Gilbert channel,quot; IEEE Trans. Commun., vol. 43, pp. 2657-2661, Nov. 1995.
16. A. Kuznetsov and F. S warts, A.J. H. Vinck, and H. C. Ferreira, quot;On the undetected error probability of linear block codes on channels with memory,quot; IEEE Trans. Inform. Theory, vol. 42, pp. 303-309, Jan. 1996.
17. G.H. Golub and C. F. Van Loan, Matrix Computations. Baltimore, MD: Johns Hopkins Univ. Press, 1991.
18. H.S. Wilf, Generating Functionology. San Diego, CA: Academic, 1990.
19. M. Mushkin and I. Bar-David, quot;Capacity and coding for the Gilbert-Elliott channels,quot; IEEE Trans. Inform. Theory, vol. 35, pp. 1277-1289, Nov. 1989.