RECORD
On the Polarization Levels of Automorphic-Symmetric Channels
Information Theory · Submitted 13 Nov 2018
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim We show that the polarization levels of an automorphic-symmetric channel are determined by characteristic subgroups.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
It is known that if an Abelian group operation is used in an Ar{\i}kan-style construction, we have multilevel polarization where synthetic channels can approach intermediate channels that are neither almost perfect nor almost useless. An open problem in polarization theory is to determine the polarization levels of a given channel. In this paper, we discuss the polarization levels of a family of channels that we call automorphic-symmetric channels. We show that the polarization levels of an automorphic-symmetric channel are determined by characteristic subgroups. In particular, if the group that is used does not contain any non-trivial characteristic subgroup, we only have two-level polarization to almost perfect and almost useless channels.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | It is known that if an Abelian group operation is used in an Ar{\i}kan-style construction, we have multilevel polarization where synthetic channels can approach intermediate channels that are neither almost perfect nor almost useless. | background 1.00 | 0.04 | 0.03 | asserted 1.00 |
| s1 | An open problem in polarization theory is to determine the polarization levels of a given channel. | gap 0.94 | 0.03 | 0.02 | asserted 0.99 |
| s2 | In this paper, we discuss the polarization levels of a family of channels that we call automorphic-symmetric channels. | contribution 0.99 | 0.52 | 0.05 | asserted 0.78 |
| s3 | We show that the polarization levels of an automorphic-symmetric channel are determined by characteristic subgroups. | result 0.93 | 0.94 | 0.81 | asserted 1.00 |
| s4 | In particular, if the group that is used does not contain any non-trivial characteristic subgroup, we only have two-level polarization to almost perfect and almost useless channels. | result 0.98 | 0.88 | 0.30 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v2
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
It is known that if an Abelian group operation is used in an Ar{\i}kan-style construction, we have multilevel polarization where synthetic channels can approach intermediate channels that are neither almost perfect nor almost useless. An open problem in polarization theory is to determine the polarization levels of a given channel. In this paper, we discuss the polarization levels of a family of channels that we call automorphic-symmetric channels. We show that the polarization levels of an automorphic-symmetric channel are determined by characteristic subgroups. In particular, if the group that is used does not contain any non-trivial characteristic subgroup, we only have two-level polarization to almost perfect and almost useless channels.
Human review
How the literature uses it
1 arXiv paper cite this in 4 sentences
Papers citing it
Cites it as background 1 paper
-
While the Arıkan-style two-by-two polar transform is always defined on a group of order two [Groups of order two are unique up to isomorphism.] in the study of binary polar codes, note that it can be defined on several binary operations in the study of non-binary polar codes. Şaşoğlu [ref] considered it based on certain finite quasigroups; Mori–Tanaka [ref] on finite fields; Park–Barg [ref] on cyclic groups in which those orders are a power of two; Sahebi–Pradhan [ref] on finite abelian groups; Nasser–Telatar [ref] on finite quasigroups; Nasser–Telatar [ref] also on finite abelian groups; Nasser [ref] on more weaker finite algebras than quasigroups; Nasser [ref] also on finite, not necessarily abelian, groups; and the authors [ref] on finite cyclic groups.
Countably Infinite Multilevel Source Polarization for Non-Stationary Erasure Distributions · Binary Operation defining Polar Transform · 0.92
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.