Zobrazeno 1 - 10
of 281
pro vyhledávání: '"Nguyen︎, Tuan Thanh"'
Autor:
Ding, Yi, He, Xuan, Nguyen, Tuan Thanh, Song, Wentu, Yakhini, Zohar, Yaakobi, Eitan, Pan, Linqiang, Tang, Xiaohu, Cai, Kui
DNA-based data storage has been attracting significant attention due to its extremely high data storage density, low power consumption, and long duration compared to conventional data storage media. Despite the recent advancements in DNA data storage
Externí odkaz:
http://arxiv.org/abs/2410.04886
The problem of correcting deletions and insertions has recently received significantly increased attention due to the DNA-based data storage technology, which suffers from deletions and insertions with extremely high probability. In this work, we stu
Externí odkaz:
http://arxiv.org/abs/2311.04578
DiffSpectralNet : Unveiling the Potential of Diffusion Models for Hyperspectral Image Classification
Hyperspectral images (HSI) have become popular for analysing remotely sensed images in multiple domain like agriculture, medical. However, existing models struggle with complex relationships and characteristics of spectral-spatial data due to the mul
Externí odkaz:
http://arxiv.org/abs/2312.12441
In this work, we investigate a challenging problem, which has been considered to be an important criterion in designing codewords for DNA computing purposes, namely secondary structure avoidance in single-stranded DNA molecules. In short, secondary s
Externí odkaz:
http://arxiv.org/abs/2302.13714
In this work, we present a new version of non-binary VT codes that are capable of correcting a single deletion or single insertion. Moreover, we provide the first known linear time algorithms that encode user messages into these codes of length n ove
Externí odkaz:
http://arxiv.org/abs/2212.10721
In this work, we study two types of constraints on two-dimensional binary arrays. In particular, given $p,\epsilon>0$, we study (i) The $p$-bounded constraint: a binary vector of size $m$ is said to be $p$-bounded if its weight is at most $pm$, and (
Externí odkaz:
http://arxiv.org/abs/2208.09138
We study and propose schemes that map messages onto constant-weight codewords using variable-length prefixes. We provide polynomial-time computable formulas that estimate the average number of redundant bits incurred by our schemes. In addition to th
Externí odkaz:
http://arxiv.org/abs/2204.13831
Autor:
Yang, Yun-Jung, Lee, Yong Seong, Tae, Jong Hyun, Choi, Joongwon, Kim, Jung Hoon, Yang, Eun-Jung, Nguyen, Tuan Thanh, Choi, Se Young
Publikováno v:
In European Journal of Surgical Oncology December 2024 50(12)
Autor:
Nguyen, Thai Anh, Dang, Vu Bich Hanh, Dang, Viet Hung, Vo, Quy Tuan, Nguyen, Tuan Thanh, Nguyen, Vinh Tien
Publikováno v:
In Desalination and Water Treatment October 2024 320
In this paper, we present an explicit construction of list-decodable codes for single-deletion and single-substitution with list size two and redundancy 3log n+4, where n is the block length of the code. Our construction has lower redundancy than the
Externí odkaz:
http://arxiv.org/abs/2201.02013