English
Related papers

Related papers: One-Cold Poisson Channel: A Simple Continuous-Time…

200 papers

We consider a basic joint communication and sensing setup comprising a transmitter, a receiver and a sensor. The transmitter sends a codeword to the receiver through a discrete memoryless channel, and the receiver is interested in decoding…

Information Theory · Computer Science 2024-12-09 Han Wu , Hamdi Joudeh

The Gaussian broadcast channel (GBC) with $K$ transmit antennas and $K$ single-antenna users is considered for the case in which the channel state information is obtained at the transmitter via a finite-rate feedback link of capacity $r$…

Information Theory · Computer Science 2010-02-18 Chinmay S. Vaze , Mahesh K. Varanasi

This paper investigates the design of the capacity-achieving input distribution for the discrete-time Poisson channel (DTPC) under dark current effects with low-precision analog-to-digital converters (ADCs). This study introduces an…

Signal Processing · Electrical Eng. & Systems 2025-09-23 Qianqian Li , Lintao Li , Lixiang Liu , Lei Yang , Caihong Gong , Hua Li , Shiya Hao , Xiaoming Dai

Compressed sensing (sparse signal recovery) has been a popular and important research topic in recent years. By observing that natural signals are often nonnegative, we propose a new framework for nonnegative signal recovery using…

Methodology · Statistics 2013-10-04 Ping Li , Cun-Hui Zhang , Tong Zhang

Cryptographic algorithms rely on the secrecy of their corresponding keys. On embedded systems with standard CMOS chips, where secure permanent memory such as flash is not available as a key storage, the secret key can be derived from…

In this paper, we propose a polar coding scheme for secure communication over the multiple-input, single-output, single-antenna eavesdropper (MISOSE) fading channel. We consider the case of block fading channels with known eavesdropper…

Information Theory · Computer Science 2014-11-11 Mengfan Zheng , Meixia Tao , Wen Chen

Communicating information at the few photon level typically requires some complexity in the transmitter or receiver in order to operate in the presence of noise. This in turn incurs expense in the necessary spatial volume and power…

This paper provides a statistical characterization of the individual achievable rates in bits/s/Hz and the spatial throughput of bipolar Poisson wireless networks in bits/s/Hz/m$^2$. We assume that all transmitters have a cognitive ability…

Information Theory · Computer Science 2014-04-29 Pedro H. J. Nardelli , Carlos H. Morais de Lima , Hirley Alves , Paulo Cardieri , Matti Latva-aho

Phaseless diffraction measurements recorded by a CCD detector are often affected by Poisson noise. In this paper, we propose a dictionary learning model by employing patches based sparsity to denoise Poisson phaseless measurement. The model…

Optimization and Control · Mathematics 2019-06-10 Huibin Chang , Stefano Marchesini

In practical communication systems, knowledge of channel models is often absent, and consequently, transceivers need be designed based on empirical data. In this work, we study data-driven approaches to reliably choosing decoding metrics…

Information Theory · Computer Science 2024-04-23 Jiakun Liu , Wenyi Zhang , H. Vincent Poor

Noisy channels are a valuable resource from a cryptographic point of view. They can be used for exchanging secret-keys as well as realizing other cryptographic primitives such as commitment and oblivious transfer. To be really useful, noisy…

Cryptography and Security · Computer Science 2019-05-28 Claude Crépeau , Rafael Dowsley , Anderson C. A. Nascimento

We propose two types of universal codes that are suited to two asymptotic regimes when the output alphabet is possibly continuous. The first class has the property that the error probability decays exponentially fast and we identify an…

Information Theory · Computer Science 2024-09-10 Masahito Hayashi

The fading broadcast channel with confidential messages (BCC) is investigated, where a source node has common information for two receivers (receivers 1 and 2), and has confidential information intended only for receiver 1. The confidential…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , H. Vincent Poor , Shlomo Shamai

A memoryless state-dependent broadcast channel (BC) is considered, where the transmitter wishes to convey two private messages to two receivers while simultaneously estimating the respective states via generalized feedback. The model at…

Information Theory · Computer Science 2020-11-09 Mehrasa Ahmadipour , Michèle Wigger , Mari Kobayashi

We will investigate practical aspects for a recently introduced blind (noncoherent) communication scheme, called modulation on conjugate-reciprocal zeros (MOCZ), which enables reliable transmission of sporadic and short-packets at ultra-low…

Information Theory · Computer Science 2019-02-11 Philipp Walk , Peter Jung , Babak Hassibi , Hamid Jafarkhani

In this paper, we design the first computationally efficient codes for simultaneously reliable and covert communication over Binary Symmetric Channels (BSCs). Our setting is as follows: a transmitter Alice wishes to potentially reliably…

Information Theory · Computer Science 2018-06-12 Qiaosheng Zhang , Mayank Bakshi , Sidharth Jaggi

Numerous applications in the field of molecular communications (MC) such as healthcare systems are often event-driven. The conventional Shannon capacity may not be the appropriate metric for assessing performance in such cases. We propose…

Information Theory · Computer Science 2024-01-30 Wafa Labidi , Christian Deppe , Holger Boche

Power line communications (PLC) is the central communications technology for the realization of smart power grids. As the designated band for smart grid communications is the narrowband (NB) power line channel, NB-PLC has been receiving…

Information Theory · Computer Science 2015-07-14 Nir Shlezinger , Ron Dabora

A rateless code encodes a finite length information word into an infinitely long codeword such that longer prefixes of the codeword can tolerate a larger fraction of errors. A rateless code achieves capacity for a family of channels if, for…

Information Theory · Computer Science 2014-06-03 Benny Applebaum , Liron David , Guy Even

We demonstrate superadditivity of one-shot zero-error classical capacity in an asymmetric communication setting where a noisy classical channel is used in parallel with a perfect quantum channel. Each channel individually supports only a…

Quantum Physics · Physics 2026-02-10 Ambuj , Anushko Chattopadhyay , Kunika Agarwal , Rakesh Das , Amit Mukherjee