A large class of cyclic and shortened cyclic binary codes for multiple error correction. Separable graphs, planar graphs and web grammars. Infinite-alphabet channels and the method of codes of a fixed composition. Representability of nonregular languages in finite probabilistic automata. Likelihood functions for stochastic signals in white noise.
Exponential error bounds for discrete memoryless channels with sequential decision feedback.
On efficient burst correcting residue polynomial codes. Terrence Fine . Extrapolation when very little is known about the source. The theory of interacting local automata. Higher order autocorrelation functions as translation invariants.