Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$
- 16 March 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 55 (4), 1730-1740
- https://doi.org/10.1109/tit.2009.2013015
Abstract
We study all constacyclic codes of length 2s over GR(Rfr,m), the Galois extension ring of dimension m of the ring Rfr=F2+uF2. The units of the ring GR(Rfr,m) are of the forms alpha, and alpha+ubeta, where alpha, beta are nonzero elements of F2m, which correspond to 2 m(2m-1) such constacyclic codes. First, the structure and Hamming distances of (1+ugamma)-constacyclic codes are established. We then classify all cyclic codes of length 2s over GR(Rfr,m), and obtain a formula for the number of those cyclic codes, as well as the number of codewords in each code. Finally, one-to-one correspondences between cyclic and alpha-constacyclic codes, as well as (1+ugamma)-constacyclic and (alpha+ubeta) -constacyclic codes are provided via ring isomorphisms, that allow us to carry over the results about cyclic and (1+ugamma)-constacyclic accordingly to all constacyclic codes of length 2s over GR(Rfr,m).Keywords
This publication has 26 references indexed in Scilit:
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributionsFinite Fields and Their Applications, 2008
- Complete Distances of All Negacyclic Codes of Length $2^{s}$ Over $\BBZ _{2^{a}}$IEEE Transactions on Information Theory, 2006
- Negacyclic Codes of Length$2^s$Over Galois RingsIEEE Transactions on Information Theory, 2005
- Cyclic and Negacyclic Codes Over Finite Chain RingsIEEE Transactions on Information Theory, 2004
- Linear codes over F2 + uF2 and their complete weight enumeratorsPublished by Walter de Gruyter GmbH ,2002
- Decoding of cyclic codes over F/sub 2/+uF/sub 2/IEEE Transactions on Information Theory, 1999
- A note on the q-ary image of a q/sup m/-ary repeated-root cyclic codeIEEE Transactions on Information Theory, 1997
- A linear construction for certain Kerdock and Preparata codesBulletin of the American Mathematical Society, 1993
- On repeated-root cyclic codesIEEE Transactions on Information Theory, 1991
- Repeated-root cyclic codesIEEE Transactions on Information Theory, 1991