One-Generator Quasi-Abelian Codes Revisited
classification
🧮 math.RA
keywords
codesquasi-abeliangeneratorrevisitedalgorithmalternativecharacterizationclass
read the original abstract
The class of 1-generator quasi-abelian codes over finite fields is revisited. Alternative and explicit characterization and enumeration of such codes are given. An algorithm to find all 1-generator quasi-abelian codes is provided. Two 1-generator quasi-abelian codes whose minimum distances are improved from Grassl's online table are presented.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.