Table of Contents
Fetching ...

Projective systems and bounds on the length of codes of non-zero defect

Tim L. Alderson, Zhipeng Zhang

TL;DR

By reframing linear codes as projective systems, the paper derives tight bounds on the maximum lengths of non-zero Singleton-defect codes $m^{s}(k,q)$ and their dual-constraints $m^{s}_{t}(k,q)$, introducing the central parameter $\kappa(s,q)$ that captures maximal dimensions for maximal arcs. The main approach leverages projective-geometry techniques, quotient constructions, and shortening to connect $A^s$MDS codes with arcs and caps in PG-spaces, yielding unified bounds that subsume many prior results. It also provides sufficient conditions under which the dual of an $A^s$MDS code remains in the same defect class and investigates when long codes must be NMDS, accompanied by conjectures on $\kappa(s,q)$. Overall, the work advances understanding of code lengths under Singleton defect constraints and duality, with potential impacts on the design of long error-correcting codes over finite fields.

Abstract

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.

Projective systems and bounds on the length of codes of non-zero defect

TL;DR

By reframing linear codes as projective systems, the paper derives tight bounds on the maximum lengths of non-zero Singleton-defect codes and their dual-constraints , introducing the central parameter that captures maximal dimensions for maximal arcs. The main approach leverages projective-geometry techniques, quotient constructions, and shortening to connect MDS codes with arcs and caps in PG-spaces, yielding unified bounds that subsume many prior results. It also provides sufficient conditions under which the dual of an MDS code remains in the same defect class and investigates when long codes must be NMDS, accompanied by conjectures on . Overall, the work advances understanding of code lengths under Singleton defect constraints and duality, with potential impacts on the design of long error-correcting codes over finite fields.

Abstract

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 AMDS codes (codes with Singleton defect ). To help frame our discussions, we introduce the parameters , denoting the maximum length of an (non-degenerate) AMDS code, denoting the maximum length of an (non-degenerate) AMDS code such that the dual code is an AMDS code, and , representing the maximum dimension for which there exists a linear code of (maximal) length . In particular, we address a gap in the literature by providing sufficient conditions on and under which the dual of an AMDS code is also an AMDS code. Our results subsume or improve several results in the literature. Some conjectures arise from our findings.
Paper Structure (10 sections, 38 theorems, 27 equations, 4 tables)

This paper contains 10 sections, 38 theorems, 27 equations, 4 tables.

Key Result

Proposition 1

If $q>3$ and $k\ge 3$ then $m^1(k,q)\le 2q+k-2$.

Theorems & Definitions (70)

  • definition 1
  • definition 2
  • Proposition 1: MR1409442, Thm. 8; MR1358272, Prop. 6.2
  • Theorem 2: MR1755411, Thm. 2.7
  • Theorem 3: MR1358272, Thm. 3.4
  • Proposition 4: Tong2012, Cor. 2
  • Lemma 5: MR1432708, Lem. 2
  • Theorem 6: MR1432708, Thm. 7
  • Corollary 7: MR1432708, Lem. 2
  • Proposition 8
  • ...and 60 more