2 papers
cs.IT2024
Constrained coding upper bounds via Goulden-Jackson cluster theorem
Yuanting Shen, Chong Shangguan, Zhicong Lin +1
Motivated by applications in DNA-based data storage, constrained codes have attracted a considerable amount of attention from both academia and industry. We study the maximum cardi…
cs.IT2023
When can an expander code correct errors in time?
Kuan Cheng, Minghui Ouyang, Chong Shangguan +1
Tanner codes are graph-based linear codes whose parity-check matrices can be characterized by a bipartite graph together with a linear inner code . Expander codes are Tann…