Quantum codes from one-point codes on norm-trace curves

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

In this paper, we present quantum codes via algebraic geometry codes on norm-trace curves. We provide a lower bound of minimum Hamming distance for q-ary quantum code, where q = 2e (e ≥ 3). In order to get this, we determine Feng-Rao function values for the elements of Weierstrass semigroups on norm-trace curves. We present the order-bound on the minimum Hamming distance of one-point dual codes. Furthermore, we give a certain increasing sequence of one-point codes on norm-trace curves. We construct quantum codes from the sequence of one-point codes via the CSS construction. These give a better lower bound on the minimum Hamming distance of q-ary quantum code than some previous results.

Original languageEnglish
Pages (from-to)1179-1188
Number of pages10
JournalCryptography and Communications
Volume14
Issue number5
DOIs
StatePublished - Sep 2022

Keywords

  • Algebraic geometry code
  • Dual code
  • Norm-trace curve
  • One-point code
  • Quantum code

Fingerprint

Dive into the research topics of 'Quantum codes from one-point codes on norm-trace curves'. Together they form a unique fingerprint.

Cite this