Linear Codes with Certain Dimension of Hermitian Hulls
Jiabin Wang, Jinquan Luo

TL;DR
This paper investigates the properties and enumeration of Hermitian $ ext{ell}$-complementary codes over finite fields, revealing asymptotic behaviors and density results for Hermitian self-orthogonal codes, especially MDS codes, as the alphabet size grows.
Contribution
It provides closed-form formulas for counting Hermitian $ ext{ell}$-complementary codes and analyzes their asymptotic weight distribution and density of MDS codes.
Findings
Hermitian $ ext{ell}$-complementary codes have explicit enumeration formulas.
Asymptotic weight distribution of Hermitian self-orthogonal codes resembles that of unrestricted codes.
MDS codes in the Hermitian self-orthogonal class are asymptotically dense as alphabet size increases.
Abstract
In this paper, we study the enumerative and asymptotic properties related to Hermitian -complementary codes on the unitary space over . We provide some closed form expressions for the counting formulas of Hermitian -complementary codes. There is a similarity in the asymptotic weight distribution between Hermitian self-orthogonal codes and unrestricted codes. Furthermore, we study the asymptotic behavior of Hermitian self-orthogonal codes whose minimum distance is at least . In particular, we conclude that MDS codes within the class of Hermitian self-orthogonal codes are asymptotically dense when the alphabet size approaches to infinity.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Analytic Number Theory Research
