default search action
Bac Trong Nguyen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Hai Q. Dinh, Ha T. Le, Bac Trong Nguyen, Paravee Maneejuk:
δ-dual codes over finite commutative semi-simple rings. Appl. Algebra Eng. Commun. Comput. 35(3): 315-335 (2024) - [j16]Hai Q. Dinh, Hieu V. Ha
, Bac Trong Nguyen, Thieu N. Vo:
Two new classes of AMDS symbol-pair cyclic codes of length 4p. J. Appl. Math. Comput. 70(5): 4117-4131 (2024) - 2023
- [j15]Hai Q. Dinh, Bac Trong Nguyen, Roengchai Tansuchat:
Quantum MDS and synchronizable codes from cyclic codes of length 5ps over 픽pm. Appl. Algebra Eng. Commun. Comput. 34(6): 931-964 (2023) - [j14]Hai Q. Dinh, Bac Trong Nguyen, Hiep T. Luu
On Symbol-Triple Distance of a Class of Constacyclic Codes of Length 3ps Over Fpm + uFpm. IEEE Access 11: 23578-23585 (2023) - [j13]Hai Q. Dinh
Self-Dual Double Circulant, Self-Dual Double Negacirculant and LCD Double Negacirculant Codes Over the Ring Fq[u,v]/2 - u, v2-v, uv-vu>. IEEE Access 11: 92898-92912 (2023) - [j12]Hai Q. Dinh, Bac Trong Nguyen, Hiep L. Thi, Woraphon Yamaka:
On Hamming distance distributions of repeated-root constacyclic codes of length 3ps over Fpm+uFpm. Discret. Math. 346(12): 113593 (2023) - [j11]Hai Q. Dinh, Bac Trong Nguyen, Paravee Maneejuk, Hiep L. Thi, Thang M. Vo:
Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length 3ps. Quantum Inf. Process. 22(6): 257 (2023) - 2022
- [j10]Hai Q. Dinh, Bac Trong Nguyen, Hiep L. Thi
On Hamming Distance Distributions of Repeated-Root Cyclic Codes of Length 5ps Over Fp m + uFp m. IEEE Access 10: 119883-119904 (2022) - [j9]Hai Q. Dinh, Bac Trong Nguyen, Paravee Maneejuk:
Constacyclic codes of length 8ps over 픽pm + u픽pm. Adv. Math. Commun. 16(3): 525-570 (2022) - 2021
- [j8]Hai Q. Dinh
MDS Constacyclic Codes and MDS Symbol-Pair Constacyclic Codes. IEEE Access 9: 137970-137990 (2021) - [j7]Hai Q. Dinh
Some Classes of New Quantum MDS and Synchronizable Codes Constructed From Repeated-Root Cyclic Codes of Length 6ps. IEEE Access 9: 138543-138552 (2021) - [j6]Hai Q. Dinh, Ha T. Le, Bac Trong Nguyen, Roengchai Tansuchat:
Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length 4ps over ${\mathbb {F}}_{p^m}$. Quantum Inf. Process. 20(11): 373 (2021) - 2020
- [j5]Hai Q. Dinh
Quantum MDS and Synchronizable Codes From Cyclic and Negacyclic Codes of Length 2ps Over Fpm. IEEE Access 8: 124608-124623 (2020) - [j4]Hai Q. Dinh
Constacyclic Codes of Length 3ps Over Fpm + uFpm and Their Application in Various Distance Distributions. IEEE Access 8: 204031-204056 (2020) - [j3]Hai Q. Dinh
MDS Symbol-Pair Cyclic Codes of Length 2ps over 𝔽pm. IEEE Trans. Inf. Theory 66(1): 240-262 (2020)
2010 – 2019
- 2018
- [j2]Hai Q. Dinh
Hamming and Symbol-Pair Distances of Repeated-Root Constacyclic Codes of Prime Power Lengths Over 𝔽pm+u𝔽pm. IEEE Commun. Lett. 22(12): 2400-2403 (2018) - [j1]Hai Q. Dinh
On the Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths. IEEE Trans. Inf. Theory 64(4): 2417-2430 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: