将有理独立语言嵌入极大语言
Embedding rationally independent languages into maximal ones
摘要:
我们考虑编码理论中的嵌入问题:给定一个独立性(一个与编码相关的性质)和一个独立语言$L$,找到一个包含$L$的最大独立语言.我们考虑的情况下,代码相关的属性是通过一个合理的二元关系,是减少相对于任何固定的总顺序的话。我们的方法的工作原理是通过迭代的最大-最小运算符,已被用于之前的嵌入问题的长度增加和传递的二元关系定义的属性。通过去降阶有理关系,表示输入减少换能器,我们能够包括许多已知的属性从编码理论的无噪声和噪声域,以及这些属性的任何组合。此外,在许多情况下,期望的最大嵌入是有效地可计算的。
英文摘要:
We consider the embedding problem in coding theory: given an independence (a code-related property) and an independent language $L$, find a maximal independent language containing $L$. We consider the case where the code-related property is defined via a rational binary relation that is decreasing with respect to any fixed total order on the set of words. Our method works by iterating a max-min operator that has been used before for the embedding problem for properties defined by length-increasing-and-transitive binary relations. By going to order-decreasing rational relations, represented by input-decreasing transducers, we are able to include many known properties from both the noiseless and noisy domains of coding theory, as well as any combination of such properties. Moreover, in many cases the desired maximal embedding is effectively computable.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。