Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
4.7
2.7
Journals
Entropy
Special Issues
Multiuser Information Theory III
entropy-logo
Submit to Entropy Review for Entropy Propose a Special Issue

Journal Menu

► Journal Menu

Journal Browser

► Journal Browser
share announcement

Multiuser Information Theory III

A special issue of Entropy (ISSN 1099-4300). This special issue belongs to the section "Information Theory, Probability and Statistics".

Deadline for manuscript submissions: closed (18 July 2021) | Viewed by 17051

Special Issue Editors

Prof. Dr. S. Sandeep Pradhan

E-Mail Website
Guest Editor
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48103, USA
Interests: distributed compression in sensor networks; multiple description source coding; multi-user channel coding; group codes for network communication; network capacity problems
Dr. Ayfer Ozgur

E-Mail Website
Guest Editor
Department of Electrical Engineering, Stanford University, Stanford, CA 94305, USA
Interests: information theory; wireless networks; statistics and probability
Dr. Xiugang Wu

E-Mail Website
Guest Editor
Department of Electrical and Computer Engineering, University of Delaware, Newark, DE 19716, USA
Interests: information theory; data science; optimal transport; networks

Special Issue Information

Dear Colleagues,

The previous Special Issues on “Multiuser Information Theory” in the last three years have led to the publication of several high-quality papers on new research directions in information theory. These Special Issues received a lot of attention from the research community. In 2020, we will continue this trend with a new Special Issue on “Multiuser Information Theory III”. Possible topics include, but are not limited to, the following:

  • Cybersecurity, privacy, distributed data storage, and learning;
  • Non-asymptotic performance characterizations;
  • Multi-letter coding techniques;
  • Information theory and computing;
  • Communication and computing complexity;
  • Non-Shannon-type inequalities;
  • Information geometry;
  • Information theory and additive combinatorics;
  • New channel models based on mmWave technology;
  • Network coding and index coding;
  • Bio-inspired information and computing;
  • Distributed hypothesis testing and estimation;
  • Applications of information theory in probability theory and statistics;
  • Connection between information theory and theory of random graphs;
  • Quantum information theory;
  • Quantum error-correcting codes;
  • Applications of information theory in quantum physics;
  • Relativistic quantum information.

The goal of this Special Issue is to develop new bridges between information theory and other fields, such as abstract algebra, ergodic theory, quantum physics, theory of random graphs, theory of communication complexity, information geometry, and additive combinatorics, and thereby contribute to furthering collaborations between researchers working in these communities.

Prof. S. Sandeep Pradhan
Dr. Ayfer Ozgur
Dr. Xiugang Wu
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 submissions that pass pre-check are 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 2600 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.

Published Papers (6 papers)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

Jump to: Review

19 pages, 4244 KiB  
Article
Joint Resource Allocation for Multiuser Opportunistic Beamforming Systems with OFDM-NOMA
by Wen-Bin Sun, Ming-Liang Tao, Ling Wang, Xin Yang, Rui-Zhe Zhou and Zi-Xiong Yang
Entropy 2021, 23(7), 809; https://0-doi-org.brum.beds.ac.uk/10.3390/e23070809 - 25 Jun 2021
Cited by 2 | Viewed by 1433
Abstract
Opportunistic beamforming (OBF) is an effective technique to improve the spectrum efficiencies (SEs) of multiple-input-multiple-output (MIMO) systems, which can obtain multiuser diversity gains with both low computation complexity and feedback information. To serve multiple users simultaneously, many multiple-access schemes have been researched in [...] Read more.
Opportunistic beamforming (OBF) is an effective technique to improve the spectrum efficiencies (SEs) of multiple-input-multiple-output (MIMO) systems, which can obtain multiuser diversity gains with both low computation complexity and feedback information. To serve multiple users simultaneously, many multiple-access schemes have been researched in OBF. However, for most of the multiple-access schemes, the SEs are not satisfactory. To further improve the SE, this paper proposes a downlink multiuser OBF system, where both orthogonal frequency division multiplexing (OFDM) and non-orthogonal multiple-access (NOMA) methods are applied. The closed-form expressions of the equivalent channels and SE are derived in frequency selective fading channels. Then, an optimization problem is formulated to maximize the SE, although the optimization problem is non-convex and hard to solve. To obtain the solution, we divide the optimization problem into two suboptimal issues, and then a joint iterative algorithm is applied. In the proposed optimization scheme, the subcarrier mapping ϑ, user pairing knc and allocated power Pknc are determined to maximize spectrum efficiency (SE) and reduce bit error ratio (BER). According to numerical results, the proposed method achieves approximately 5 dB gain on both SE and BER, compared to the existing beamforming methods with low feedback information. Moreover, the SE of the proposed method is approximately 2 (bps/Hz) higher than sparse code multiple-access (SCMA), when the number of waiting users and the ratio of transmit power to noise variance are respectively 10 and 20 dB. It is indicated that the proposed scheme can achieve high and low BER with the limited feedback and computation complexity, regardless of the transmit power and the number of waiting users. Full article
(This article belongs to the Special Issue Multiuser Information Theory III)
►▼ Show Figures

