The rate region of the (5, 4, 4) exact-repair regenerating codes is provided. The outer bound is obtained through extension of the computational approach developed in an earlier work, and this region is indeed achievable using the canonical layered codes. This result is part of the online collection of “Solutions of Computed Information Theoretic Limits (SCITL)”.

In many multimedia applications, there is a need to authenticate sources subjected to benign degradations such as noise, compression, etc., in addition to potential tampering attacks. Authentication can be enabled through the embedding of suitably chosen markings in the original signal. We develop one information-theoretic formulation of this problem, and identify and interpret the associated f...

The recent success of structured solutions for a class of information-theoretic network problems, calls for exploring their limits. We show that sum-product channels resist a solution by structured (as well as random) codes. We conclude that the structured approach fails whenever the channel operations do not commute (or for general functional channels, when the channel function is non decompos...

The efficiency of wireless information and power transfer (WIPT) systems requires an essential reevaluation rethinking the entire transceiver chain, which is characterized by a bottom-up multi-layer design approach. In this article, we introduce describe key layers: “Mathematical modeling,” associated with investigation mathematical models for process, “Information-theoretic limits,” refers to ...