Name
Abstract | ||
|---|---|---|
We study a class of graph based codes with Reed-Solomon component codes as affine variety codes. We give a formulation of the exact dimension of graph codes in general. We give an algebraic description of these codes which makes the exact computation of the dimension of the graph codes easier. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ISIT.2013.6620422 | ISIT |
Keywords | Field | DocType |
Reed-Solomon codes,graph theory,Reed-Solomon component codes,affine variety codes,algebraic description,graph code dimension | Factor graph,Discrete mathematics,Combinatorics,Algebra,Luby transform code,Computer science,Block code,Expander code,Reed–Solomon error correction,Raptor code,Reed–Muller code,Linear code | Conference |
Citations | PageRank | References |
1 | 0.38 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Beelen | 1 | 116 | 15.95 |
| Tom Høholdt | 2 | 186 | 28.53 |
| Fernando Pinero | 3 | 2 | 0.77 |
| J. Justesen | 4 | 168 | 32.72 |