English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper investigates properties of polar codes that can be potentiallyuseful in real-world applications. We start with analyzing the performance offinite-length polar codes over the binary erasure channel (BEC), while assumingbelief propagation as the decoding method. We provide a stopping set analysisfor the factor graph of polar codes, where we find the size of the minimumstopping set. We also find the girth of the graph for polar codes. Our analysisalong with bit error rate (BER) simulations demonstrate that finite-lengthpolar codes show superior error floor performance compared to the conventionalcapacity-approaching coding techniques. In order to take advantage from thisproperty while avoiding the shortcomings of polar codes, we consider the ideaof combining polar codes with other coding schemes. We propose a polarcode-based concatenated scheme to be used in Optical Transport Networks (OTNs)as a potential real-world application. Comparing against conventionalconcatenation techniques for OTNs, we show that the proposed scheme outperformsthe existing methods by closing the gap to the capacity while avoiding errorfloor, and maintaining a low complexity at the same time.

On Finite-Length Performance of Polar Codes: Stopping Sets, Error Floor, and Concatenated Design