A direct proof of the coding theorem for discrete sources with memory.
Lee D. DavissonMichael B. PursleyPublished in: IEEE Trans. Inf. Theory (1975)
Keyphrases
- interactive theorem proving
- coding scheme
- low memory
- information sources
- memory requirements
- data sets
- memory usage
- theorem prover
- coding method
- main memory
- discrete version
- finite number
- computing power
- continuous domains
- memory space
- database
- databases
- discrete geometry
- linear logic
- memory size
- discrete space
- data sources
- blind source separation
- multiple sources
- inter frame
- associative memory