{"title":"具有给定限制条件的 q-ary (1,k) - 无重叠编码","authors":"Xiaomiao Wang , Yu Fang , Tao Feng","doi":"10.1016/j.disc.2024.114236","DOIUrl":null,"url":null,"abstract":"<div><p>Two words <em>u</em> and <em>v</em> have a <em>t</em>-overlap if the length <em>t</em> prefix of <em>u</em> is equal to the length <em>t</em> suffix of <em>v</em>, or vice versa. A code <span><math><mi>C</mi></math></span> is <em>t</em>-overlap-free if no two words <em>u</em> and <em>v</em> in <span><math><mi>C</mi></math></span> (including <span><math><mi>u</mi><mo>=</mo><mi>v</mi></math></span>) have a <em>t</em>-overlap. A code of length <em>n</em> is said to be <span><math><mo>(</mo><msub><mrow><mi>t</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>t</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo></math></span>-overlap-free if it is <em>t</em>-overlap-free for all <em>t</em> such that <span><math><mn>1</mn><mo>⩽</mo><msub><mrow><mi>t</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>⩽</mo><mi>t</mi><mo>⩽</mo><msub><mrow><mi>t</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>⩽</mo><mi>n</mi><mo>−</mo><mn>1</mn></math></span>. A <span><math><mo>(</mo><mn>1</mn><mo>,</mo><mi>n</mi><mo>−</mo><mn>1</mn><mo>)</mo></math></span>-overlap-free code of length <em>n</em> is called non-overlapping, which has applications in DNA-based data storage systems and frame synchronization. In this paper, we initialize the study for codes of length <em>n</em> which are simultaneously <span><math><mo>(</mo><mn>1</mn><mo>,</mo><mi>k</mi><mo>)</mo></math></span>-overlap-free and <span><math><mo>(</mo><mi>n</mi><mo>−</mo><mi>k</mi><mo>,</mo><mi>n</mi><mo>−</mo><mn>1</mn><mo>)</mo></math></span>-overlap-free, and establish lower and upper bounds for the size of balanced and error-correcting <span><math><mo>(</mo><mn>1</mn><mo>,</mo><mi>k</mi><mo>)</mo></math></span>-overlap-free codes.</p></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 1","pages":"Article 114236"},"PeriodicalIF":0.7000,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0012365X24003674/pdfft?md5=832dbe1e406e021c0d775dae451bb738&pid=1-s2.0-S0012365X24003674-main.pdf","citationCount":"0","resultStr":"{\"title\":\"q-ary (1,k)-overlap-free codes with given restrictions\",\"authors\":\"Xiaomiao Wang , Yu Fang , Tao Feng\",\"doi\":\"10.1016/j.disc.2024.114236\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Two words <em>u</em> and <em>v</em> have a <em>t</em>-overlap if the length <em>t</em> prefix of <em>u</em> is equal to the length <em>t</em> suffix of <em>v</em>, or vice versa. A code <span><math><mi>C</mi></math></span> is <em>t</em>-overlap-free if no two words <em>u</em> and <em>v</em> in <span><math><mi>C</mi></math></span> (including <span><math><mi>u</mi><mo>=</mo><mi>v</mi></math></span>) have a <em>t</em>-overlap. A code of length <em>n</em> is said to be <span><math><mo>(</mo><msub><mrow><mi>t</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>t</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo></math></span>-overlap-free if it is <em>t</em>-overlap-free for all <em>t</em> such that <span><math><mn>1</mn><mo>⩽</mo><msub><mrow><mi>t</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>⩽</mo><mi>t</mi><mo>⩽</mo><msub><mrow><mi>t</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>⩽</mo><mi>n</mi><mo>−</mo><mn>1</mn></math></span>. A <span><math><mo>(</mo><mn>1</mn><mo>,</mo><mi>n</mi><mo>−</mo><mn>1</mn><mo>)</mo></math></span>-overlap-free code of length <em>n</em> is called non-overlapping, which has applications in DNA-based data storage systems and frame synchronization. In this paper, we initialize the study for codes of length <em>n</em> which are simultaneously <span><math><mo>(</mo><mn>1</mn><mo>,</mo><mi>k</mi><mo>)</mo></math></span>-overlap-free and <span><math><mo>(</mo><mi>n</mi><mo>−</mo><mi>k</mi><mo>,</mo><mi>n</mi><mo>−</mo><mn>1</mn><mo>)</mo></math></span>-overlap-free, and establish lower and upper bounds for the size of balanced and error-correcting <span><math><mo>(</mo><mn>1</mn><mo>,</mo><mi>k</mi><mo>)</mo></math></span>-overlap-free codes.</p></div>\",\"PeriodicalId\":50572,\"journal\":{\"name\":\"Discrete Mathematics\",\"volume\":\"348 1\",\"pages\":\"Article 114236\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S0012365X24003674/pdfft?md5=832dbe1e406e021c0d775dae451bb738&pid=1-s2.0-S0012365X24003674-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0012365X24003674\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X24003674","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
摘要
如果 u 的前缀长度 t 等于 v 的后缀长度 t,或反之亦然,则两个词 u 和 v 有 t 重叠。如果 C 中没有两个词 u 和 v(包括 u=v)有 t 重叠,则代码 C 无 t 重叠。如果长度为 n 的代码对所有 t 都是无 t 重叠的,且 1⩽t1⩽t⩽t2⩽n-1。长度为 n 的(1,n-1)无重叠编码称为无重叠编码,它可应用于基于 DNA 的数据存储系统和帧同步。本文初步研究了长度为 n、同时具有 (1,k)-overlap-free 和 (n-k,n-1)-overlap-free 的编码,并建立了平衡编码和纠错 (1,k)-overlap-free 编码大小的下限和上限。
q-ary (1,k)-overlap-free codes with given restrictions
Two words u and v have a t-overlap if the length t prefix of u is equal to the length t suffix of v, or vice versa. A code is t-overlap-free if no two words u and v in (including ) have a t-overlap. A code of length n is said to be -overlap-free if it is t-overlap-free for all t such that . A -overlap-free code of length n is called non-overlapping, which has applications in DNA-based data storage systems and frame synchronization. In this paper, we initialize the study for codes of length n which are simultaneously -overlap-free and -overlap-free, and establish lower and upper bounds for the size of balanced and error-correcting -overlap-free codes.
期刊介绍:
Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory.
Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.