Ranks of Repeated-Root Constacyclic Code

By the discussion of division in F2m[u]/〈u4〉,the minimal spanning set and the rank of a（1＋u＋u2）-constacyclic code with an arbitrary length N=2en over F2m[u]/〈u4〉 are determined based on the factorization of（xn-1） over F2m.

Saved in:
Bibliographic Details
Published in:Wuhan University journal of natural sciences 2016-10, Vol.21 (5), p.453-460
Main Authors: Li, Hongju, Ding, Jian, Tang, Yongsheng
Format: Article
Language:English
Subjects:
Biomedical and Life Sciences
Computer Science
Life Sciences
Materials Science
Mathematics
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:By the discussion of division in F2m[u]/〈u4〉,the minimal spanning set and the rank of a（1＋u＋u2）-constacyclic code with an arbitrary length N=2en over F2m[u]/〈u4〉 are determined based on the factorization of（xn-1） over F2m.
ISSN:1007-1202
1993-4998
DOI:10.1007/s11859-016-1196-z