Successive cancellation permutation decoding of Reed-Solomon codes

Trifonov, Peter

doi:10.1109/itw.2014.6970859

2014 IEEE Information Theory Workshop (ITW 2014) 2014

DOI: 10.1109/itw.2014.6970859

|View full text |Cite

Successive cancellation permutation decoding of Reed-Solomon codes

Peter Trifonov

Abstract: A novel soft-decision decoding algorithm for ReedSolomon codes over F2m is considered. The proposed approach is based on their representation as Arikan polar codes with dynamic frozen symbols and application of the sequential successive cancellation decoding algorithm. Furthermore, permutation techniques are utilized in order to reduce the decoding complexity.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2016

2023

Publication Types

Select...

Article2

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Polar Subcodes

Trifonov

Miloslavskaya

2016

IEEE J. Select. Areas Commun.

Self Cite

121

View full text Add to dashboard Cite

. AbstractAn extension of polar codes is proposed, which allows some of the frozen symbols, called dynamic frozen symbols, to be data-dependent. A construction of polar codes with dynamic frozen symbols, being subcodes of extended BCH codes, is proposed. The proposed codes have higher minimum distance than classical polar codes, but still can be efficiently decoded using the successive cancellation algorithm and its extensions. The codes with Arikan, extended BCH and Reed-Solomon kernel are considered. The proposed codes are shown to outperform LDPC and turbo codes, as well as polar codes with CRC.

show abstract

Polar Subcodes

Trifonov

Miloslavskaya

2016

IEEE J. Select. Areas Commun.

Self Cite

121

View full text Add to dashboard Cite

show abstract

Design and decoding of polar codes with large kernels: a survey

Trifonov

2023

Problemy peredači informacii

View full text Add to dashboard Cite

We present techniques for the construction of polar codes with large kernels and their decoding. A crucial problem in the implementation of the successive cancellation decoding algorithm and its derivatives is kernel processing, i.e., fast evaluation of the log-likelihood ratios for kernel input symbols. We discuss window and recursive trellis processing methods. We consider techniques for evaluation of the reliability of bit subchannels and for obtaining codes with improved distance properties.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Successive cancellation permutation decoding of Reed-Solomon codes

Cited by 2 publications

References 12 publications

Polar Subcodes

Polar Subcodes

Design and decoding of polar codes with large kernels: a survey

Contact Info

Product

Resources

About