Block and Tree Codes
Block codes
- k input bits -> n output bits; an “(n,k) code”
- memoryless process, simple mapping
- code rate R = k/n [typ 0.25< R 0.875]
Tree codes (incl. convolutional codes)
- k input, n output, n is f(v+k input bits)
- v > 0 implies process has memory