Hai Q. Dinh

most citedRepeated-root constacyclic codes of length

2 ℓ^{m} p^{n}

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

cs.IT2014

Polyadic Constacyclic Codes

Bocong Chen, Hai Q. Dinh, Yun Fan +1

For any given positive integer $m$ , a necessary and sufficient condition for the existence of Type I $m$ -adic constacyclic codes is given. Further, for any given integer $s$ , a nec…

cs.IT2014★ 1 cited

Repeated-root constacyclic codes of length $2 ℓ^{m} p^{n}$

Bocong Chen, Hai Q. Dinh, Hongwei Liu

For any different odd primes $ℓ$ and $p$ , structure of constacyclic codes of length $2 ℓ^{m} p^{n}$ over a finite field $F_{q}$ of characteritic $p$ and their duals is establ…

Polyadic Constacyclic Codes

Repeated-root constacyclic codes of length 2ℓmpn

Repeated-root constacyclic codes of length $2 ℓ^{m} p^{n}$