On Binary Sliding Block Codes |
Contents
Calculating the Output Entropy | 9 |
Bounding the Output Entropy | 19 |
Behavior of Good Sliding Block Codes | 31 |
4 other sections not shown
Common terms and phrases
Approximating the Output BASIC STATE DIAGRAM Bound by calculating bounding the output channel coding CHAPTER code matrix coder complementation set conditional entropy data compression decoding denote difference equations DIMENSION distinct ASBC's distortion entropy rate entropy reduction fidelity criterion finite finite-order Markov chain GO TO 90 groups of taps H(LO H₁ H₂ Hence input sequence isolated zeros jointly stationary linear combination linearly independent lower bound mod 2 sum nonblock number of distinct number of elements number of sequences output digit output entropy output letters output process output sequences Pr(L₁ Pr(s PROBABILITY DISTRIBUTION PROGRAM Proof row-echelon form rows sequences of length skewing sliding block code source coding source encoding STATE(N stationary process subclass of SBC SUBSTATE tap-vectors TEMP TEMP1 TEMPST Theorem transition probabilities window content window length window patterns xk+1 xn-N Xn+N Zk+1