Block coding for discrete stationaryd-continuous noisy channels

Abstract
A new class of discrete stationary noisy channels with memory and anticipation termed d-continuous channels is introduced and is shown to include all stationary discrete channels for which coding theorems exist. Roughly speaking, in a\bar{d}-continuous channel the effect of the "past" and "future" inputs on n successive outputs dies out asymptotically withnas measured in a\bar{d}or average Hamming distance sense. This is weaker than the corresponding uotious of Pfaffeihuber, Kadota, and Wyner, who require that probabilities of alln-tuples be close; that is, closeness in a variational or distribution sense. General block channel coding and block joint source and channel coding theorems are proved for stationary\bar{d}-continuous channels, and various definitions of channel capacity are compared.

This publication has 27 references indexed in Scilit: