A note on the strong converse of the coding theorem for the general discrete finite-memory channel
- 31 March 1960
- journal article
- Published by Elsevier in Information and Control
- Vol. 3 (1) , 89-93
- https://doi.org/10.1016/s0019-9958(60)90317-x
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- On the coding theorem and its converse for finite-memory channelsInformation and Control, 1959
- The maximum achievable length of an error correcting codeIllinois Journal of Mathematics, 1958
- The coding of messages subject to chance errorsIllinois Journal of Mathematics, 1957