What people are saying - Write a review
We haven't found any reviews in the usual places.
A Sequential Decoding Algorithm
An Upper Bound to the Probability of Error
Minimum Metric along the Correct Path
8 other sections not shown
analagous analysis basic decoding iteration block codes bound to capacity Chapter characteristic equation code ensemble code tree code word segment coding error exponents comp conclude constant constraints correct path corresponds crash crit decoded branch decoding algorithm decoding procedure defined Definition depth derived determined difference equations employed encoding EQ(p expected computational effort exponential Figure fixed delay decision Furthermore hence i+l;z implies incorrect subtree independent Lemma log Mq lower bound mathematical induction maximum liklihood decoding minimization n+1 n n+1 noisy channel Observation obtain parameters Pareto Distribution path digit path metric path on top perscription positive roots probability of error Proof of Claim random coding argument random coding error random variable received symbols satisfied separation of variables sequence Sj+vj smallest root solution Subroutine sufficient statistic Table Theorem 3.3 threshold transmitted code word tree codes upper bound usual random coding Viterbi decoding whereupon