A note on some inequalities used in channel polarization and polar coding
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:RYZ667DXrecord.jsonopen to challenge →
classification
cs.IT
math.IT
keywords
channelinequalitiespolarizationsomeusedbinary-inputcodingdiscrete
read the original abstract
We give a unified treatment of some inequalities that are used in the proofs of channel polarization theorems involving a binary-input discrete memoryless channel.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.