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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The polar transform of a binary erasure channel (BEC) can be exactly approximated by other BECs. Arikan proposed that polar codes for a BEC can be efficiently constructed by using its useful property. This study proposes a new class of arbitrary input generalized erasure channels, which can be exactly approximated the polar transform by other same channel models, as with the BEC. One of the main results is the recursive formulas of the polar transform of the proposed channel. In the study, we evaluate the polar transform by using the &#x03B1;-mutual information. Particularly, when the input alphabet size is a prime power, we examines the following: (i) inequalities for the average of the &#x03B1;-mutual information of the proposed channel after the one-step polar transform, and (ii) the exact proportion of polarizations of the &#x03B1;-mutual information of proposed channels in infinite number of polar transforms.

A generalized erasure channel in the sense of polarization for binary erasure channels