Paper Info
Title
Codes from Expander Graphs
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.
Year
DOI
Venue
2008
10.1007/978-3-540-87448-5_9
International Castle Meeting on Coding Theory and Applications
Keywords
Field
DocType
random graph,exellent code,recent work,code symbol,solomon code,iterative decoding,expander graphs,certain constituent code,bipartite expander graph,expander graph,reed solomon code
Online codes,Discrete mathematics,Combinatorics,Luby transform code,Fountain code,Block code,Expander code,Raptor code,Reed–Muller code,Linear code,Mathematics
Conference
Volume
ISSN
Citations 
5228
0302-9743
0
PageRank 
References 
Authors
0.34
11
1
Name
Order
Citations
PageRank
Tom Høholdt118628.53