One-Generator Quasi-Abelian Codes Revisited

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 impro...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2016-02
Main Authors: Jitman, Somphong, Udomkavanich, Patanee
Format: Article
Language:English
Subjects:
Algorithms
Enumeration
Fields (mathematics)
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2331-8422