We gather existing methods that are used to compare and rank the BECs
sy...
Constructing a polar code is all about selecting a subset of rows from a...
1 - (1-x^M) ^ 2^M > (1 - (1-x)^M) ^2^M is proved for all x ∈ [0,1]
and a...
Polarization is an unprecedented coding technique in that it not only
ac...
Polar code visibly approaches channel capacity in practice and is thereb...
Polymerase chain reaction (PCR) testing is the gold standard for diagnos...
The performance of an error correcting code is evaluated by its error
pr...
To multiply astronomic matrices using parallel workers subject to stragg...
An (n, k, d, α)-MSR (minimum storage regeneration) code is a set of
n no...
An (n, k, d, α, β, M)-ERRC (exact-repair regenerating code) is a
collect...
Over any discrete memoryless channel, we build codes such that: for one,...
A pruned variant of polar coding is proposed for binary erasure channels...
A general framework is proposed that includes polar codes over arbitrary...
A pruned variant of polar coding is reinvented for all binary erasure
ch...
In 2008 Arikan proposed polar coding [arXiv:0807.3917] which we summariz...