Côd QR

Explicit Representation and Enumeration of Repeated-Root (&#x03B4; &#x002B; <italic>&#x03B1;u</italic>&#x00B2;)-Constacyclic Codes Over F&#x2082;<sup><italic>m</italic></sup>[<italic>u</italic>]/&#x2039;<italic>u</italic><sup>2&#x03BB;</sup>&#x203A;

Let F<sub>2(m)</sub> be a finite field of 2<sup>m</sup> elements, &#x03BB; and k be integers satisfying &#x03BB;, k &#x2265; 2 and denote R = F<sub>2(m)</sub>[u]/(u<sup>2&#x03BB;</sup>). Let &#x03B4;, &#x03B1; &#x2208; F<sub>2(m)</sub><sup>&#x00D7;</sup>. For any odd positive integer n, we give an e...

Disgrifiad llawn

Wedi'i Gadw mewn:
Prif Awduron: Yuan Cao, Yonglin Cao, Hai Q. Dinh, Tushar Bag, Woraphon Yamaka
Fformat: Artigo
Iaith:Inglês
Cyhoeddwyd: IEEE 2020-01-01
Cyfres:IEEE Access
Pynciau:
Type 2 constacyclic code
linear code
repeated-root code
finite chain ring
Mynediad Ar-lein:https://ieeexplore.ieee.org/document/9039567/
Tagiau: Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!

Eitemau Tebyg