Constacyclic and Quasi-Twisted Hermitian Self-Dual Codes over Finite Fields
Ekkasit Sangwisut, Somphong Jitman, and Patanee Udomkavanich

TL;DR
This paper investigates the structure, enumeration, and construction of Hermitian self-dual constacyclic and quasi-twisted codes over finite fields, introducing new algorithms, characterizations, and a family of MDS codes.
Contribution
It provides a new factorization algorithm for $x^n-\lambda$, characterizes Hermitian self-dual codes, and introduces a new family of MDS codes over finite fields.
Findings
Factorization algorithm for $x^n-\lambda$ over $_{q^2}$
Characterization and enumeration of Hermitian self-dual codes
Introduction of a new family of MDS constacyclic Hermitian self-dual codes
Abstract
Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields are studied. An algorithm for factorizing over is given, where is a unit in . Based on this factorization, the dimensions of the Hermitian hulls of -constacyclic codes of length over are determined. The characterization and enumeration of constacyclic Hermitian self-dual (resp., complementary dual) codes of length over are given through their Hermitian hulls. Subsequently, a new family of MDS constacyclic Hermitian self-dual codes over is introduced. As a generalization of constacyclic codes, quasi-twisted Hermitian self-dual codes are studied. Using the factorization of and the Chinese Remainder Theorem, quasi-twisted codes can be viewed as a product of linear…
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.
