Polar Subcodes

Please use this identifier to cite or link to this item: https://hdl.handle.net/1959.11/64593

Title:	Polar Subcodes
Contributor(s):	Trifonov, Peter (author); Miloslavskaya, Vera (author)
Publication Date:	2016-02
Early Online Version:	2015-11-26
DOI:	10.1109/JSAC.2015.2504269
Handle Link:	https://hdl.handle.net/1959.11/64593
Abstract:	An 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.
Publication Type:	Journal Article
Source of Publication:	IEEE Journal on Selected Areas in Communications, 34(2), p. 254-266
Publisher:	Institute of Electrical and Electronics Engineers
Place of Publication:	United States of America
ISSN:	1558-0008 0733-8716
Fields of Research (FoR) 2020:	4601 Applied computing
Peer Reviewed:	Yes
HERDC Category Description:	C1 Refereed Article in a Scholarly Journal
Appears in Collections:	Journal Article School of Science and Technology

1 files

File	Size	Format

Show full item record

Check

Research UNE