Linear-time encodable and decodable irregular graph codes
Saejoon Kim, Stephen B. Wicker · 2002
Randomized constructions are presented for a family of linear-time encodable and decodable error-correcting codes using irregular expander graphs. These codes can be encoded in constant time and decoded in at most logarithmic time if a linear number of processors are used.