research
∙
03/18/2023
MSR codes with linear field size and smallest sub-packetization for any number of helper nodes
The sub-packetization â„“ and the field size q are of paramount importance...
share
research
∙
09/06/2022
ABS+ Polar Codes: Exploiting More Linear Transforms on Adjacent Bits
ABS polar codes were recently proposed to speed up polarization by swapp...
research
∙
08/08/2022
Constructing MSR codes with subpacketization 2^n/3 for k+1 helper nodes
Wang et al. (IEEE Transactions on Information Theory, vol. 62, no. 8, 20...
research
∙
03/27/2022
All the codeword bits in polar codes have the same BER under the SC decoder
We prove that for any binary-input memoryless symmetric (BMS) channel, a...
research
∙
02/09/2022
Adjacent-Bits-Swapped Polar codes: A new code construction to speed up polarization
The construction of polar codes with code length n=2^m involves m layers...
research
∙
11/04/2021
A Dynamic Programming Method to Construct Polar Codes with Improved Performance
In the standard polar code construction, the message vector (U_0,U_1,…,U...
research
∙
06/15/2021
Improving the List Decoding Version of the Cyclically Equivariant Neural Decoder
The cyclically equivariant neural decoder was recently proposed in [Chen...
research
∙
05/12/2021
Cyclically Equivariant Neural Decoders for Cyclic Codes
Neural decoders were introduced as a generalization of the classic Belie...
research
∙
04/13/2020
Exact recovery and sharp thresholds of Stochastic Ising Block Model
The stochastic block model (SBM) is a random graph model in which the ed...
research
∙
02/09/2020
Reed-Muller Codes: Theory and Algorithms
Reed-Muller (RM) codes are among the oldest, simplest and perhaps most u...
research
∙
01/20/2020
Enabling optimal access and error correction for the repair of Reed-Solomon codes
Recently Reed-Solomon (RS) codes were shown to possess a repair scheme t...
research
∙
11/28/2019
New constructions of cooperative MSR codes: Reducing node size to (O(n))
We consider the problem of multiple-node repair in distributed storage s...
research
∙
11/10/2019
Arıkan meets Shannon: Polar codes with near-optimal convergence to channel capacity
Let W be a binary-input memoryless symmetric (BMS) channel with Shannon ...
research
∙
02/04/2019
Recursive projection-aggregation decoding of Reed-Muller codes
We propose a new class of efficient decoding algorithms for Reed-Muller ...
research
∙
01/31/2019
Reed-Muller codes polarize
Reed-Muller (RM) codes and polar codes are generated by the same matrix ...
research
∙
10/16/2018
Optimal locally private estimation under â„“_p loss for 1< p< 2
We consider the minimax estimation problem of a discrete distribution wi...
research
∙
05/04/2018
The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures, asymptotically optimal node size
The repair problem in distributed storage addresses recovery of the data...
research
∙
02/09/2018
Communication-Computation Efficient Gradient Coding
This paper develops coding techniques to reduce the running time of dist...
research
∙
01/29/2018
