We consider two metrics decoding equivalent if they impose the same minimum distance decoding for every code. It is known that, up to this equivalence, every metric is isometrically embeddable into the Hamming cube.
We present an algorithm which for any translation invariant metric gives an upper bound on the minimum dimension of such an embedding. We also give lower and upper bounds for this embedding dimension over the set of all such metrics.
|V. Chvétal , Recognizing intersection patterns, Ann. Discrete Math., 8 (1980) , 249-251.|
|M. Deza and M. Laurent, Geometric properties, in Geometry of Cuts and Metrics, Springer-Verlag, 1997,511-550. doi: 10.1007/978-3-642-04295-9_31.|
|R. G. L. D'Oliveira and M. Firer, Channel metrization, preprint, arXiv: 1510.03104|
|F. Eisenbrand, Fast Integer Programming in Fixed Dimension, Springer, Berlin, 2003. doi: 10.1007/978-3-540-39658-1_20.|
|M. Firer and J. L. Walker , Matched metrics and channels, IEEE Trans. Inf. Theory, 62 (2016) , 1150-1156. doi: 10.1109/TIT.2015.2512596.|
|H. W. Lenstra Jr. , Integer programming with a fixed number of variables, Math. Oper. Res., 8 (1983) , 538-548. doi: 10.1287/moor.8.4.538.|
The partition of