Open Access
October, 1972 Coding Theorem for Stationary, Asymptotically Memoryless, Continuous-time Channels
T. T. Kadota, A. D. Wyner
Ann. Math. Statist. 43(5): 1603-1611 (October, 1972). DOI: 10.1214/aoms/1177692392

Abstract

We give a mathematical definition of stationary, asymptotically memoryless, continuous-time channels, and prove a coding theorem and its converse for such channels.

Citation

Download Citation

T. T. Kadota. A. D. Wyner. "Coding Theorem for Stationary, Asymptotically Memoryless, Continuous-time Channels." Ann. Math. Statist. 43 (5) 1603 - 1611, October, 1972. https://doi.org/10.1214/aoms/1177692392

Information

Published: October, 1972
First available in Project Euclid: 27 April 2007

zbMATH: 0249.94004
MathSciNet: MR351617
Digital Object Identifier: 10.1214/aoms/1177692392

Rights: Copyright © 1972 Institute of Mathematical Statistics

Vol.43 • No. 5 • October, 1972
Back to Top