English
Related papers

Related papers: A novel soft-aided bit-marking decoder for product…

200 papers

Product codes (PCs) and staircase codes (SCCs) are conventionally decoded based on bounded distance decoding (BDD) of the component codes and iterating between row and column decoders. The performance of iterative BDD (iBDD) can be improved…

Information Theory · Computer Science 2021-09-08 Alireza Sheikh , Alexandre Graell i Amat , Alex Alvarado

In this work, we propose a new soft-input soft-output decoder called soft-output from covered space (SOCS) decoder. It estimates the a posteriori reliability based on the space explored by a list decoder, i.e., the set of vectors for which…

Information Theory · Computer Science 2025-07-21 Tim Janz , Simon Obermüller , Andreas Zunker , Stephan ten Brink

We introduce a novel universal soft-decision decoding algorithm for binary block codes called ordered reliability direct error pattern testing (ORDEPT). Our results, obtained for a variety of popular short high-rate codes, demonstrate that…

Information Theory · Computer Science 2023-10-19 Reza Hadavian , Xiaoting Huang , Dmitri Truhachev , Kamal El-Sankary , Hamid Ebrahimzad , Hossein Najafi

We propose a novel construction of product codes for high-density magnetic recording based on binary low-density parity check (LDPC) codes and binary image of Reed Solomon (RS) codes. Moreover, two novel algorithms are proposed to decode…

Information Theory · Computer Science 2012-01-06 Vo Tam Van , Seiichi Mita

The so-called improved soft-aided bit-marking algorithm was recently proposed for staircase codes (SCCs) in the context of fiber optical communications. This algorithm is known as iSABM-SCC. With the help of channel soft information, the…

Information Theory · Computer Science 2021-05-13 Yi Lei , Bin Chen , Gabriele Liga , Alex Alvarado

Modern applications are driving demand for ultra-reliable low-latency communications, rekindling interest in the performance of short, high-rate error correcting codes. To that end, here we introduce a soft-detection variant of Guessing…

Information Theory · Computer Science 2021-06-16 Ken R. Duffy

We introduce new reliability definitions for bit and check nodes. Maximizing global reliability, which is the sum reliability of all bit nodes, is shown to be equivalent to minimizing a decoding metric which is closely related to the…

Information Theory · Computer Science 2010-01-15 Chi-Yuan Chang , Yu T. Su , Yu-Liang Chen , Yin-Chen Liu

The typical model for measurement noise in quantum error correction is to randomly flip the binary measurement outcome. In experiments, measurements yield much richer information - e.g., continuous current values, discrete photon counts -…

Precoded polar product codes are proposed, where selected component codes enable successive cancellation list decoding to generate bit-wise soft messages efficiently for iterative decoding while targeting optimized distance spectrum as…

Information Theory · Computer Science 2024-02-13 Mustafa Cemil Coşkun

Quantum errors are primarily detected and corrected using the measurement of syndrome information which itself is an unreliable step in practical error correction implementations. Typically, such faulty or noisy syndrome measurements are…

Quantum Physics · Physics 2022-05-06 Nithin Raveendran , Narayanan Rengaswamy , Asit Kumar Pradhan , Bane Vasić

We establish that a large, flexible class of long, high redundancy error correcting codes can be efficiently and accurately decoded with guessing random additive noise decoding (GRAND). Performance evaluation demonstrates that it is…

Information Theory · Computer Science 2025-12-18 Peihong Yuan , Muriel Medard , Kevin Galligan , Ken R. Duffy

Hypergraph product codes are a class of constant-rate quantum low-density parity-check (LDPC) codes equipped with a linear-time decoder called small-set-flip (SSF). This decoder displays sub-optimal performance in practice and requires very…

Quantum Physics · Physics 2021-04-21 Antoine Grospellier , Lucien Grouès , Anirudh Krishna , Anthony Leverrier

We show that a simple modification of the surface code can exhibit an enormous gain in the error correction threshold for a noise model in which Pauli Z errors occur more frequently than X or Y errors. Such biased noise, where dephasing…

Quantum Physics · Physics 2018-02-07 David K. Tuckett , Stephen D. Bartlett , Steven T. Flammia

Product codes (PCs) protect a two-dimensional array of bits using short component codes. Assuming transmission over the binary symmetric channel, the decoding is commonly performed by iteratively applying bounded-distance decoding to the…

Information Theory · Computer Science 2017-11-22 Christian Häger , Henry D. Pfister

This paper presents a generalized construction of RS-SPC product codes. A low-complexity joint-decoding scheme is proposed for these codes, in which a BP-based iterative decoding is performed based on the binary expansion of the whole…

Information Theory · Computer Science 2021-12-21 Mingyang Zhu , Ming Jiang , Chunming Zhao

Multiple-input multiple-output (MIMO) systems have been widely acclaimed in order to provide high data rates. Recently Lattice Reduction (LR) aided detectors have been proposed to achieve near Maximum Likelihood (ML) performance with low…

Information Theory · Computer Science 2016-02-22 Mehnaz Rahman , Gwan S. Choi

Decoders that provide an estimate of the probability of a logical failure conditioned on the error syndrome ("soft-output decoders") can reduce the overhead cost of fault-tolerant quantum memory and computation. In this work, we construct…

Quantum Physics · Physics 2024-06-04 Nadine Meister , Christopher A. Pattison , John Preskill

V2X (Vehicle-to-everything) communication relies on short messages for short-range transmissions over a fading wireless channel, yet requires high reliability and low latency. Hard-decision decoding sacrifices the preservation of diversity…

Information Theory · Computer Science 2024-08-08 Praveen Sai Bere , Mohammed Zafar Ali Khan , Lajos Hanzo

Long, powerful soft detection forward error correction codes are typically constructed by concatenation of shorter component codes that are decoded through iterative Soft-Input Soft-Output (SISO) procedures. The current gold-standard is Low…

Information Theory · Computer Science 2024-12-19 Sarah Khalifeh , Ken R. Duffy , Muriel Medard

Recursive list decoding is considered for Reed-Muller (RM) codes. The algorithm repeatedly relegates itself to the shorter RM codes by recalculating the posterior probabilities of their symbols. Intermediate decodings are only performed…

Information Theory · Computer Science 2017-03-17 Ilya Dumer , Kirill Shabunov