Multilevel expander codes
Alexander Barg, Gilles Zemor
Abstract
We define multilevel codes on bipartite graphs that have properties analogous to multilevel serial concatenations. A decoding algorithm is described that corrects a proportion of errors equal to half the Blokh-Zyablov bound on the minimum distance. The error probability of this algorithm has exponent similar to that of serially concatenated multilevel codes.
Create a lesson
Related papers
Binary Cyclic Gradient Coding: Exact Recovery and Robustness to Compression
Hassan Ou-azzou, Imad Kissami, El Houcine Bergou
Nonlinear fixed-distance codes via real lifts of moment configurations
Sergey Yekhanin
Global and Local Entropy Tests for STL Files Under IEEE-754 Validity Constraints
Tonislav Troev, Borislav Stoyanov
Joint Identification, Transmission, and Sensing over State-Dependent Channels with Noiseless Feedback
Vida Gholamian, Marcel A. Mross, Roberto Ferrara et al.
Capacity Bounds for Optical Interference Channels Subject to Average Power Constraints
Viswanathan Ramachandran
Efficient construction of subspace design codes over constant alphabet
Shu Liu