Projective systems and bounds on the length of codes of non-zero defect
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_ | 1866912349631283200 |
|---|---|
| author | Alderson, Tim L. Zhang, Zhipeng |
| author_facet | Alderson, Tim L. Zhang, Zhipeng |
| contents | In their 2007 book, Tsfasman and Vlǎduţ invite the reader to reinterpret existing coding theory results through the lens of projective systems. Redefining linear codes as projective systems provides a geometric vantage point. In this paper, we embrace this perspective, deriving bounds on the lengths of A$^s$MDS codes (codes with Singleton defect $s$). To help frame our discussions, we introduce the parameters $m^{s}(k,q)$, denoting the maximum length of an (non-degenerate) $[n,k,d]_q$ A$^s$MDS code, $m^{s}_t(k,q)$ denoting the maximum length of an (non-degenerate) $[n,k,d]_q$ A$^s$MDS code such that the dual code is an A$^t$MDS code, and $κ(s,q)$, representing the maximum dimension $k$ for which there exists a linear code of (maximal) length $n=(s+1)(q+1)+k-2$. In particular, we address a gap in the literature by providing sufficient conditions on $n$ and $k$ under which the dual of an $[n,k,d]_q$ A$^s$MDS code is also an A$^s$MDS code. Our results subsume or improve several results in the literature. Some conjectures arise from our findings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_19325 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Projective systems and bounds on the length of codes of non-zero defect Alderson, Tim L. Zhang, Zhipeng Combinatorics Information Theory 35A01, 65L10, 65L12, 65L20, 65L70 In their 2007 book, Tsfasman and Vlǎduţ invite the reader to reinterpret existing coding theory results through the lens of projective systems. Redefining linear codes as projective systems provides a geometric vantage point. In this paper, we embrace this perspective, deriving bounds on the lengths of A$^s$MDS codes (codes with Singleton defect $s$). To help frame our discussions, we introduce the parameters $m^{s}(k,q)$, denoting the maximum length of an (non-degenerate) $[n,k,d]_q$ A$^s$MDS code, $m^{s}_t(k,q)$ denoting the maximum length of an (non-degenerate) $[n,k,d]_q$ A$^s$MDS code such that the dual code is an A$^t$MDS code, and $κ(s,q)$, representing the maximum dimension $k$ for which there exists a linear code of (maximal) length $n=(s+1)(q+1)+k-2$. In particular, we address a gap in the literature by providing sufficient conditions on $n$ and $k$ under which the dual of an $[n,k,d]_q$ A$^s$MDS code is also an A$^s$MDS code. Our results subsume or improve several results in the literature. Some conjectures arise from our findings. |
| title | Projective systems and bounds on the length of codes of non-zero defect |
| topic | Combinatorics Information Theory 35A01, 65L10, 65L12, 65L20, 65L70 |
| url | https://arxiv.org/abs/2504.19325 |