Year: 2005
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: Barg, Alexander, Zemor, Gilles
Institutions: University of Maryland, College Park, Télécom Paris
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: National Science Foundation
OpenAlex ID: W2951058140