Error Correcting Code Techniques
427 papers on this topic
Construction Methods Based on Minimum Weight Distribution for Polar Codes with Successive Cancellation List Decoding
Minimum weight distribution (MWD) is an important metric to calculate the first term of union bound called minimum weight union bound (MWUB). In this paper, we first prove the maximum likelihood...
New Partial Orders of Polar Codes for BMSC
In this paper, we define partial orders (POs) of polar codes based on the Bhattacharyya parameter and the bit-error probability, respectively. These POs are applicable to arbitrary binary...
State-Dependent Channels with a Message-Cognizant Helper
The capacity of a state-dependent discrete memoryless channel (SD-DMC) is derived for the setting where a message-cognizant rate-limited helper observes the state sequence noncausally, produces...
Robust Non-Linear Feedback Coding via Power-Constrained Deep Learning
The design of codes for feedback-enabled communications has been a long-standing open problem. Recent research on non-linear, deep learning-based coding schemes have demonstrated significant...
Every Bit Counts: A New Version of Non-binary VT Codes with More Efficient Encoder
In this work, we present a new version of non-binary VT codes that are capable of correcting a single deletion or single insertion. Moreover, we provide the first known linear time algorithms that...
Efficient Algorithms for the Bee-Identification Problem
The bee-identification problem, formally defined by Tandon, Tan and Varshney (2019), requires the receiver to identify "bees" using a set of unordered noisy measurements. In this previous work,...
Learning on JPEG-LDPC Compressed Images: Classifying with Syndromes
In goal-oriented communications, the objective of the receiver is often to apply a Deep-Learning model, rather than reconstructing the original data. In this context, direct learning over...
Using a Single-Parity-Check to Reduce the Guesswork of Guessing Codeword Decoding
Guessing Codeword Decoding (GCD) is a recently proposed soft-input forward error correction decoder for arbitrary binary linear codes. Inspired by recent proposals that leverage binary linear...
Linear Codes for Hyperdimensional Computing
Hyperdimensional Computing (HDC) is an emerging computational paradigm for representing compositional information as high-dimensional vectors, and has a promising potential in applications ranging...
Higher-Order MDS Codes
An improved Singleton-type upper bound is presented for the list decoding radius of linear codes, in terms of the code parameters [n,k,d] and the list size L. L-MDS codes are then defined as codes...
A Scalable, Fast and Programmable Neural Decoder for Fault-Tolerant Quantum Computation Using Surface Codes
Quantum error-correcting codes (QECCs) can eliminate the negative effects of quantum noise, the major obstacle to the execution of quantum algorithms. However, realizing practical quantum error...
Cooperative Channel Capacity Learning
In this paper, the problem of determining the capacity of a communication channel is formulated as a cooperative game, between a generator and a discriminator, that is solved via deep learning...
Probabilistic Shaping for Asymmetric Channels and Low-Density Parity-Check Codes
An algorithm is proposed to encode low-density parity-check (LDPC) codes into codewords with a non-uniform distribution. This enables power-efficient signalling for asymmetric channels. We show...
PAC Learnability for Reliable Communication over Discrete Memoryless Channels
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...
BiSPARCs for Unsourced Random Access in Massive MIMO
This paper considers the massive MIMO unsourced random access problem in a quasi-static Rayleigh fading setting. The proposed coding scheme is based on a concatenation of a "conventional" channel...
Binary codes from subset inclusion matrices
In this paper, we study the minimum distances of binary linear codes with parity check matrices formed from subset inclusion matrices $W_{t,n,k}$, representing $t$-element subsets versus...
Variable-Length Codes with Bursty Feedback
We study variable-length codes for point-to-point discrete memoryless channels with noiseless unlimited-rate feedback that occurs in $L$ bursts. We term such codes variable-length bursty-feedback...
A Novel Implementation Methodology for Error Correction Codes on a Neuromorphic Architecture
The Internet of Things infrastructure connects a massive number of edge devices with an increasing demand for intelligent sensing and inferencing capability. Such data-sensitive functions...