Name
Abstract | ||
|---|---|---|
This paper shows how to construct analogs of Reed-Muller codes from partially ordered sets. In the case that the partially ordered set is Eulerian the length of the code is the number of elements in the poset, the dimension is the size of a selected order ideal and the minimum distance is the minimum size of a principal dual ideal generated by a member of the order ideal. In this case, the majority logic method of decoding Reed-Muller codes works for incidence codes. A number of interesting combinatorial questions arise from the study of these codes. |
Year | DOI | Venue |
|---|---|---|
1980 | 10.1016/0012-365X(80)90167-3 | Discrete Mathematics |
Keywords | Field | DocType |
reed muller code | Discrete mathematics,Hamming code,Combinatorics,Group code,Block code,Expander code,Reed–Solomon error correction,Linear code,Reed–Muller code,Star product,Mathematics | Journal |
Volume | Issue | ISSN |
31 | 1 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kenneth P. Bogart | 1 | 162 | 46.13 |