Hsin-Po Wang

In 2008 Arikan proposed polar coding [arXiv:0807.3917] which we summarize as follows: (a) From the root channel $W$ synthesize recursively a series of channels $W_N^{(1)},\dotsc,W_ N^{(N)}$. (b) Select sophisticatedly a subset of synthetic channels indexed by $A$ and freeze the remaining synthetic channels. Expand

A general framework is proposed that includes polar codes over arbitrary channels with arbitrary kernels. Expand

A pruned variant of polar coding is proposed for binary erasure channels where the channel tree is pruned by closely looking at the Bhattacharyya parameters. Expand

An $(n, k, d, \alpha, \beta, M)$-ERRC (exact-repair regenerating code) is a collection of $n$ nodes used to store a file. Expand

Over any discrete memoryless channel, we build codes such that: for one, their block error probabilities and code rates scale like random codes'; and for two, their encoding and decoding complexities scale like polar codes'. Expand

To multiply astronomic matrices using parallel workers subject to straggling, we recommend interleaving checksums with fast matrix multiplication algorithms. Expand

A pruned variant of polar coding is reinvented for all binary erasure channels. Expand

An (n, k, d, α)-MSR (minimum storage regeneration) code is a set of n nodes used to store a file. Expand