Construction and enumeration of left dihedral codes satisfying certain duality properties
Abstract
Let be the finite field of elements and let be the dihedral group of order . Left ideals of the group algebra are known as left dihedral codes over of length , and abbreviated as left -codes. Let . In this paper, we give an explicit representation for the Euclidean hull of every left -code over . On this basis, we determine all distinct Euclidean LCD codes and Euclidean self-orthogonal codes which are left -codes over . In particular, we provide an explicit representation and a precise enumeration for these two subclasses of left -codes and self-dual left -codes, respectively. Moreover, we give a direct and simple method for determining the encoder (generator matrix) of any left -code over , and present several numerical examples to illustrative our applications.
Keywords
Cite
@article{arxiv.2105.07924,
title = {Construction and enumeration of left dihedral codes satisfying certain duality properties},
author = {Yuan Cao and Yonglin Cao and Fanghui Ma},
journal= {arXiv preprint arXiv:2105.07924},
year = {2021}
}