On quotient metrics and decoding problems

Ferdinand Blomqvist

doi:10.23919/ISITA.2018.8664238

On quotient metrics and decoding problems

Ferdinand Blomqvist^*

^*Corresponding author for this work

Department of Mathematics and Systems Analysis

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-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 language	English
Title of host publication	Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018
Publisher	IEEE
Pages	198-202
Number of pages	5
ISBN (Electronic)	9784885523182
DOIs	https://doi.org/10.23919/ISITA.2018.8664238
Publication status	Published - 8 Mar 2019
MoE publication type	A4 Article in a conference publication
Event	International Symposium on Information Theory and Its Applications - Singapore, Singapore Duration: 28 Oct 2018 → 31 Oct 2018 Conference number: 15

Conference

Conference	International Symposium on Information Theory and Its Applications
Abbreviated title	ISITA
Country/Territory	Singapore
City	Singapore
Period	28/10/2018 → 31/10/2018

Access to Document

10.23919/ISITA.2018.8664238

OpenUrl availability

Full text

Cite this

@inproceedings{7540e8b03eef40cea3251ed6c17c4ee5,

title = "On quotient metrics and decoding problems",

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. ",

author = "Ferdinand Blomqvist",

year = "2019",

month = mar,

day = "8",

doi = "10.23919/ISITA.2018.8664238",

language = "English",

pages = "198--202",

booktitle = "Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018",

publisher = "IEEE",

address = "United States",

note = "International Symposium on Information Theory and Its Applications, ISITA ; Conference date: 28-10-2018 Through 31-10-2018",

}

TY - GEN

T1 - On quotient metrics and decoding problems

AU - Blomqvist, Ferdinand

N1 - Conference code: 15

PY - 2019/3/8

Y1 - 2019/3/8

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85063887858&partnerID=8YFLogxK

U2 - 10.23919/ISITA.2018.8664238

DO - 10.23919/ISITA.2018.8664238

M3 - Conference contribution

AN - SCOPUS:85063887858

SP - 198

EP - 202

BT - Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018

PB - IEEE

T2 - International Symposium on Information Theory and Its Applications

Y2 - 28 October 2018 through 31 October 2018

ER -

On quotient metrics and decoding problems

Abstract

Conference

Access to Document

OpenUrl availability

Other files and links

Fingerprint

Cite this