Linear Codes with Certain Dimension of Hermitian Hulls
By: Jiabin Wang, Jinquan Luo
In this paper, we study the enumerative and asymptotic properties related to Hermitian $\ell$-complementary codes on the unitary space over $\F_{q^2}$. We provide some closed form expressions for the counting formulas of Hermitian $\ell$-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 $d$. 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.
Similar Papers
Hermitian hull of some GRS codes and new EAQMDS codes
Information Theory
Makes quantum computers more reliable for fixing errors.
A Construction of Infinite Families of Self-Orthogonal Quasi-Cyclic Codes Using Constituent Codes.pdf
Information Theory
Makes computers better at fixing errors in data.
On Construction of Linear (Euclidean) Hull Codes over Finite Extensions Binary Fields
Information Theory
Makes computer codes more efficient for specific tasks.