Embedded Files
I am currently a Research Fellow II at the Singapore University of Technology and Design (SUTD), with the Advanced Coding and Signal Processing (ACSP) Lab of SUTD.
I received a B.Sc. degree with First Class Honours (now officially called Honours (Highest Distinction)) and a Ph.D. degree in mathematics from the Nanyang Technological University (NTU), Singapore, in 2014 and 2018, respectively. Before joining SUTD, I was a Research Fellow at the School of Physical and Mathematical Sciences (SPMS), NTU.
My research is centered around the field of information theory. Information theory, by its nature, is closely connected to several areas of mathematics and computer science, drawing motivation from enhancing the reliability of transmitting (or storing) information in communication channels (or storage systems). My research employs concepts and techniques from theoretical mathematics and computer science, specifically combinatorics, algorithms, coding, and optimization.
I am a Senior Member of the IEEE, the IEEE Information Theory Society, and the IEEE Young Professionals.
Follow my research update at:
My Research Gate or My Google Scholar
Contact me via my email:
tuanthanh_nguyen at sutd dot edu dot sg
NEWS in 2026
NEWS in 2026
19 Oct 2026. Journal Paper accepted. Our manuscript titled "Efficient Constrained Coding for Composite DNA: Channel Capacity and Constructions of Capacity-Approaching Codes" has been accepted for publication in the IEEE Transactions on Information Theory (IEEE TIT) (to appear) ...
Link to full-version: to be updated ...
Paper's abstract:
"Composite DNA is a recent novel method to increase the information capacity of DNA-based data storage above the theoretical limit of 2 bits/symbol. In this method, every composite symbol does not store a single DNA nucleotide but a mixture of the four nucleotides in a predetermined ratio. By using different mixtures and ratios, the alphabet can be extended to have far more than four symbols compared to the naive approach. While this method enables higher data content per synthesis cycle, potentially reducing the DNA synthesis cost, it also imposes significant challenges for accurate DNA sequencing since the base-level errors can easily change the mixture of bases and their ratio, resulting in changes to the composite symbols.
With this motivation, we propose efficient constrained coding techniques to enforce the biological constraints, including the runlength-limited constraint and the GC-content constraint, into every DNA synthesized oligo, regardless of the mixture of bases in each composite letter and their corresponding ratio, and regardless of the positions of the composite letters in each data sequence. This approach plays a crucial role in reducing the occurrence of errors. Our goals include computing the capacity of the constrained channel, constructing efficient encoders/decoders, and providing the best options for the composite letters to obtain capacity-approaching codes, particularly focusing on the parameters where the channel capacity is strictly larger than 2 bits/symbol. To the best of our knowledge, no such codebooks are known prior to this work. For certain codes’ parameters, our methods incur only one redundant symbol"
(Submission deadline: November 2026, extended deadline). I am serving as a Guest Editor for the Special Issue “Coding and Signal Processing for Data Storage Systems” in the journal Entropy (MDPI).
The goal of the Special Issue is to showcase new research that addresses both the theoretical and practical aspects of coding and signal processing for data storage systems.
Submission deadline: November 2026. All papers will be reviewed as soon as they are submitted. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. The call will remain open until the end of November 2026.
More details can be found at https://www.mdpi.com/journal/entropy/special_issues/06A246JQDW
Feel free to share this with colleagues who might be interested.
28 June – 3 July 2026: Attended IEEE ISIT 2026 and Delivered Three Presentations
We attended the 2026 IEEE International Symposium on Information Theory (IEEE ISIT), held from 28 June to 3 July 2026 in Guangzhou, China, where we presented three accepted papers. IEEE ISIT is the flagship conference of the IEEE Information Theory Society and one of the most prestigious conferences in the field of information theory. All three papers were accepted in March 2026. The details of the papers are as follows:
D. Hanania, T. T. Nguyen, K. Cai, E. Yaakobi and Y. M. Chee, "DNA Labeling with Composite Symbols," 2026 IEEE International Symposium on Information Theory (ISIT), Guangzhou, China, 2026, pp. 1-6, doi: 10.1109/ISIT62367.2026.11653892. Link to view and download the paper in IEEE Explore: https://ieeexplore.ieee.org/document/11653892
T. T. Nguyen, P. H. Siegel, K. Cai and Y. M. Chee, "Nonbinary Single-Edit Correcting Codes Using Balanced Unary Transformation," 2026 IEEE International Symposium on Information Theory (ISIT), Guangzhou, China, 2026, pp. 1-6, doi: 10.1109/ISIT62367.2026.11653634. Link to view and download the paper in IEEE Explore: https://ieeexplore.ieee.org/document/11653634
Z. Li, T. T. Nguyen, K. Cai, X. He and X. Tang, "Coding for DNA Synthesis Repeats," 2026 IEEE International Symposium on Information Theory (ISIT), Guangzhou, China, 2026, pp. 1-6, doi: 10.1109/ISIT62367.2026.11654128. Link to view and download the paper in IEEE Explore: https://ieeexplore.ieee.org/document/11654128
ISIT 2026 invited submission of manuscripts on all classical topics of Information Theory such as Shannon Theory, Coding Theory and Techniques, Information Security, Signal Detection and Estimation, etc. ISIT 2026 also encourages submissions on frontier cross-disciplinary research that blends Information Theory with diverse subjects including but not limited to Bioinformatics, Machine Learning, Artificial Intelligence, DNA Storage and Quantum Information.
More information can be found at: https://2026.ieee-isit.org/
9 Jan 2026. Journal Paper accepted. Our manuscript titled "Concatenated Constrained Coding: A New Approach to Efficient Constant-Weight Codes" has been accepted for publication in the Entropy 2026, 28(1), 78; Link to view and download the paper (open access): https://doi.org/10.3390/e28010078
This article belongs to the Special Issue Coding and Signal Processing for Data Storage Systems
Paper's abstract:
The design of low-complexity and efficient constrained codes has been a major research item for many years. This paper reports on a versatile method named concatenated constrained codes for designing efficient fixed-length constrained codes with small complexity. A concatenated constrained code comprises two (or more) cooperating constrained codes of low complexity enabling long constrained codes that are not practically feasible with prior art methods. We apply the concatenated coding approach to two case studies, namely the design of constant-weight and low-weight codes. In a binary constant-weight code, each codeword has the same number, w, of 1’s, where w is called the weight of a codeword. We specifically focus on the trading between coder complexity and redundancy.
Refer to the full paper for more information.
Page updated
Google Sites
Report abuse