Local fidelity, constrained codes, and the Meru Prastara
Lav R. Varshney · IEEE Potentials · 2008
Information theory provides fundamental bounds on the tradeoff between achievable distortion in communication and the amount of resources that are allocated to the communication system. For optimal point-to-point communication, this is a condition on rate matching. Most theoretical computation work has focused on single-letter fidelity and resource criteria due to tractability. However, these may not reflect true system objectives and constraints. So, it is desirable to extend analysis to non-single-letter fidelity and resource criteria. In certain cases, the problem can be reduced to combinatorics and becomes tractable.