English
Related papers

Related papers: Capacity-Maximizing Input Symbol Selection for Dis…

200 papers

The problem of distributed testing against independence with variable-length coding is considered when the \emph{average} and not the \emph{maximum} communication load is constrained as in previous works. The paper characterizes the optimum…

Information Theory · Computer Science 2020-05-19 Sadaf Salehkalaibar , Michele Wigger

In this paper, we examine an input-constrained erasure channel and we characterize the asymptotics of its capacity when the erasure rate is low. More specifically, for a general memoryless erasure channel with its input supported on an…

Information Theory · Computer Science 2016-05-10 Yonglong Li , Guangyue Han

The cognitive interference channel with unidirectional destination cooperation (CIFC-UDC) is a variant of the cognitive interference channel (CIFC) where the cognitive (secondary) destination not only decodes the information sent from its…

Information Theory · Computer Science 2011-02-21 Hsuan-Yi Chu , Hsuan-Jung Su

In index coding, a server broadcasts multiple messages to their respective receivers, each with some side information that can be utilized to reduce the amount of communication from the server. Distributed index coding is an extension of…

Information Theory · Computer Science 2020-04-07 Yucheng Liu , Parastoo Sadeghi , Fatemeh Arbabjolfaei , Young-Han Kim

We study non-coherent detection schemes for molecular communication (MC) systems that do not require knowledge of the channel state information (CSI). In particular, we first derive the optimal maximum likelihood (ML) multiple-symbol (MS)…

Information Theory · Computer Science 2017-07-28 Vahid Jamali , Nariman Farsad , Robert Schober , Andrea Goldsmith

This paper studies the problem of linear precoding for multiple-input multiple-output (MIMO) communication channels employing finite-alphabet signaling. Existing solutions typically suffer from high computational complexity due to costly…

Information Theory · Computer Science 2021-11-08 Maksym A. Girnyk

We consider the problem of estimating the states of weakly coupled linear systems from sampled measurements. We assume that the total capacity available to the sensors to transmit their samples to a network manager in charge of the…

Systems and Control · Computer Science 2016-10-25 Xudong Chen , M. -A. Belabbas , Tamer Basar

This work identifies the fundamental limits of cache-aided coded multicasting in the presence of the well-known `worst-user' bottleneck. This stems from the presence of receiving users with uneven channel capacities, which often forces the…

Information Theory · Computer Science 2020-01-07 Eleftherios Lampiris , Jingjing Zhang , Osvaldo Simeone , Petros Elia

In this paper, we propose a constructive interference (CI)-based block-level precoding (CI-BLP) approach for the downlink of a multi-user multiple-input single-output (MU-MISO) communication system. Contrary to existing CI precoding…

Information Theory · Computer Science 2024-10-28 Ang Li , Chao Shen , Xuewen Liao , Christos Masouros , A. Lee Swindlehurst

An approach is established for maximizing the Lower bound on the Mismatch capacity (hereafter abbreviated as LM rate), a key performance bound in mismatched decoding, by optimizing the channel input probability distribution. Under a fixed…

Information Theory · Computer Science 2024-05-02 Lingyi Chen , Shitong Wu , Xinwei Li , Huihui Wu , Hao Wu , Wenyi Zhang

In many information-theoretic channel coding problems, adding an input cost constraint to the operational setup amounts to restricting the optimization domain in the capacity formula. This paper shows that, in contrast to common belief,…

Information Theory · Computer Science 2020-12-29 Sreejith Sreekumar , Alexander Bunin , Ziv Goldfeld , Haim H. Permuter , Shlomo Shamai

We construct a channel coding scheme to achieve the capacity of any discrete memoryless channel based solely on the techniques of polar coding. In particular, we show how source polarization and randomness extraction via polarization can be…

Information Theory · Computer Science 2016-01-22 David Sutter , Joseph M. Renes , Frédéric Dupuis , Renato Renner

We consider a peak-power-limited single-antenna block-stationary Gaussian fading channel where neither the transmitter nor the receiver knows the channel state information, but both know the channel statistics. This model subsumes most…

Information Theory · Computer Science 2016-11-17 Jun Chen , Venugopal V. Veeravalli

The reliability function of a channel is the maximum achievable exponential rate of decay of the error probability as a function of the transmission rate. In this work, we derive bounds on the reliability function of discrete memoryless…

Information Theory · Computer Science 2023-06-13 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

Universally achievable error exponents pertaining to certain families of channels (most notably, discrete memoryless channels (DMC's)), and various ensembles of random codes, are studied by combining the competitive minimax approach,…

Information Theory · Computer Science 2007-08-01 Yaniv Akirav , Neri Merhav

In extension of the bit commitment task and following work initiated by Crepeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discrete memoryless channel can be used for bit commitment. It…

Cryptography and Security · Computer Science 2007-05-23 Andreas Winter , Anderson C. A. Nascimento , Hideki Imai

Conventional multi-user multiple-input multiple-output (MU-MIMO) mainly focused on Gaussian signaling, independent and identically distributed (IID) channels, and a limited number of users. It will be laborious to cope with the…

Information Theory · Computer Science 2022-09-20 Yuhao Chi , Lei Liu , Guanghui Song , Ying Li , Yong Liang Guan , Chau Yuen

We establish the optimal input signaling and the capacity of MIMO channels under per-antenna power constraint. While admitting a linear eigenbeam structure, the optimal input is no longer diagonalizable by the channel right singular vectors…

Information Theory · Computer Science 2015-03-19 Mai Vu

We study channel simulation under common randomness assistance in the finite-blocklength regime and identify the smooth channel max-information as a linear program one-shot converse on the minimal simulation cost for fixed error tolerance.…

Information Theory · Computer Science 2024-10-10 Michael X. Cao , Navneeth Ramakrishnan , Mario Berta , Marco Tomamichel

Coded caching provides significant gains over conventional uncoded caching by creating multicasting opportunities among distinct requests. Massive multiple-input multiple-output (MIMO) systems require downlink channel state information…

Information Theory · Computer Science 2019-07-08 Qianqian Yang , Mahdi Boloursaz Mashhadi , Deniz Gündüz
‹ Prev 1 8 9 10 Next ›