EUVIMEDEUVIMED entdecken
Crossref

Constrained Coding Bounds via Goulden–Jackson Cluster Theorem

Yuanting Shen, Chong Shangguan, Zhicong Lin, Gennian Ge

IEEE Transactions on Information Theory · 2025-12 · 71 (12) · 9359-9374

DOI: 10.1109/tit.2025.3623586 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2025-12. Verfasst von Yuanting Shen und 3 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 78 Literaturangaben. Gefördert von: National Key Research and Development Program of China, National Natural Science Foundation of China, Beijing Scholars Program.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 cardinality of constrained codes for which the constraints can be characterized by a set of forbidden substrings, where by a substring we mean some consecutive coordinates in a string. The study of finite-type constrained codes, for which the set of forbidden substrings is finite, dated back to a pioneering and influential work of Shannon in the 1940s. To the best of our knowledge, for roughly 80 years, people have known essentially only one method, i.e., the “spectral method”, that computes the rate and the cardinality of finite-type constrained codes. We show that there is a surprisingly powerful method arising from enumerative combinatorics, which applies the Goulden-Jackson cluster theorem (previously not known to the coding community), that serves as an alternative method to compute the code rate and the exact cardinality of each fixed length, of these codes. Moreover, the computation can be done by solving a system of linear equations of size equal to the number of constraints, and the time complexity improves that of the spectral method when the number of constraints is relatively small. More interestingly, our new method has the flexibility that it also applies to constrained codes defined by an infinite number of forbidden substrings. As an example, variable-length non-overlapping codes have potential applications in DNA storage. Bilotta, also Wang and Wang asked for an explicit upper bound on the maximum cardinality of these codes. By applying the cluster method in concert with other tools in analytic combinatorics, we obtain such a bound, thereby giving an affirmative answer to their question. Moreover, our bound is tight when the code length divides the alphabet size, as shown by a construction of Blackburn. Lastly, we show that the spectral method and the cluster method are inherently related by establishing a direct connection between the spectral radius of the de Brujin graph used in the former and the convergence radius of the generating function used in the latter.

Förderung

  • National Key Research and Development Program of China
  • National Natural Science Foundation of China
  • Beijing Scholars Program
  • Fundamental Research Funds for the Central Universities

Zitieren

APA

Shen, Y., Shangguan, C., Lin, Z., & Ge, G. (2025). Constrained Coding Bounds via Goulden–Jackson Cluster Theorem. IEEE Transactions on Information Theory, 71(12), 9359-9374. https://doi.org/10.1109/tit.2025.3623586

Vancouver

Shen Y, Shangguan C, Lin Z, Ge G. Constrained Coding Bounds via Goulden–Jackson Cluster Theorem. IEEE Transactions on Information Theory. 2025;71(12):9359-9374. doi:10.1109/tit.2025.3623586

BibTeX
@article{Shen2025,
  author = {Shen, Yuanting and Shangguan, Chong and Lin, Zhicong and Ge, Gennian},
  title = {Constrained Coding Bounds via Goulden–Jackson Cluster Theorem},
  journal = {IEEE Transactions on Information Theory},
  year = {2025},
  volume = {71},
  number = {12},
  pages = {9359--9374},
  doi = {10.1109/tit.2025.3623586}
}
Kostenlos starten →