Abstract

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

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call