Summary
The 2018 International Symposium on Information Theory and Its Applications　(ISITA2018)
2018
Session Number:Mo-PM-2-1
Session:
Number:Mo-PM-2-1.4
On quotient metrics and decoding problems
Ferdinand Blomqvist,
pp.198-202
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.Mo-PM-2-1.4
PDF download
Summary:
Linear codes and lattices arising from such codes via Construction A are in a one-to-one correspondence. In [1], Campello et al. showed that solving the closest vector problem with respect to the lp norm on the lattice corresponding to a q-ary code C is equivalent to finding the closest codeword of C with respect to the p-Lee metric. Here these results are extended to the most general situation we can think of.