Yonglin Cao

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

Hai Q. Dinh, Yuan Cao, Somphong Jitman, 2019 .

Explicit Representation and Enumeration of Repeated-Root (δ + αu²)-Constacyclic Codes Over F₂m[u]/‹u2λ›

Hai Q. Dinh, Woraphon Yamaka, Tushar Bag, 2020, IEEE Access.