A new geometric capacity characterization of a discrete memoryless channel

DOI10.1109/18.2641MaRDI QIDQ3798587zbMATH OpenOpenAlexFDO

Authors Kenji Nakagawa, Fumio Kanaya

Publication date 1988

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

Full work available at URL https://doi.org/10.1109/18.2641

zbMATH Keywords

capacitydiscrete memoryless channelCsiszàr's theoremKullback- Leibler discrimination information

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• scientific article; zbMATH DE number 4211963
• scientific article; zbMATH DE number 4039791
• On numerical methods of calculating the capacity of continuous-input discrete-output memoryless channels
• Channel capacity for a given decoding metric
• scientific article; zbMATH DE number 3884087

Cited in

(3)

• Game-theoretic probability combination with applications to resolving conflicts between statistical methods
• Geometry of Arimoto algorithm
• Geometric approach to sampling and communication

This page was built for publication: A new geometric capacity characterization of a discrete memoryless channel

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