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

Khmaies Ouahada, Theo G. Swart, Hendrik C. Ferreira, Ling Cheng

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)141-154
Number of pages14
JournalDesigns, Codes, and Cryptography
Volume48
Issue number2
DOIs
Publication statusPublished - Aug 2008

Keywords

  • Constant weight codes
  • Insertion/deletion correcting codes
  • Permutation codes
  • Run-length limited codes
  • Spectral null codes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science Applications
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes'. Together they form a unique fingerprint.

Cite this