Codes from Expander Graphs

Authors:
Tom Høholdt
Affiliations:
Department of Mathematics, Technical University of Denmark,
Venue:
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
Year:
2008

Citing 8
Cited 0

Sudden emergence of a giant k-core in a random graph

Journal of Combinatorial Theory Series B
Introduction to Coding Theory

Introduction to Coding Theory
A simple solution to the k-core problem

Random Structures & Algorithms - Proceedings from the 12th International Conference “Random Structures and Algorithms”, August1-5, 2005, Poznan, Poland
Expander codes

IEEE Transactions on Information Theory - Part 1
Minimum-distance bounds by graph analysis

IEEE Transactions on Information Theory
On expander codes

IEEE Transactions on Information Theory
Error exponents of expander codes

IEEE Transactions on Information Theory
Improved Nearly-MDS Expander Codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We survey some recent work on codes based on bipartite expander graphs. The code symbols are associated with the branches and the symbols connected to a given node are restricted to be codewords in certain constituent codes (e.g. Reed---Solomon codes). This class turn out to contain some exellent codes. We give results on the parameters of the codes and methods for their encoding. We also analyze the performance under iterative decoding, partly based on a result on cores in random graphs.