Bounds for complexity of syndrome decoding for poset metrics
Information Theory
2015-02-19 v2 math.IT
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.
Keywords
Cite
@article{arxiv.1411.0724,
title = {Bounds for complexity of syndrome decoding for poset metrics},
author = {Marcelo Firer and Jerry Anderson Pinheiro},
journal= {arXiv preprint arXiv:1411.0724},
year = {2015}
}
Comments
Submitted to ITW 2015