Error Correcting Code Techniques
427 papers on this topic
Boosted Neural Decoders: Achieving Extreme Reliability of LDPC Codes for 6G Networks
Ensuring extremely high reliability in channel coding is essential for 6G networks. The next-generation of ultra-reliable and low-latency communications (xURLLC) scenario within 6G networks...
Hybrid Mamba-Transformer Decoder for Error-Correcting Codes
We introduce a novel deep learning method for decoding error correction codes based on the Mamba architecture, enhanced with Transformer layers. Our approach proposes a hybrid decoder that...
Nested Construction of Polar Codes via Transformers
Tailoring polar code construction for decoding algorithms beyond successive cancellation has remained a topic of significant interest in the field. However, despite the inherent nested structure...
Row-Merged Polar Codes: Analysis, Design and Decoder Implementation
Row-merged polar codes are a family of pre-transformed polar codes (PTPCs) with little precoding overhead. Providing an improved distance spectrum over plain polar codes, they are capable to...
Rateless Joint Source-Channel Coding, and a Blueprint for 6G Semantic Communications System Design
This paper introduces rateless joint source-channel coding (rateless JSCC). The code is rateless in that it is designed and optimized for a continuum of coding rates such that it achieves a...
Relative hulls and quantum codes
Given two $q$-ary codes $C_1$ and $C_2$, the relative hull of $C_1$ with respect to $C_2$ is the intersection $C_1\cap C_2^\perp$. We prove that when $q>2$, the relative hull dimension can be...
Dependence Analysis and Structured Construction for Batched Sparse Code
In coding theory, codes are usually designed with a certain level of randomness to facilitate analysis and accommodate different channel conditions. However, the resulting random code constructed...
Design and Performance of Enhanced Spread Spectrum Aloha for Unsourced Multiple Access
We analyze the performance of enhanced spread spectrum Aloha (E-SSA) in the framework of unsourced multiple access (UMAC). The asynchronous, unframed transmission of E-SSA is modified to enable a...
Constituent automorphism decoding of Reed-Muller codes
Automorphism-ensemble decoding is applied to the Plotkin constituents of Reed-Muller codes, resulting in a new soft-decision decoding algorithm with state-of-the-art performance versus complexity...
Enhancing 5G Performance: Reducing Service Time and Research Directions for 6G Standards
This paper presents several methods for minimizing packet service time in networks using 5G and beyond. We propose leveraging network coding alongside Hybrid Automatic Repeat reQuest (HARQ) to...
Locally Testable Codes with constant rate, distance, and locality
A locally testable code (LTC) is an error-correcting code that has a property-tester. The tester reads $q$ bits that are randomly chosen, and rejects words with probability proportional to their...
New Construction of $q$-ary Codes Correcting a Burst of at most $t$ Deletions
In this paper, for any fixed positive integers $t$ and $q>2$, we construct $q$-ary codes correcting a burst of at most $t$ deletions with redundancy $\log n+8\log\log n+o(\log\log n)+γ_{q,t}$ bits...
Fast List Decoding of High-Rate Polar Codes
Due to the ability to provide superior error-correction performance, the successive cancellation list (SCL) algorithm is widely regarded as one of the most promising decoding algorithms for polar...
Universal Slepian-Wolf coding for individual sequences
We establish a coding theorem and a matching converse theorem for separate encodings and joint decoding of individual sequences using finite-state machines. The achievable rate region is...
Joint Device Detection, Channel Estimation, and Data Decoding with Collision Resolution for MIMO Massive Unsourced Random Access
In this paper, we investigate a joint device activity detection (DAD), channel estimation (CE), and data decoding (DD) algorithm for multiple-input multiple-output (MIMO) massive unsourced random...
Hybrid Automatic Repeat Request for Downlink Rate-Splitting Multiple Access
This work investigates the design of Hybrid Automatic Repeat Request (HARQ) strategies for downlink Rate-Splitting Multiple Access (RSMA). The existence of private and common stream as well as...
Removal of Small Weight Stopping Sets for Asynchronous Unsourced Multiple Access
In this paper, we analyze the formation of small stopping sets in joint factor graphs describing a frame-asynchronous two-user transmission. Furthermore, we propose an algorithm to completely...
Finite Blocklength Regime Performance of Downlink Large Scale Networks
Some emerging 5G and beyond use-cases impose stringent latency constraints, which necessitates a paradigm shift towards finite blocklength performance analysis. In contrast to Shannon...