Name
Abstract | ||
|---|---|---|
We treat a specific case of codes based on bipartite expander graphs coming from finite geometries. The code symbols are associated with the branches and the symbols connected to a given node are restricted to be codewords in a Reed-Solomon code. We give results on the parameters of the codes and methods for their encoding. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ISIT.2006.261904 | 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS |
Keywords | Field | DocType |
geometry,concatenated codes,mathematics,reed solomon code,encoding,expander graph,bipartite graph,reed solomon,graph theory | Discrete mathematics,Combinatorics,Luby transform code,Low-density parity-check code,Computer science,Block code,Expander code,Reed–Solomon error correction,Raptor code,Reed–Muller code,Linear code | Conference |
Citations | PageRank | References |
10 | 1.08 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tom Høholdt | 1 | 186 | 28.53 |
| jorn justesen | 2 | 18 | 3.14 |