Name
Abstract | ||
|---|---|---|
In this work we show how to decompose a linear code relatively to any given poset metric. We prove that the complexity of syndrome decoding is determined by a maximal (primary) such decomposition and then show that a refinement of a partial order leads to a refinement of the primary decomposition. Using this and considering already known results about hierarchical posets, we can establish upper and lower bounds for the complexity of syndrome decoding relatively to a poset metric. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ITW.2015.7133130 | Information Theory Workshop |
Keywords | Field | DocType |
computational complexity,linear codes,set theory,linear code,poset metrics,primary decomposition,syndrome decoding complexity | Discrete mathematics,Computer science,Upper and lower bounds,Primary decomposition,Linear code,Decoding methods,Partially ordered set | Journal |
Volume | Citations | PageRank |
abs/1411.0724 | 0 | 0.34 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marcelo Firer | 1 | 17 | 2.20 |
| Jerry Anderson Pinheiro | 2 | 4 | 2.53 |