On quotient metrics and decoding problems

• Ferdinand Blomqvist

  Aalto University

抄録

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.

収録刊行物

• IEICE Proceeding Series

  IEICE Proceeding Series 55 198-202, 2018-10-18

  The Institute of Electronics, Information and Communication Engineers

詳細情報

• CRID: 1390845702308353152
• NII論文ID: 230000011188
• DOI: 10.34385/proc.55.mo-pm-2-1.4
• ISSN: 21885079
• 本文言語コード: en
• データソース種別:
  • JaLC
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可