Laura Ekroot

Learn More
AbstructIn this partially tutorial paper, we examine minimal trellis representations of linear block codes and analyze several measures of trellis complexity: maximum state and edge dimensions, total span length, and total vertices, edges and mergers. We obtain bounds on these complexities as extensions of well-known dimensiodlength profile (DLP) bounds.(More)
A Wald-like equation is proved for the entropy of a randb@y, stopped sequence of independent identically distributed discrete random variables XI, X2,. with a nonanticipating stopping time N. Sljecifically, it is shown that H(XN)= (EN)H(X,)+ H(NIX”), where XN denotes the randomly stopped sequence. Thus, the randomness in the stopped sequence X” is the(More)
ANract-The idea of thermodynamic depth put forth by Lloyd and Pagels requires the computation of the entropy of Markov trajectories. Toward this end we consider an irreducible finite state Markov chain with transition matrix P and associated entropy rate H(X) = c; j p;I’;j log P;j, where p is the stationary distribution given by the solution of /I = MI’. A(More)
Absftact-The idea of thermodynamic depth put forth by Lloyd and Pageh requires the computation of the entropy af Markov tqjectorim Toward this end we consider an irreducible finite state Markov chain with transition matrix P and pssoeiated entropy rate H ( X ) = E,,, p,P,, log P,,, where p is the stationary distribution given by the solution of p = p P . A(More)
  • 1