## Tree Codes and Branching ProcessesDepartment of Electrical Engineering, Stanford University, 1975 - Data compression (Computer science) - 174 pages |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

INTRODUCTION | viii |

MATHEMATICAL PRELIMINARIES 9 | i |

A TREE CODING THEOREM | 17 |

3 other sections not shown

### Common terms and phrases

acceptance criterion associated branching process assumed average computation average distortion block codes blocklength bounded per-letter distortion channel coding Chernoff bounding codeword computation per level convolutional codes CURRENT NODE POINTER data compression defined encode the source environments process existence of optimal extinction q Fano Algorithm FC(R finite fixed computation method following theorem Galton-Watson Process IID sources infinite law of large Lemma Lindley Process Little Tree Algorithm little tree depth lower bound m(xk mean number memoryless non-certain extinction optimality of tree P(xk parameters parent particle per-letter distortion measure Prflog probability of extinction Process with Random Proof Random Environments random tree codes random variable rate distortion theory reproduction alphabet reproduction symbols Section sequential encoding algorithm sequential methods source output sequence source sequence source symbol encoded strictly less strictly positive solution surviving paths symmetric encoding problems target distortion thesis tree coding process upper bound Viterbi algorithm zero