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

Authors:
Khmaies Ouahada;Theo G. Swart;Hendrik C. Ferreira;Ling Cheng
Affiliations:
Department of Electrical and Electronic Engineering Science, University of Johannesburg, Auckland Park, South Africa 2006;Department of Electrical and Electronic Engineering Science, University of Johannesburg, Auckland Park, South Africa 2006;Department of Electrical and Electronic Engineering Science, University of Johannesburg, Auckland Park, South Africa 2006;Department of Electrical and Electronic Engineering Science, University of Johannesburg, Auckland Park, South Africa 2006
Venue:
Designs, Codes and Cryptography
Year:
2008

Citing 4
Cited 0

Insertion/deletion correction with spectral nulls

IEEE Transactions on Information Theory
Upper bounds for constant-weight codes

IEEE Transactions on Information Theory
Constructions of permutation arrays

IEEE Transactions on Information Theory
Distance-preserving mappings from binary vectors to permutations

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.