The most successful method to obtain lower bounds for the minimum distance of an algebraic geometric code is the order bound, which generalizes the Feng-Rao bound.Expand

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

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