E-Mail Alert

Add your e-mail address to receive forthcoming issues of this journal:

Journal Browser

Journal Browser

Special Issue "Information Theory for Data Communications and Processing"

A special issue of Entropy (ISSN 1099-4300).

Deadline for manuscript submissions: 31 December 2018

Special Issue Editors

Guest Editor
Prof. Dr. Shlomo Shamai (Shitz)

Technion - Israel Institute of Technology, EE Department, Haifa, Israel
Website | E-Mail
Interests: Information theory and communications
Guest Editor
Prof. Dr. Abdellatif Zaidi

Institut Gaspard Monge, Université Paris-Est, 05 Boulevard Descartes, Cité Descartes, Champs sur Marne, 77454, France
Website | E-Mail
Interests: Network information theory, statistical decision theory, data compression, security and privacy

Special Issue Information

Dear Colleagues,

This Special Issues focuses on fundamental information theoretic aspects of remote processing in networks. We welcome unpublished contributions related to advanced techniques of processing data distributively in networks. Examples include signal processing solutions, based on communication and information theoretic considerations, for Cloud and Fog Radio Access Networks (RAN), remote source coding, as well as interdisciplinary connections with problems such as information bottleneck, information-theoretic learning and prediction, distributed estimation and decision making, secrecy/privacy and identification in communication systems.

Prof. Dr. Shlomo Shamai (Shitz)
Prof. Dr. Abdellatif Zaidi
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All papers will be peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Entropy is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1500 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

Information theory, communications, signal processing. In particular, topics of interest include, but are not restricted to, the following: 
  • Fog and Cloud RANs 
  • Remote source coding and indirect rate distortion theory
  • Chief Executive Officer (CEO) source coding problems 
  • Noisy network coding 
  • Distributed estimation 
  • Information Bottleneck 
  • Information theoretic aspects of prediction and Deep learning 
  • Universal compression 
  • Hypothesis testing and statistics 
  • Caching 
  • Network information theoretic frameworks, including: multiple access, broadcast, relay, wiretap and X channels

Published Papers (3 papers)

View options order results:
result details:
Displaying articles 1-3
Export citation of selected articles as:

Research

Open AccessArticle Gaussian Multiple Access Channels with One-Bit Quantizer at the Receiver ,
Entropy 2018, 20(9), 686; https://doi.org/10.3390/e20090686
Received: 21 May 2018 / Revised: 20 August 2018 / Accepted: 5 September 2018 / Published: 7 September 2018
PDF Full-text (458 KB) | HTML Full-text | XML Full-text
Abstract
The capacity region of a two-transmitter Gaussian multiple access channel (MAC) under average input power constraints is studied, when the receiver employs a zero-threshold one-bit analogue-to-digital converter (ADC). It is proven that the input distributions of the two transmitters that achieve the boundary
[...] Read more.
The capacity region of a two-transmitter Gaussian multiple access channel (MAC) under average input power constraints is studied, when the receiver employs a zero-threshold one-bit analogue-to-digital converter (ADC). It is proven that the input distributions of the two transmitters that achieve the boundary points of the capacity region are discrete. Based on the position of a boundary point, upper bounds on the number of the mass points of the corresponding distributions are derived. Furthermore, a lower bound on the sum capacity is proposed that can be achieved by time division with power control. Finally, inspired by the numerical results, the proposed lower bound is conjectured to be tight. Full article
(This article belongs to the Special Issue Information Theory for Data Communications and Processing)
Figures

Figure 1

Open AccessArticle Non-Orthogonal eMBB-URLLC Radio Access for Cloud Radio Access Networks with Analog Fronthauling
Entropy 2018, 20(9), 661; https://doi.org/10.3390/e20090661
Received: 17 July 2018 / Revised: 20 August 2018 / Accepted: 31 August 2018 / Published: 2 September 2018
PDF Full-text (4528 KB) | HTML Full-text | XML Full-text
Abstract
This paper considers the coexistence of Ultra Reliable Low Latency Communications (URLLC) and enhanced Mobile BroadBand (eMBB) services in the uplink of Cloud Radio Access Network (C-RAN) architecture based on the relaying of radio signals over analog fronthaul links. While Orthogonal Multiple Access
[...] Read more.
This paper considers the coexistence of Ultra Reliable Low Latency Communications (URLLC) and enhanced Mobile BroadBand (eMBB) services in the uplink of Cloud Radio Access Network (C-RAN) architecture based on the relaying of radio signals over analog fronthaul links. While Orthogonal Multiple Access (OMA) to the radio resources enables the isolation and the separate design of different 5G services, Non-Orthogonal Multiple Access (NOMA) can enhance the system performance by sharing wireless and fronthaul resources. This paper provides an information-theoretic perspective in the performance of URLLC and eMBB traffic under both OMA and NOMA. The analysis focuses on standard cellular models with additive Gaussian noise links and a finite inter-cell interference span, and it accounts for different decoding strategies such as puncturing, Treating Interference as Noise (TIN) and Successive Interference Cancellation (SIC). Numerical results demonstrate that, for the considered analog fronthauling C-RAN architecture, NOMA achieves higher eMBB rates with respect to OMA, while guaranteeing reliable low-rate URLLC communication with minimal access latency. Moreover, NOMA under SIC is seen to achieve the best performance, while, unlike the case with digital capacity-constrained fronthaul links, TIN always outperforms puncturing. Full article
(This article belongs to the Special Issue Information Theory for Data Communications and Processing)
Figures

Figure 1

Open AccessArticle Symmetry, Outer Bounds, and Code Constructions: A Computer-Aided Investigation on the Fundamental Limits of Caching
Entropy 2018, 20(8), 603; https://doi.org/10.3390/e20080603
Received: 26 June 2018 / Revised: 8 August 2018 / Accepted: 11 August 2018 / Published: 13 August 2018
PDF Full-text (543 KB) | HTML Full-text | XML Full-text
Abstract
We illustrate how computer-aided methods can be used to investigate the fundamental limits of the caching systems, which are significantly different from the conventional analytical approach usually seen in the information theory literature. The linear programming (LP) outer bound of the entropy space
[...] Read more.
We illustrate how computer-aided methods can be used to investigate the fundamental limits of the caching systems, which are significantly different from the conventional analytical approach usually seen in the information theory literature. The linear programming (LP) outer bound of the entropy space serves as the starting point of this approach; however, our effort goes significantly beyond using it to prove information inequalities. We first identify and formalize the symmetry structure in the problem, which enables us to show the existence of optimal symmetric solutions. A symmetry-reduced linear program is then used to identify the boundary of the memory-transmission-rate tradeoff for several small cases, for which we obtain a set of tight outer bounds. General hypotheses on the optimal tradeoff region are formed from these computed data, which are then analytically proven. This leads to a complete characterization of the optimal tradeoff for systems with only two users, and certain partial characterization for systems with only two files. Next, we show that by carefully analyzing the joint entropy structure of the outer bounds for certain cases, a novel code construction can be reverse-engineered, which eventually leads to a general class of codes. Finally, we show that outer bounds can be computed through strategically relaxing the LP in different ways, which can be used to explore the problem computationally. This allows us firstly to deduce generic characteristic of the converse proof, and secondly to compute outer bounds for larger problem cases, despite the seemingly impossible computation scale. Full article
(This article belongs to the Special Issue Information Theory for Data Communications and Processing)
Figures

Figure 1

Back to Top