Figure 1

33 pages, 477 KiB  
Article
Trade-offs between Error Exponents and Excess-Rate Exponents of Typical Slepian–Wolf Codes
by Ran Tamir (Averbuch) and Neri Merhav
Entropy 2021, 23(3), 265; https://0-doi-org.brum.beds.ac.uk/10.3390/e23030265 - 24 Feb 2021
Cited by 5 | Viewed by 1703
Abstract
Typical random codes (TRCs) in a communication scenario of source coding with side information in the decoder is the main subject of this work. We study the semi-deterministic code ensemble, which is a certain variant of the ordinary random binning code ensemble. In [...] Read more.
Typical random codes (TRCs) in a communication scenario of source coding with side information in the decoder is the main subject of this work. We study the semi-deterministic code ensemble, which is a certain variant of the ordinary random binning code ensemble. In this code ensemble, the relatively small type classes of the source are deterministically partitioned into the available bins in a one-to-one manner. As a consequence, the error probability decreases dramatically. The random binning error exponent and the error exponent of the TRCs are derived and proved to be equal to one another in a few important special cases. We show that the performance under optimal decoding can be attained also by certain universal decoders, e.g., the stochastic likelihood decoder with an empirical entropy metric. Moreover, we discuss the trade-offs between the error exponent and the excess-rate exponent for the typical random semi-deterministic code and characterize its optimal rate function. We show that for any pair of correlated information sources, both error and excess-rate probabilities exponential vanish when the blocklength tends to infinity. Full article
(This article belongs to the Special Issue Multiuser Information Theory III)
►▼ Show Figures

Figure 1

23 pages, 466 KiB  
Article
Computational Hardness of Collective Coin-Tossing Protocols
by Hemanta K. Maji
Entropy 2021, 23(1), 44; https://0-doi-org.brum.beds.ac.uk/10.3390/e23010044 - 30 Dec 2020
Viewed by 1733
Abstract
Ben-Or and Linial, in a seminal work, introduced the full information model to study collective coin-tossing protocols. Collective coin-tossing is an elegant functionality providing uncluttered access to the primary bottlenecks to achieve security in a specific adversarial model. Additionally, the research outcomes for [...] Read more.
Ben-Or and Linial, in a seminal work, introduced the full information model to study collective coin-tossing protocols. Collective coin-tossing is an elegant functionality providing uncluttered access to the primary bottlenecks to achieve security in a specific adversarial model. Additionally, the research outcomes for this versatile functionality has direct consequences on diverse topics in mathematics and computer science. This survey summarizes the current state-of-the-art of coin-tossing protocols in the full information model and recent advances in this field. In particular, it elaborates on a new proof technique that identifies the minimum insecurity incurred by any coin-tossing protocol and, simultaneously, constructs the coin-tossing protocol achieving that insecurity bound. The combinatorial perspective into this new proof-technique yields new coin-tossing protocols that are more secure than well-known existing coin-tossing protocols, leading to new isoperimetric inequalities over product spaces. Furthermore, this proof-technique’s algebraic reimagination resolves several long-standing fundamental hardness-of-computation problems in cryptography. This survey presents one representative application of each of these two perspectives. Full article
(This article belongs to the Special Issue Multiuser Information Theory III)
►▼ Show Figures

Figure 1

