English
Related papers

Related papers: Positive Rate Binary Interactive Error Correcting …

200 papers

We study the communication rate of coding schemes for interactive communication that transform any two-party interactive protocol into a protocol that is robust to noise. Recently, Haeupler (FOCS '14) showed that if an $\epsilon > 0$…

Information Theory · Computer Science 2016-05-31 Bernhard Haeupler , Ameya Velingker

Error correction codes (ECC) are crucial for ensuring reliable information transmission in communication systems. Choukroun & Wolf (2022b) recently introduced the Error Correction Code Transformer (ECCT), which has demonstrated promising…

Machine Learning · Computer Science 2024-10-10 Matan Levy , Yoni Choukroun , Lior Wolf

Superdense coding promises increased classical capacity and communication security but this advantage may be undermined by noise in the quantum channel. We present a numerical study of how forward error correction (FEC) applied to the…

Quantum Physics · Physics 2016-05-25 Ronald J. Sadlier , Travis S. Humble

In the setting of error-correcting codes with feedback, Alice wishes to communicate a $k$-bit message $x$ to Bob by sending a sequence of bits over a channel while noiselessly receiving feedback from Bob. It has been long known (Berlekamp,…

Information Theory · Computer Science 2022-12-14 Meghal Gupta , Venkatesan Guruswami , Rachel Yun Zhang

Function-Correcting Codes (FCCs) enable reliable computation of a function of a $k$-bit message over noisy channels without requiring full message recovery. In this work, we study optimal single-error correcting FCCs (SEFCCs) for…

Information Theory · Computer Science 2026-01-16 Rajlaxmi Pandey , Shiven Bajpai , Anjana A Mahesh , B. Sundar Rajan

Inefficient data transfer between computation and memory inspired emerging processing-in-memory (PIM) technologies. Many PIM solutions enable storage and processing using memristors in a crossbar-array structure, with techniques such as…

Hardware Architecture · Computer Science 2021-05-11 Orian Leitersdorf , Ben Perach , Ronny Ronen , Shahar Kvatinsky

The robustness of quantum memory against physical noises is measured by two methods: the exact and approximate quantum error correction (QEC) conditions for error recoverability, and the decoder-dependent error threshold which assesses if…

Quantum Physics · Physics 2025-01-15 Yuanchen Zhao , Dong E. Liu

We propose a novel adaptive and causal random linear network coding (AC-RLNC) algorithm with forward error correction (FEC) for a point-to-point communication channel with delayed feedback. AC-RLNC is adaptive to the channel condition, that…

Information Theory · Computer Science 2019-09-30 Alejandro Cohen , Derya Malak , Vered Bar Bracha , Muriel Medard

In this paper, we investigate the performance of a class of spatially coupled codes, namely partially information coupled turbo codes (PIC-TCs) over the binary erasure channel (BEC). This class of codes enjoy flexible code rate adjustment…

Information Theory · Computer Science 2019-06-18 Min Qiu , Xiaowei Wu , Yixuan Xie , Jinhong Yuan

Resistive memories are considered a promising memory technology enabling high storage densities with in-memory computing capabilities. However, the readout reliability of resistive memories is impaired due to the inevitable existence of…

Information Theory · Computer Science 2019-04-22 Marwen Zorgui , Mohammed E. Fouda , Zhiying Wang , Ahmed M. Eltawil , Fadi Kurdahi

When neural networks (NeuralNets) are implemented in hardware, their weights need to be stored in memory devices. As noise accumulates in the stored weights, the NeuralNet's performance will degrade. This paper studies how to use error…

Information Theory · Computer Science 2020-01-14 Kunping Huang , Paul Siegel , Anxiao , Jiang

A major obstacle towards realizing a practical quantum computer is the noise that arises due to system-environment interactions. While it is very well known that quantum error correction (QEC) provides a way to protect against errors that…

Quantum Physics · Physics 2023-02-24 Akshaya Jayashankar

Error exponents characterize the exponential decay, when increasing message length, of the probability of error of many error-correcting codes. To tackle the long standing problem of computing them exactly, we introduce a general,…

Disordered Systems and Neural Networks · Physics 2007-07-16 Thierry Mora , Olivier Rivoire

The growing demand for highly reliable communication systems drives the research and development of algorithms that identify and correct errors during data transmission and storage. This need becomes even more critical in hard-to-access or…

Cryptography and Security · Computer Science 2025-04-17 Andrew Rafael Fritsch , César Augusto Missio Marcon

This work constructs codes that are efficiently decodable from a constant fraction of \emph{worst-case} insertion and deletion errors in three parameter settings: (i) Binary codes with rate approaching 1; (ii) Codes with constant rate for…

Information Theory · Computer Science 2016-05-17 Venkatesan Guruswami , Ray Li

In this paper, we present new achievability bounds on the maximal achievable rate of variable-length stop-feedback (VLSF) codes operating over a binary erasure channel (BEC) at a fixed message size $M = 2^k$. We provide new bounds for VLSF…

Information Theory · Computer Science 2023-07-31 Hengjie Yang , Richard D. Wesel

Realizing the full potential of quantum computation requires quantum error correction (QEC), with most recent breakthrough demonstrations of QEC using the surface code. QEC codes use multiple noisy physical qubits to encode information in…

Quantum error correction (QEC) is essential for achieving fault-tolerant quantum computing. While superconducting qubits are among the most promising candidates for scalable QEC, their limited nearest-neighbor connectivity presents…

In this paper we study function-correcting codes, a new class of codes designed to protect the function evaluation of a message against errors. We show that FCCs are equivalent to irregular-distance codes, i.e., codes that obey some given…

Information Theory · Computer Science 2023-05-24 Andreas Lenz , Rawad Bitar , Antonia Wachter-Zeh , Eitan Yaakobi

Any interactive protocol between a pair of parties can be reliably simulated in the presence of noise with a multiplicative overhead on the number of rounds (Schulman 1996). The reciprocal of the best (least) overhead is called the…

Information Theory · Computer Science 2024-04-19 Mudit Aggarwal , Manuj Mukherjee