Explicit representation and enumeration of repeated-root (δ + αu²)-Constacyclic Codes over F<inf>2</inf>^m[u]/⟨u^2?⟩

• المؤلفون الرئيسيون: Yuan Cao, Yonglin Cao, Hai Q. Dinh, Tushar Bag, Woraphon Yamaka
• التنسيق: دورية
• منشور في: 2020
• الموضوعات: Computer Science; Engineering; Materials Science
• الوصول للمادة أونلاين: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85082832767&origin=inward; http://cmuir.cmu.ac.th/jspui/handle/6653943832/70464

© 2013 IEEE. Let F2m be a finite field of 2m elements, λ and k be integers satisfying λ,k ≥ 2 and denote R= F2m[u]/&lsaquo; u2λ &rsaquo;. Let δ,α F2m×. For any odd positive integer n, we give an explicit representation and enumeration for all distinct (δ +α u2)-constacyclic codes over R of l...