A nonprobabilistic source and channel coding theory
Abstract
An engineering interpretation is given for an isomorphism theorem proved in the context of symbolic dynaics. The latter may be viewed as the nonprobabilistic analog of ergodic theory. Contrary to Ornstein's isomorphism theorem this isomorphism results in engineering applications. Sliding block code algorithms are presented for both noiseless source and channel coding of nonprobabilistic source and channel models specified in term of a finite list of excluded blocks. The initial steps toward source coding with a fidelity criterion are described. Specifically the realistic density of errors distortion criterion is converted into a deformation of the (0,1)-matrix that describes a nonprobabilistic source.
- Publication:
-
Ph.D. Thesis
- Pub Date:
- 1981
- Bibcode:
- 1981PhDT........58H
- Keywords:
-
- Isomorphism;
- Probability Theory;
- Theorem Proving;
- Crystal Lattices;
- Lattice Parameters;
- Probability Density Functions;
- Communications and Radar