Multilevel expander codes
classification
💻 cs.IT
math.IT
keywords
multilevelcodesalgorithmanalogousbipartiteblokh-zyablovboundconcatenated
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.