Papers
Topics
Authors
Recent
Search
2000 character limit reached

Successive Cancellation List Decoding of Product Codes with Reed-Muller Component Codes

Published 27 Aug 2019 in cs.IT and math.IT | (1908.10397v1)

Abstract: This letter proposes successive cancellation list (SCL) decoding of product codes with Reed--Muller (RM) component codes. SCL decoding relies on a product code description based on the $2\times 2$ Hadamard kernel, which enables interpreting the code as an RM subcode. The focus is on a class of product codes considered in wireless communication systems, based on single parity-check and extended Hamming component codes. For short product codes, it is shown that SCL decoding with a moderate list size performs as well as (and, sometimes, outperforms) belief propagation (BP) decoding. Furthermore, by concatenating a short product code with a high-rate outer code, SCL decoding outperforms BP decoding by up to $1.4$ dB.

Citations (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.