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

May 29, 2025 Β· Declared Dead Β· πŸ› arXiv.org

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Adler Marques, Luciane Quoos arXiv ID 2505.23937 Category math.AG Cross-listed cs.IT Citations 0 Venue arXiv.org Last Checked 3 months ago
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 $(C_i)_{i \geq 1}$ of LCD codes and of LCPs $(C', D')_{i \geq 1}$ over $\mathbb{F}_{q^2}$ 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-Vlăduţ-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 $\mathbb{F}_{q^2}$ and, when $q$ is even, self-dual codes from the same tower all meeting the Tsfasman-Vlăduţ-Zink bound.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” math.AG

Died the same way β€” πŸ‘» Ghosted