Performance Limits and Practical Decoding of Interleaved Reed-Solomon Polar Concatenated Codes

A scheme for concatenating the recently invented polar codes with non-binary MDS codes, as Reed-Solomon codes, is considered. By concatenating binary polar codes with interleaved Reed-Solomon codes, we prove that the proposed concatenation scheme captures the capacity-achieving property of polar cod...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on communications Vol. 62; no. 5; pp. 1406 - 1417
Main Authors:	Mahdavifar, Hessam, El-Khamy, Mostafa, Jungwon Lee, Inyup Kang
Format:	Journal Article
Language:	English
Published:	New York, NY IEEE 01.05.2014 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Applied sciences Block codes burst erasures Bursts capacity-achieving codes Channels Codes Coding, codes Complexity theory Concatenated codes Decoding Error analysis error exponent Error probability Errors Exact sciences and technology Frames generalized minimum distance Gilbert-Elliot Information, signal and communications theory Mathematical analysis Polar codes Reed-Solomon codes Signal and communications theory Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) Reed Solomon code Performance evaluation Error probability generalized minimum distance Error estimation capacity-achieving codes Error rate Transmission channel Concatenated codes Decoding Algorithm Binary code Failures Polar codes burst erasures Reed-Solomon codes Gilbert-Elliot Concatenation Sufficient condition error exponent Algorithm complexity Interleaved codes Minimal distance Polar code
ISSN:	0090-6778, 1558-0857
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!