Quantum error correction with Goppa codes from maximal curves: Design, simulation, and performance

This paper characterizes Goppa codes of certain maximal curves over finite fields defined by equations of the form [Formula: see text]. We investigate algebraic geometric and quantum stabilizer codes associated with these maximal curves and propose modifications to improve their parameters. The theoretical analysis is complemented by extensive simulation results, which validate the performance of these codes under various error rates. We provide concrete examples of the constructed codes, comparing them with known results to highlight their strengths and trade-offs. The simulation data, presented through detailed graphs and tables, offers insights into the practical behavior of these codes in noisy environments. Our findings demonstrate that while the constructed codes may not always achieve optimal minimum distances, they offer systematic construction methods and interesting parameter trade-offs that could be valuable in specific applications or for further theoretical study.

Authors

Institutions

Publication Details

Journal
Discrete Mathematics Algorithms and Applications
Published
2024-12-13
DOI
https://doi.org/10.1142/s1793830925500090
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum error correction with Goppa codes from maximal curves: Design, simulation, and performance

Vahid Nourozi
Discrete Mathematics Algorithms and Applications
Quantum Computing Algorithms and Architecture
article

Quantum error correction with Goppa codes from maximal curves: Design, simulation, and performance

Vahid Nourozi
article en

Abstract

This paper characterizes Goppa codes of certain maximal curves over finite fields defined by equations of the form [Formula: see text]. We investigate algebraic geometric and quantum stabilizer codes associated with these maximal curves and propose modifications to improve their parameters. The theoretical analysis is complemented by extensive simulation results, which validate the performance of these codes under various error rates. We provide concrete examples of the constructed codes, comparing them with known results to highlight their strengths and trade-offs. The simulation data, presented through detailed graphs and tables, offers insights into the practical behavior of these codes in noisy environments. Our findings demonstrate that while the constructed codes may not always achieve optimal minimum distances, they offer systematic construction methods and interesting parameter trade-offs that could be valuable in specific applications or for further theoretical study.

Discrete Mathematics Algorithms and ApplicationsVol. 17(08)
New Mexico State University (US)
Conselho Nacional de Desenvolvimento Científico e Tecnológico, Universidade Estadual de Campinas
Openalex Percentile: Top 79%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.