Explicit Constructions of Sum-Rank Metric Codes from Quadratic Kummer Extensions

This paper introduces new constructions of sum-rank metric codes derived from algebraic function fields, as existing results on such codes remain limited. A major challenge lies in the determination of their parameters. We address this issue by employing quadratic Galois extensions, proposing two general constructions of $2\times2$ sum-rank codes. Analogous to algebraic geometry codes in the Hamming metric, our codes achieve a larger block length compared to existing constructions. We determine explicit parameters including dimensions and minimum distances of our codes, and we present an illustrative example using elliptic function fields. Finally, we discuss the asymptotic behavior of our codes and compare them with the Gilbert-Varshamov-like bound for sum-rank metric codes.

Publication Details

Journal
ArXiv.org
Published
2025-06-23
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Explicit Constructions of Sum-Rank Metric Codes from Quadratic Kummer Extensions

ArXiv.org
Coding theory and cryptography
article

Explicit Constructions of Sum-Rank Metric Codes from Quadratic Kummer Extensions

article en

Abstract

This paper introduces new constructions of sum-rank metric codes derived from algebraic function fields, as existing results on such codes remain limited. A major challenge lies in the determination of their parameters. We address this issue by employing quadratic Galois extensions, proposing two general constructions of $2\times2$ sum-rank codes. Analogous to algebraic geometry codes in the Hamming metric, our codes achieve a larger block length compared to existing constructions. We determine explicit parameters including dimensions and minimum distances of our codes, and we present an illustrative example using elliptic function fields. Finally, we discuss the asymptotic behavior of our codes and compare them with the Gilbert-Varshamov-like bound for sum-rank metric codes.

ArXiv.org
Openalex Percentile: Top 73%
Coding theory and cryptography
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.

Explicit Constructions of Sum-Rank Metric Codes from Quadratic Kummer Extensions · ArXiv.org (2025) | TGRS Research Map | TGRS