Successive Cancellation Ordered Search Decoding of Modified $\boldsymbol{G}_N$-Coset Codes
Peihong Yuan, Mustafa Cemil Co\c{s}kun

TL;DR
This paper introduces SCOS, a tree search decoding algorithm for $oldsymbol{G}_N$-coset codes that achieves near-ML performance with adaptive complexity, outperforming existing decoders and enabling strong error detection without outer codes.
Contribution
The paper proposes SCOS, a novel decoding algorithm for $oldsymbol{G}_N$-coset codes that combines ML performance with adaptive complexity and eliminates the need for outer codes.
Findings
SCOS achieves near-ML decoding performance within 0.25 dB of the RCU bound.
SCOS outperforms Reed--Muller codes under ML decoding by up to 0.5 dB.
Modified SCOS provides strong error detection and outperforms CRC-aided polar codes at high SNR.
Abstract
A tree search algorithm called successive cancellation ordered search (SCOS) is proposed for -coset codes that implements maximum-likelihood (ML) decoding with adaptive complexity for transmission over binary-input AWGN channels. Unlike bit-flip decoders, no outer code is needed to terminate decoding; therefore, SCOS also applies to -coset codes modified with dynamic frozen bits. The average complexity is close to that of successive cancellation (SC) decoding at practical frame error rates (FERs) for codes with wide ranges of rate and lengths up to bits, which perform within dB or less from the random coding union bound and outperform Reed--Muller codes under ML decoding by up to dB. Simulations illustrate simultaneous gains for SCOS over SC-Fano, SC stack (SCS) and SC list (SCL) decoding in FER and the average complexity at various…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cellular Automata and Applications · graph theory and CDMA systems
