| 混合长度为{4,5,6}的完备删位纠错码的存在性 |
| |
| 引用本文： | 刘海波,廖群英. 混合长度为{4,5,6}的完备删位纠错码的存在性[J]. 数学学报, 2015, 58(6): 977-984 |
| |
| 作者姓名： | 刘海波 廖群英 |
| |
| 作者单位： | 四川师范大学数学与软件科学学院 成都 610068 |
| |
| 基金项目： | 国家自然科学基金资助项目(11401408);四川省教育厅科研重点项目(14ZA0034);四川师范大学科研重点项目(12ZDL06) |
| |
| 摘 要： | 依据刻画空间中向量间距离方式的不同,可定义不同的纠错码.Levenshtein定义了莱文斯坦距离,由此定义了删位纠错码.本文借助组合设计理论中的成对平衡设计以及初等数论的方法和技巧,给出参数为T{2,{4,5,6},v}的完备删位纠错码存在的两个必要条件,并确定了,当v≥4且v■{8,9,14}时,存在参数为T{2,{4,5,6},v}的完备删位纠错码.
|
| 关 键 词： | 莱文斯坦距离 完备删位纠错码 有向成对平衡设计 |
The Existence of the Perfect Deletion Code with Mixed Length {4, 5, 6} |
| |
| Hai bo LIU,Qun Ying LIAO. The Existence of the Perfect Deletion Code with Mixed Length {4, 5, 6}[J]. Acta Mathematica Sinica, 2015, 58(6): 977-984 |
| |
| Authors: | Hai bo LIU Qun Ying LIAO |
| |
| Affiliation: | Institute of Mathematics and Software Science, Sichuan Normal University, Chengdu 610068, P. R. China |
| |
| Abstract: | One can define different error-correcting codes, according to different ways of describing the distance between two vectors in vector spaces. The deletion errorcorrecting code is defined by Levenshtein distance. In this paper, with a positive integer v fixed, some necessary conditions for the existence of the perfect deletion error-correcting code T{2, {4, 5, 6}, v} are obtained, by the method and technique of the elementary number theory and directed pairwise balanced designs. In particular, for v ≥ 4 and v ∉ {8, 9, 14}, there exists a perfect deletion error-correcting code with parameters T{2, {4, 5, 6}, v}. |
| |
| Keywords: | Levenshtein distance perfect deletion error-correcting code directed pairwise balanced design |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《数学学报》浏览原始摘要信息 |
|
点击此处可从《数学学报》下载全文 |
|
