research
∙
07/10/2022
Accelerating Polarization via Alphabet Extension
Polarization is an unprecedented coding technique in that it not only ac...
share
research
∙
11/30/2020
Parity-Checked Strassen Algorithm
To multiply astronomic matrices using parallel workers subject to stragg...
research
∙
06/30/2020
Multilinear Algebra for Minimum Storage Regenerating Codes
An (n, k, d, α)-MSR (minimum storage regeneration) code is a set of n no...
research
∙
06/16/2020
Multilinear Algebra for Distributed Storage
An (n, k, d, α, β, M)-ERRC (exact-repair regenerating code) is a collect...
research
∙
12/22/2019
Johnson Graph Codes
We define a Johnson graph code as a subspace of labelings of the vertice...
research
∙
12/19/2019
Polar Codes' Simplicity, Random Codes' Durability
Over any discrete memoryless channel, we build codes such that: for one,...
research
∙
06/25/2019
Isometry-Dual Flags of AG Codes
Consider a complete flag {0} = C_0 < C_1 < ... < C_n = F^n of one-point ...
research
∙
05/30/2019
Log-logarithmic Time Pruned Polar Coding
A pruned variant of polar coding is proposed for binary erasure channels...
research
∙
12/19/2018
Polar-like Codes and Asymptotic Tradeoff among Block Length, Code Rate, and Error Probability
A general framework is proposed that includes polar codes over arbitrary...
research
∙
12/19/2018
Log-logarithmic Time Pruned Polar Coding on Binary Erasure Channels
A pruned variant of polar coding is reinvented for all binary erasure ch...
research
∙
06/06/2018
Polar Code Moderate Deviation: Recovering the Scaling Exponent
In 2008 Arikan proposed polar coding [arXiv:0807.3917] which we summariz...
research
∙
01/16/2018
