Abstract:We introduce successive cancellation (SC) decoding of product codes (PCs) with single parity-check (SPC) component codes. Recursive formulas are derived, which resemble the SC decoding algorithm of polar codes. We analyze the error probability of SPC-PCs over the binary erasure channel under SC decoding. A bridge with the analysis of PCs introduced by Elias in 1954 is also established. Furthermore, bounds on the block error probability under SC decoding are provided, and compared to the bounds under the original decoding algorithm proposed by Elias. It is shown that SC decoding of SPC-PCs achieves a lower block error probability than Elias\u27 decoding
A class of cyclic product codes capable of correcting multiple-burst errors is studied. A code of di...
Product codes are powerful codes that can be used to correct errors and/or recover erasures. Judging...
Abstract—As improved versions of successive cancellation (SC) decoding algorithm, successive cancell...
We introduce successive cancellation (SC) decoding of product codes (PCs) with single parity-check (...
A product code with single parity-check component codes can be described via the tools of a multi-ke...
Abstract: We introduce successive cancellation (SC) decoding of product codes (PCs) with single pari...
A product code with single parity-check component codes can be described via the tools of a multi-ke...
Product codes are powerful codes that can be used to correct errors or recover erasures. The simples...
Product codes are powerful codes that can be used to correct errors or recover erasures. The simples...
The aim of coding theory is to design codes which can achieve the fundamental limits of communicatio...
This letter proposes successive cancellation list (SCL) decoding of product codes with Reed–Muller (...
Product codes can be used to correct errors or recover erasures. In this work we consider the simple...
In this paper, a new decoding scheme for low-density parity-check (LDPC) codes using the concept of ...
Successive cancellation flip decoding requires a large number of extra successive cancellation decod...
A two-part successive syndrome-check decoding of polar codes is proposed with the first part success...
A class of cyclic product codes capable of correcting multiple-burst errors is studied. A code of di...
Product codes are powerful codes that can be used to correct errors and/or recover erasures. Judging...
Abstract—As improved versions of successive cancellation (SC) decoding algorithm, successive cancell...
We introduce successive cancellation (SC) decoding of product codes (PCs) with single parity-check (...
A product code with single parity-check component codes can be described via the tools of a multi-ke...
Abstract: We introduce successive cancellation (SC) decoding of product codes (PCs) with single pari...
A product code with single parity-check component codes can be described via the tools of a multi-ke...
Product codes are powerful codes that can be used to correct errors or recover erasures. The simples...
Product codes are powerful codes that can be used to correct errors or recover erasures. The simples...
The aim of coding theory is to design codes which can achieve the fundamental limits of communicatio...
This letter proposes successive cancellation list (SCL) decoding of product codes with Reed–Muller (...
Product codes can be used to correct errors or recover erasures. In this work we consider the simple...
In this paper, a new decoding scheme for low-density parity-check (LDPC) codes using the concept of ...
Successive cancellation flip decoding requires a large number of extra successive cancellation decod...
A two-part successive syndrome-check decoding of polar codes is proposed with the first part success...
A class of cyclic product codes capable of correcting multiple-burst errors is studied. A code of di...
Product codes are powerful codes that can be used to correct errors and/or recover erasures. Judging...
Abstract—As improved versions of successive cancellation (SC) decoding algorithm, successive cancell...