A per letter converse to the channel coding theorem

DOI10.1109/TIT.1966.1053928MaRDI QIDQ4047447zbMATH OpenFDO

Authors Barney Reiffen

Publication date 1966

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Information theory (general) (94A15)

Cited in

(1)

• Asynchronous fully-decentralized SGD in the cluster-based model

This page was built for publication: A per letter converse to the channel coding theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4047447)