Sequences of LCD AG codes and LCP of AG Codes attaining the Tsfasman-Vladut-Zink bound

Abstract

Since Massey introduced linear complementary dual (LCD) codes in 1992 and Bhasin et al. later formalized linear complementary pairs (LCPs) of codes - structures with important cryptographic applications - these code families have attracted significant interest. We construct infinite sequences (Ci)i ≥ 1 of LCD codes and of LCPs (C', D')i ≥ 1 over Fq2 obtained from the Garcia-Stichtenoth tower of function fields, where we describe suitable non-special divisors of small degree on each level of the tower. These families attain the Tsfasman-Vladut-Zink bound and, for sufficiently large q exceed the classic Gilbert-Varshamov bound, providing explicit asymptotically good constructions beyond existential results. We also exhibit infinite sequences of self-orthogonal over Fq2 and, when q is even, self-dual codes from the same tower all meeting the Tsfasman-Vladut-Zink bound.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…