Vector Flows That Compute the Capacity of Discrete Memoryless Channels

One of the fundamental problems of information theory, since its foundation by C. Shannon, has been the computation of the capacity of a discrete memoryless channel, a quantity expressing the maximum rate at which information can travel through the channel. In this paper, we investigate the properti...

詳細記述

書誌詳細

出版年:	Entropy
主要な著者:	Guglielmo Beretta, Marcello Pelillo
フォーマット:	論文
言語:	英語
出版事項:	MDPI AG 2025-03-01
主題:	analog computation capacity convex optimization discrete memoryless channel dynamical systems mutual information
オンライン･アクセス:	https://www.mdpi.com/1099-4300/27/4/362