Asymmetric Lee distance codes: New bounds and constructions
Asymmetric Lee distance codes: New bounds and constructions
复制标题
非对称李距离代码：新的界限和结构
DOI：
--
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
O. Milenkovic
中科院分区：
文献类型：
--
作者：
Ryan Gabrys;Han Mao Kiah;O. Milenkovic
我们继续研究在设计和实现新兴的基于dna的存储系统和使用并行字符串传输协议的系统中出现的新的非对称李码家族。码字是在四元字母表上定义的，尽管结果可以转移到其他字母表大小，并且符号距离由其底层二进制表示决定。我们的贡献包括基于delsarte类线性规划方法推导出该度量中最大码的新边界，并描述了非线性非对称李码的新结构。
We continue our study of a new family of asymmetric Lee codes that arise in the design and implementation of emerging DNA-based storage systems and systems which use parallel string transmission protocols. The codewords are defined over a quaternary alphabet, although the results carry over to other alphabet sizes, and have symbol distances dictated by their underlying binary representation. Our contributions include deriving new bounds for the size of the largest code in this metric based on Delsarte-like linear programming methods and describing new constructions for non-linear asymmetric Lee codes.