You are currently viewing a new version of our website. To view the old version click .
Entropy
  • Correction
  • Open Access

23 June 2022

Correction: Günlü, O. Function Computation under Privacy, Secrecy, Distortion, and Communication Constraints. Entropy 2022, 24, 110

Chair of Communications Engineering and Security, University of Siegen, 57076 Siegen, Germany
This article belongs to the Special Issue Information-Theoretic Approach to Privacy and Security
Special case results given in Lemmas 1–4 and evaluated in Section 4.4 as an example are unfortunately not necessarily the exact rate regions for all channel models, although they are valid inner bounds. In more detail, the inner bounds given in Theorems 1 and 2 can be simplified for functions that are partially invertible with respect to X j ˜ by choosing the auxiliary random variable U j = X j ˜ since U j n represents a distorted version of X j   ˜ n . Similarly, for invertible functions one can simplify the inner bounds by choosing U 1 = X 1 ˜ and U 2 = X 2 ˜ . However, for neither special case it is necessarily optimal to choose the other auxiliary random variables V1 and V2 as constants, since they represent a step that aims to increase the equivocation at the eavesdropper. Therefore, we replace the wordings for all special cases considered in [] by stating that the rate regions given in Lemmas 1–4 and evaluated in Section 4.4 are valid and computable inner bounds for the corresponding special cases for all channel models. These changes can be implemented in [] by replacing:
  • “exact lossless” in the Abstract and Sections 1.2, 1.3 and 4.1 with “simplified lossless”.
  • “exact rate region” in Sections 1.2, 1.3, 3.2, 4, 4.1, 4.2 and 6 with “simplified rate region”.
  • “The … rate region … when … is the set of …” in Lemmas 1–4 with “The … rate region … when … includes the set of …”.
  • “the lossless rate regions” in Section 4.3 with “the further simplified lossless rate regions”.
  • “the exact lossless rate region” in Section 4.3.1 with “the further simplified lossless rate region”.
  • “the lossless rate region” in Sections 4.3.2 and 4.4 with “an inner bound for the lossless rate region”.
  • “one exact region” in the Abstract with “one achievable region”.
  • “evaluate the exact rate region” in Section 1.2 with “evaluate a simplified rate region”.
  • “the rate region for” in Section 1.3 with “a rate region for”.
  • “the exact lossless” in Section 4.3.2 with “a simplified lossless”.
Furthermore, below Remark 1, delete the sentence “i.e., rate regions for which inner and outer bounds match”. Since [] is an extension of [32,33], the same changes are relevant also for [32] (Corollaries 1 and 2) and [33] (Corollary 1).
The author states that the scientific conclusions are unaffected. This correction was approved by the Academic Editor. The original publication has also been updated.

Reference

  1. Günlü, O. Function Computation under Privacy, Secrecy, Distortion, and Communication Constraints. Entropy 2022, 24, 110. [Google Scholar] [CrossRef] [PubMed]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.