H. Dinh

activity

20052019

most citedConstruction and enumeration for self-dual cyclic codes of even length over

F_{2^{m}} + u F_{2^{m}}

4 citations · 4 across the 3 of their papers we have counts for

collaborators

Showing cs.ITShow all

5 papers · 1 filter

cs.IT2019★ 4 cited

Construction and enumeration for self-dual cyclic codes of even length over $F_{2^{m}} + u F_{2^{m}}$

Yuan Cao, Yonglin Cao, Hai Q. Dinh +2

Let $F_{2^{m}}$ be a finite field of cardinality $2^{m}$ , $R = F_{2^{m}} + u F_{2^{m}}$ $(u^{2} = 0)$ and $s, n$ be positive integers such that $n$ is odd. In this paper,…

cs.IT2019

An efficient method to construct self-dual cyclic codes of length $p^{s}$ over $F_{p^{m}} + u F_{p^{m}}$

Yuan Cao, Yonglin Cao, Hai Q. Dinh +1

Let $p$ be an odd prime number, $F_{p^{m}}$ be a finite field of cardinality $p^{m}$ and $s$ a positive integer. Using some combinatorial identities, we obtain certain propert…

cs.IT2019

Explicit representation for a class of Type 2 constacyclic codes over the ring $F_{2^{m}} [u] / ⟨ u^{2 λ} ⟩$ with even length

Yuan Cao, Yonglin Cao, Hai Q. Dinh +2

Let $F_{2^{m}}$ be a finite field of cardinality $2^{m}$ , $λ$ and $k$ be integers satisfying $λ, k \geq 2$ and denote $R = F_{2^{m}} [u] / ⟨ u^{2 λ} ⟩$ . Let $δ,α\in…

cs.IT2018

An explicit representation and enumeration for self-dual cyclic codes over $F_{2^{m}} + u F_{2^{m}}$ of length $2^{s}$

Yuan Cao, Yonglin Cao, Hai Q. Dinh +1

Let $F_{2^{m}}$ be a finite field of cardinality $2^{m}$ and $s$ a positive integer. Using properties for Kronecker product of matrices and calculation for linear equations ov…

cs.IT2018

A class of repeated-root constacyclic codes over $F_{p^{m}} [u] / ⟨ u^{e} ⟩$ of Type $2$

Yuan Cao, Yonglin Cao, Hai Q. Dinh +3

Let $F_{p^{m}}$ be a finite field of cardinality $p^{m}$ where $p$ is an odd prime, $n$ be a positive integer satisfying $gcd (n, p) = 1$ , and denote $R=\mathbb{F}_{p^m}[u]/…

Construction and enumeration for self-dual cyclic codes of even length over F2m​+uF2m​

An efficient method to construct self-dual cyclic codes of length ps over Fpm​+uFpm​

Explicit representation for a class of Type 2 constacyclic codes over the ring F2m​[u]/⟨u2λ⟩ with even length

An explicit representation and enumeration for self-dual cyclic codes over F2m​+uF2m​ of length 2s

A class of repeated-root constacyclic codes over Fpm​[u]/⟨ue⟩ of Type 2

Construction and enumeration for self-dual cyclic codes of even length over $F_{2^{m}} + u F_{2^{m}}$

An efficient method to construct self-dual cyclic codes of length $p^{s}$ over $F_{p^{m}} + u F_{p^{m}}$

Explicit representation for a class of Type 2 constacyclic codes over the ring $F_{2^{m}} [u] / ⟨ u^{2 λ} ⟩$ with even length

An explicit representation and enumeration for self-dual cyclic codes over $F_{2^{m}} + u F_{2^{m}}$ of length $2^{s}$

A class of repeated-root constacyclic codes over $F_{p^{m}} [u] / ⟨ u^{e} ⟩$ of Type $2$