Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes

被引：0
作者：
Khmaies Ouahada
Theo G. Swart
Hendrik C. Ferreira
Ling Cheng
机构：
[1] University of Johannesburg,Department of Electrical and Electronic Engineering Science
来源：
Designs, Codes and Cryptography | 2008年 / 48卷
关键词：
Permutation codes; Insertion/deletion correcting codes; Constant weight codes; Spectral null codes; Run-length limited codes; 20B30; 20B35; 68P30; 94A05; 94A24; 94B50; 94B60;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We investigate binary sequences which can be obtained by concatenating the columns of (0,1)-matrices derived from permutation sequences. We then prove that these binary sequences are subsets of a surprisingly diverse ensemble of codes, namely the Levenshtein codes, capable of correcting insertion/deletion errors; spectral null codes, with spectral nulls at certain frequencies; as well as being subsets of run-length limited codes, Nyquist null codes and constant weight codes.
引用
收藏
页码：141 / 154
页数：13
相关论文
共 22 条
[1]  
Agrell E.(2000)Upper bounds for constant-weight codes IEEE. Trans. Inf. Theory 46 2373-2395
[2]  
Vardy A.(1979)Coding with permutations Inf. Contr. 43 1-19
[3]  
Zeger K.(2003)Distance-preserving mappings from binary vectors to permutations IEEE. Trans. Inf. Theory 49 1054-1059
[4]  
Blake I.F.(2002)Construction of permutation arrays IEEE. Trans. Inf. Theory 48 977-980
[5]  
Cohen G.(1997)Insertion/deletion correction with spectral nulls IEEE. Trans. Inf. Theory 43 722-732
[6]  
Deza M.(1968)Alphabets with desirable frequency spectrum properties IBM J. Res. Dev. 12 234-241
[7]  
Chang J.C.(1966)Binary codes capable of correcting deletions, insertions and reversals Sov. Phys.-Doklady 10 707-710
[8]  
Chen R.J.(2000)Coded modulation for powerline communications AEÜ Int. J. Electron. Commun. 54 45-49
[9]  
Kløve T.(undefined)undefined undefined undefined undefined-undefined
[10]  
Tsai S.C.(undefined)undefined undefined undefined undefined-undefined
123