Structures of Constacyclic Codes of Length 2p^s over Finite Fields
No Thumbnail Available
Date
2015
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
無中文摘要
We first recall the algebraic structures of constacyclic codes. Then, we describe constacyclic codes by finding their generator polynomials, and we also give a way to find the dual codes of constacyclic codes as well as to discuss the conditions of existence of self-dual codes of cyclic and negacyclic codes of length 2p^s over F_p^m. Finally, we give structures of all constacyclic codes of length 2p^s over F_p^m via isomorphisms between cyclic codes, negacyclic codes and constacyclic codes.
We first recall the algebraic structures of constacyclic codes. Then, we describe constacyclic codes by finding their generator polynomials, and we also give a way to find the dual codes of constacyclic codes as well as to discuss the conditions of existence of self-dual codes of cyclic and negacyclic codes of length 2p^s over F_p^m. Finally, we give structures of all constacyclic codes of length 2p^s over F_p^m via isomorphisms between cyclic codes, negacyclic codes and constacyclic codes.
Description
Keywords
finite fields, constacyclic codes, dual codes, polynomial generators, finite fields, constacyclic codes, dual codes, polynomial generators