Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 5, MAY 2004 917 [12] R. A. Rueppel, "Linear complexity and random sequences," in Proc.
 

Summary: IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 5, MAY 2004 917
[12] R. A. Rueppel, "Linear complexity and random sequences," in Proc.
Eurocrypt'85 (Lecture Notes in Computer Science). Berlin, Germany:
Springer-Verlag, 1985, vol. 219, pp. 167­188.
[13] F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting
Codes. Amsterdam, The Netherlands: North-Holland, 1986.
[14] B. M. M. de Weger, "Approximation lattices of p -adic numbers," J.
Num. Theory, vol. 24, pp. 70­88, 1986.
[15] J. Xu and A. Klapper, "Feedback with carry shift registers over z=(n),"
in Proc. SETA'98. New York: Springer-Verlag, 1998.
The Kullback­Leibler Divergence Rate Between
Markov Sources
Ziad Rached, Student Member, IEEE,
Fady Alajaji, Senior Member, IEEE, and
L. Lorne Campbell, Life Fellow, IEEE
Abstract--In this work, we provide a computable expression for the
Kullback­Leibler divergence rate lim ( ) between
two time-invariant finite-alphabet Markov sources of arbitrary order and
arbitrary initial distributions described by the probability distributions
and , respectively. We illustrate it numerically and examine its

  

Source: Alajaji, Fady - Department of Mathematics and Statistics, Queen's University (Kingston)

 

Collections: Engineering