Pith. sign in

REVIEW

Optimal Puncturing of Polar Codes With a Fixed Information Set

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1903.06420 v1 pith:LD7KAAWP submitted 2019-03-15 cs.IT math.IT

classification cs.ITmath.IT
keywords puncturinginformationfixedoptimalpolarqualitycodesexisting
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

For a given polar code construction, the existing literature on puncturing for polar codes focuses in finding the optimal puncturing pattern, and then re-selecting the information set. This paper devotes itself to find the optimal puncturing pattern when the information set is fixed. Puncturing the coded bits corresponding to the worst quality bit channels, called the worst quality puncturing (WQP), is proposed, which is analyzed to minimize the bit channel quality loss at the punctured positions. Simulation results show that WQP outperforms the best existing puncturing schemes when the information set is fixed.

Discussion (0). Continue with ORCID to comment.

Pith tools