Shortened Polar Codes

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

Title:	Shortened Polar Codes
Contributor(s):	Miloslavskaya, Vera (author)
Publication Date:	2015-09
Early Online Version:	2015-07-08
DOI:	10.1109/TIT.2015.2453312
Handle Link:	https://hdl.handle.net/1959.11/64594
Abstract:	An optimization algorithm for finding a shortening pattern and a set of frozen symbols for polar codes is proposed. The structure of polar codes is exploited to eliminate many equivalent shortening patterns, thus reducing the search space. A reduced-complexity suboptimal algorithm is proposed for finding shortening patterns for long polar codes. Shortened codes obtained with the proposed method are shown to outperform low-density parity-check (LDPC) codes.
Publication Type:	Journal Article
Source of Publication:	IEEE Transactions on Information Theory, 61(9), p. 4852-4865
Publisher:	Institute of Electrical and Electronics Engineers
Place of Publication:	United States of America
ISSN:	1557-9654 0018-9448
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

Show full item record

Check

Research UNE