具有常数GC-含量的DNA码的界
Bounds for DNA codes with constant GC-content
摘要：
我们推导出理论上的上限和下界上的最大尺寸的DNA代码的长度为n与恒定的GC含量w和最小汉明距离d，无论有和没有额外的约束，任何码字和任何码字的反向互补之间的最小汉明距离至少是d。我们还显式地构造了比先前发表的最佳代码更大的代码，对于参数n，d和w的许多选择。
英文摘要：
We derive theoretical upper and lower bounds on the maximum size of DNA codes of length n with constant GC-content w and minimum Hamming distance d, both with and without the additional constraint that the minimum Hamming distance between any codeword and the reverse-complement of any codeword be at least d. We also explicitly construct codes that are larger than the best previously-published codes for many choices of the parameters n, d and w.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
