Explicit Constructions of Sum-Rank Metric Codes from Quadratic Kummer Extensions
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911317546237952 |
|---|---|
| author | Yunlong, Zhu Chang-An, Zhao |
| author_facet | Yunlong, Zhu Chang-An, Zhao |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_18653 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Explicit Constructions of Sum-Rank Metric Codes from Quadratic Kummer Extensions Yunlong, Zhu Chang-An, Zhao Information Theory 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. |
| title | Explicit Constructions of Sum-Rank Metric Codes from Quadratic Kummer Extensions |
| topic | Information Theory |
| url | https://arxiv.org/abs/2506.18653 |