English
Related papers

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

200 papers

Optical losses are the main obstacle to demonstrating a quantum advantage via boson sampling without leaving open the possibility of classical spoofing. We propose a method for generating low-depth optical circuits suitable for boson…

Quantum Physics · Physics 2021-10-12 R. van der Meer , S. Huber , P. W. H. Pinkse , R. García-Patrón , J. J. Renema

Shannon's analysis of the fundamental capacity limits for memoryless communication channels has been refined over time. In this paper, the maximum volume $M_\avg^*(n,\epsilon)$ of length-$n$ codes subject to an average decoding error…

Information Theory · Computer Science 2016-12-28 Pierre Moulin

In this work, lossy distributed compression of pairs of correlated sources is considered. Conventionally, Shannon's random coding arguments -- using randomly generated unstructured codebooks whose blocklength is taken to be asymptotically…

Information Theory · Computer Science 2020-10-21 Farhad Shirani , S. Sandeep Pradhan

We previously established that in principle, it is possible to quantum compute using passive linear optics with photo-detectors (quant-ph/0006088). Here we describe techniques based on error detection and correction that greatly improve the…

Quantum Physics · Physics 2007-05-23 E. Knill , R. Laflamme , G. Milburn

We study the problem of decoding classical information encoded on quantum states at the output of a quantum channel, with particular focus on increasing the communication rates towards the maximum allowed by Quantum Mechanics. After a brief…

Quantum Physics · Physics 2017-10-25 Matteo Rosati

The Learning Parity with Noise (LPN) problem underlines several classic cryptographic primitives. Researchers have attempted to demonstrate the algorithmic hardness of this problem by finding reductions from the decoding problem of linear…

Information Theory · Computer Science 2025-03-19 Madhura Pathegama , Alexander Barg

The problem of communicating over the additive white Gaussian noise (AWGN) channel with lattice codes is addressed in this paper. Theoretically, Voronoi constellations have proved to yield very powerful lattice codes when the fine/coding…

Information Theory · Computer Science 2017-08-03 Nicola di Pietro , Joseph J. Boutros

We propose constructive approaches for the optimization of binary classical communication over a general noisy qubit quantum channel, for both the error probability and the classical capacity functionals. After showing that the optimal…

Quantum Physics · Physics 2014-01-09 Nicola Dalla Pozza , Nicola Laurenti , Francesco Ticozzi

Quick response codes - 2D patterns that can be scanned to access online resources - are being used in a variety of industrial and consumer applications. However, it is problematic to use multiple QR codes in close proximity: scans can fail…

Computers and Society · Computer Science 2015-10-29 Mercan Topkara , Thomas Erickson , Umut Topkara , Chandrasekhar Narayanaswami

Integrated photonic technologies are rapidly becoming an important and fundamental milestone for wideband optical telecommunications. Future optical networks have several critical requirements, including low energy consumption, high…

Optical communication achieves high fanout and short delay advantageous for information integration in neural systems. Superconducting detectors enable signaling with single photons for maximal energy efficiency. We present designs of…

Neural and Evolutionary Computing · Computer Science 2018-11-14 Jeffrey M. Shainline , Sonia M. Buckley , Adam N. McCaughan , Jeff Chiles , Richard P. Mirin , Sae Woo Nam

We prove an upper bound on the Shannon capacity of a graph via a linear programming variation. We show that our bound can outperform both the Lov\'asz theta number and the Haemers minimum rank bound. As a by-product, we also obtain a new…

Information Theory · Computer Science 2018-09-07 Sihuang Hu , Itzhak Tamo , Ofer Shayevitz

Recently, semantic communications are envisioned as a key enabler of future 6G networks. Back to Shannon's information theory, the goal of communication has long been to guarantee the correct reception of transmitted messages irrespective…

Information Theory · Computer Science 2021-10-18 Mohamed Sana , Emilio Calvanese Strinati

In the era of big data, reducing the computational complexity of servers in data centers will be an important goal. We propose Low Complexity Secure Codes (LCSCs) that are specifically designed to provide information theoretic security in…

Information Theory · Computer Science 2018-04-09 Mohsen Karimzadeh Kiskani , Hamid R. Sadjadpour , Mohammad Reza Rahimi , Fred Etemadieh

The capacity of line networks with buffer size constraints is an open, but practically important problem. In this paper, the upper bound on the achievable rate of a class of codes, called batched codes, is studied for line networks. Batched…

Information Theory · Computer Science 2022-05-06 Shenghao Yang , Jie Wang

We consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter $p$ and (b) the process which adds the…

Information Theory · Computer Science 2013-03-01 Venkatesan Guruswami , Adam Smith

To lower the complexity of network codes over packet line networks with arbitrary schedules, chunked codes (CC) and overlapped chunked codes (OCC) were proposed in earlier works. These codes have been previously analyzed for relatively…

Information Theory · Computer Science 2011-06-01 Anoosheh Heidarzadeh , Amir H. Banihashemi

Similar to algorithms, which consume time and memory to run, hardware requires resources to function. For devices processing physical waves, implementing operations needs sufficient "space," as dictated by wave physics. How much space is…

Optics · Physics 2025-01-20 Yandong Li , Francesco Monticone

The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. Traditional information-theoretic analysis uses `waterfall'…

Information Theory · Computer Science 2008-01-03 Anant Sahai , Pulkit Grover

Whereas many results are known about thresholds for ensembles of low-density parity-check codes under message-passing iterative decoding, this is not the case for linear programming decoding. Towards closing this knowledge gap, this paper…

Information Theory · Computer Science 2007-07-16 Pascal O. Vontobel , Ralf Koetter