|
|||||
|
|
Ranks of repeated-root constacyclic code |
|
| Authors: | Hongju?Li |
| Institution: | 1.Department of Common Course,Anhui Xinhua University,Hefei 230088, Anhui,China;2.School of Mathematics and Statistics,Hefei Normal University,Hefei 230601, Anhui,China |
| Abstract: | By the discussion of division in \(F_{^{^{^{_2 m} } } } \left u \right]/\left\langle {u^4 } \right\rangle \), the minimal spanning set and the rank of a (1 + u + u 2) - constacyclic code with an arbitrary length N = 2 e n over \(\Phi \) are determined based on the factorization of (x n - 1) over \({F_{{2^m}}}\). |
| Keywords: | |
| 本文献已被 CNKI SpringerLink 等数据库收录！ | |