22 pages, 419 KiB  
Article
Reduction Theorem for Secrecy over Linear Network Code for Active Attacks
by Masahito Hayashi, Masaki Owari, Go Kato and Ning Cai
Entropy 2020, 22(9), 1053; https://0-doi-org.brum.beds.ac.uk/10.3390/e22091053 - 21 Sep 2020
Cited by 5 | Viewed by 2299
Abstract
We discuss the effect of sequential error injection on information leakage under a network code. We formulate a network code for the single transmission setting and the multiple transmission setting. Under this formulation, we show that the eavesdropper cannot increase the power of [...] Read more.
We discuss the effect of sequential error injection on information leakage under a network code. We formulate a network code for the single transmission setting and the multiple transmission setting. Under this formulation, we show that the eavesdropper cannot increase the power of eavesdropping by sequential error injection when the operations in the network are linear operations. We demonstrated the usefulness of this reduction theorem by applying a concrete example of network. Full article
(This article belongs to the Special Issue Multiuser Information Theory III)
►▼ Show Figures

Figure 1

32 pages, 1382 KiB  
Article
Bounds on the Sum-Rate of MIMO Causal Source Coding Systems with Memory under Spatio-Temporal Distortion Constraints
by Photios A. Stavrou, Jan Østergaard and Mikael Skoglund
Entropy 2020, 22(8), 842; https://0-doi-org.brum.beds.ac.uk/10.3390/e22080842 - 30 Jul 2020
Cited by 2 | Viewed by 4362
Abstract
In this paper, we derive lower and upper bounds on the OPTA of a two-user multi-input multi-output (MIMO) causal encoding and causal decoding problem. Each user’s source model is described by a multidimensional Markov source driven by additive [...] Read more.
In this paper, we derive lower and upper bounds on the OPTA of a two-user multi-input multi-output (MIMO) causal encoding and causal decoding problem. Each user’s source model is described by a multidimensional Markov source driven by additive i.i.d. noise process subject to three classes of spatio-temporal distortion constraints. To characterize the lower bounds, we use state augmentation techniques and a data processing theorem, which recovers a variant of rate distortion function as an information measure known in the literature as nonanticipatory ϵ-entropy, sequential or nonanticipative RDF. We derive lower bound characterizations for a system driven by an i.i.d. Gaussian noise process, which we solve using the SDP algorithm for all three classes of distortion constraints. We obtain closed form solutions when the system’s noise is possibly non-Gaussian for both users and when only one of the users is described by a source model driven by a Gaussian noise process. To obtain the upper bounds, we use the best linear forward test channel realization that corresponds to the optimal test channel realization when the system is driven by a Gaussian noise process and apply a sequential causal DPCM-based scheme with a feedback loop followed by a scaled ECDQ scheme that leads to upper bounds with certain performance guarantees. Then, we use the linear forward test channel as a benchmark to obtain upper bounds on the OPTA, when the system is driven by an additive i.i.d. non-Gaussian noise process. We support our framework with various simulation studies. Full article
(This article belongs to the Special Issue Multiuser Information Theory III)
►▼ Show Figures

Figure 1

Review

Jump to: Research

137 pages, 5168 KiB  
Review
The Broadcast Approach in Communication Networks
by Ali Tajer, Avi Steiner and Shlomo Shamai (Shitz)
Entropy 2021, 23(1), 120; https://0-doi-org.brum.beds.ac.uk/10.3390/e23010120 - 18 Jan 2021
Cited by 12 | Viewed by 4716
Abstract
In this paper we review the theoretical and practical principles of the broadcast approach to communication over state-dependent channels and networks in which the transmitters have access to only the probabilistic description of the time-varying states while remaining oblivious to their instantaneous realizations. [...] Read more.
In this paper we review the theoretical and practical principles of the broadcast approach to communication over state-dependent channels and networks in which the transmitters have access to only the probabilistic description of the time-varying states while remaining oblivious to their instantaneous realizations. When the temporal variations are frequent enough, an effective long-term strategy is adapting the transmission strategies to the system’s ergodic behavior. However, when the variations are infrequent, their temporal average can deviate significantly from the channel’s ergodic mode, rendering a lack of instantaneous performance guarantees. To circumvent a lack of short-term guarantees, the broadcast approach provides principles for designing transmission schemes that benefit from both short- and long-term performance guarantees. This paper provides an overview of how to apply the broadcast approach to various channels and network models under various operational constraints. Full article
(This article belongs to the Special Issue Multiuser Information Theory III)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-6
Back to TopTop