Abstract: This letter proposes an efficient method to reduce path splits in the successive cancellation list (SCL) decoding. We construct the boundary consisting of ...
Abstract: In this letter, we propose a low-complexity universal decoder for product codes based on guessing codeword decoding (GCD). Recognizing that errors typically concentrate at the intersections ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback