English
Related papers

Related papers: Coding for Optical Communications -- Can We Approa…

200 papers

The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem that is gaining relevance thanks to emerging applications in wireless communication networks. In this paper, we…

Information Theory · Computer Science 2019-03-12 Mustafa Cemil Coşkun , Giuseppe Durisi , Thomas Jerkovits , Gianluigi Liva , William Ryan , Brian Stein , Fabian Steiner

Recently, a new class of error-control codes, the polar codes, have attracted much attention. The polar codes are the first known class of capacity-achieving codes for many important communication channels. In addition, polar codes have…

Information Theory · Computer Science 2012-11-19 Xudong Ma

The achievable information rates of optical communication networks have been widely increased over the past four decades with the introduction and development of optical amplifiers, coherent detection, advanced modulation formats, and…

Information Theory · Computer Science 2017-05-16 Tianhua Xu

The information capacity of an optical channel under power constraints is ultimately limited by the quantum nature of transmitted signals. We discuss currently available and emerging photonic technologies whose combination can be shown…

Quantum Physics · Physics 2020-05-18 Konrad Banaszek , Ludwig Kunz , Marcin Jarzyna , Michał Jachura

Shannon's secrecy system is studied in a setting, where both the legitimate decoder and the wiretapper have access to side information sequences correlated to the source, but the wiretapper receives both the coded information and the side…

Information Theory · Computer Science 2007-07-13 Neri Merhav

In the past few years, the demand for high data rate services has increased dramatically. The congestion in the radio frequency (RF) spectrum (3 kHz ~ 300 GHz) is expected to limit the growth of future wireless systems unless new parts of…

Signal Processing · Electrical Eng. & Systems 2019-01-01 Osama Alsulami , Ahmed Taha Hussein , Mohammed T. Alresheedi , Jaafar M. H. Elmirghani

In "On Coding for Reliable Communication over Packet Networks" (Lun, Medard, and Effros, Proc. 42nd Annu. Allerton Conf. Communication, Control, and Computing, 2004), a capacity-achieving coding scheme for unicast or multicast over lossy…

Information Theory · Computer Science 2007-07-16 Desmond S. Lun , Muriel Medard , Ralf Koetter , Michelle Effros

We consider the Shannon cipher system in a setting where the secret key is delivered to the legitimate receiver via a channel with limited capacity. For this setting, we characterize the achievable region in the space of three figures of…

Information Theory · Computer Science 2007-07-13 Neri Merhav

We consider the communication complexity of some fundamental convex optimization problems in the point-to-point (coordinator) and blackboard communication models. We strengthen known bounds for approximately solving linear regression,…

Data Structures and Algorithms · Computer Science 2024-03-29 Mehrdad Ghadiri , Yin Tat Lee , Swati Padmanabhan , William Swartworth , David Woodruff , Guanghao Ye

An upper limit is given to the amount of quantum information that can be transmitted reliably down a noisy, decoherent quantum channel. A class of quantum error-correcting codes is presented that allow the information transmitted to attain…

Quantum Physics · Physics 2009-10-30 Seth Lloyd

The zero-error capacity of channels with a countably infinite input alphabet formally generalises Shannon's classical problem about the capacity of discrete memoryless channels. We solve the problem for three particular channels. Our…

Combinatorics · Mathematics 2018-07-17 Gerard Cohen , Emanuela Fachini , Janos Korner

It is shown that polar coding schemes achieve the known achievable rate regions for several multi-terminal communications problems including lossy distributed source coding, multiple access channels and multiple descriptions coding. The…

Information Theory · Computer Science 2014-04-29 Aria G. Sahebi , S. Sandeep Pradhan

It is known that the Shannon capacity of the q-ary symmetric channel (qSC) is the same as the list-decoding capacity of an adversarial channel, raising the question of whether there is a formal (and black-box) connection between the two. We…

Information Theory · Computer Science 2024-10-29 Francisco Pernice , Oscar Sprumont , Mary Wootters

Detectability of failures of linear programming (LP) decoding and its potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting the constraints for the LP problem. In this paper, we make a…

Information Theory · Computer Science 2007-07-13 Mohammad H. Taghavi N. , Paul H. Siegel

When transmitting information over a noisy channel, two approaches, dating back to Shannon's work, are common: assuming the channel errors are independent of the transmitted content and devising an error-correcting code, or assuming the…

Information Theory · Computer Science 2015-01-22 Ohad Elishco , Tom Meyerovitch , Moshe Schwartz

The work establishes fundamental limits with respect to rate, reliability and computational complexity, for a general setting of outage-limited MIMO communications. In the high-SNR regime, the limits are optimized over all encoders, all…

Information Theory · Computer Science 2010-06-24 Petros Elia , Joakim Jalden

Future wireless communications systems are expected to operate at bands above 100GHz. The high energy consumption of analog-to-digital converters, due to their high resolution represents a bottleneck for future wireless communications…

Information Theory · Computer Science 2025-02-25 D. Melo , L. Landau , R. de Lamare

Scalable quantum computation with linear optics was considered to be impossible due to the lack of efficient two-qubit logic gates, despite its ease of implementation of one-qubit gates. Two-qubit gates necessarily need a nonlinear…

Quantum Physics · Physics 2007-05-23 Jonathan P. Dowling , James D. Franson , Hwang Lee , Gerald J. Milburn

While there are continuous efforts to introduce new communication systems and standards, it is legitimate to ask the question: how can one send additional bits by minimally changing the systems that are already operating? This is of a…

Information Theory · Computer Science 2012-02-03 Petar Popovski , Zoran Utkovski

We investigate weakly constrained codes, in which specific patterns occur with prescribed frequencies rather than being strictly forbidden as in conventional constrained coding. We propose a capacity-achieving construction of a weakly…

Information Theory · Computer Science 2026-05-22 Prachi Mishra , Sidharth Jaggi , Navin Kashyap , Michael Langberg