Work

Polar Subcodes

Year: 2015

Type: article

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.

Source: IEEE Journal on Selected Areas in Communications

DOI: 10.1109/jsac.2015.2504269

Authors: Peter Trifonov, Vera Miloslavskaya

Institution: Peter the Great St. Petersburg Polytechnic University

Language: English

Topic: Error Correcting Code Techniques

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Russian Foundation for Basic Research

Award: G831936312