On quotient metrics and decoding problems

Ferdinand Blomqvist*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Abstract

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 l p 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.

Original languageEnglish
Title of host publicationProceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018
PublisherIEEE
Pages198-202
Number of pages5
ISBN (Electronic)9784885523182
DOIs
Publication statusPublished - 8 Mar 2019
MoE publication typeA4 Article in a conference publication
EventInternational Symposium on Information Theory and Its Applications - Singapore, Singapore
Duration: 28 Oct 201831 Oct 2018
Conference number: 15

Conference

ConferenceInternational Symposium on Information Theory and Its Applications
Abbreviated titleISITA
CountrySingapore
CitySingapore
Period28/10/201831/10/2018

Fingerprint Dive into the research topics of 'On quotient metrics and decoding problems'. Together they form a unique fingerprint.

Cite this