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

doi:10.1007/s10623-007-9161-7

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

Electrical and Electronic Engineering Science

University of Johannesburg

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	141-154
Number of pages	14
Journal	Designs, Codes, and Cryptography
Volume	48
Issue number	2
DOIs	https://doi.org/10.1007/s10623-007-9161-7
Publication status	Published - 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

Access to Document

10.1007/s10623-007-9161-7

Cite this

@article{04c10c0b747746a0a8acbbec2aea9e83,

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

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.",

keywords = "Constant weight codes, Insertion/deletion correcting codes, Permutation codes, Run-length limited codes, Spectral null codes",

author = "Khmaies Ouahada and Swart, \{Theo G.\} and Ferreira, \{Hendrik C.\} and Ling Cheng",

year = "2008",

month = aug,

doi = "10.1007/s10623-007-9161-7",

language = "English",

volume = "48",

pages = "141--154",

journal = "Designs, Codes, and Cryptography",

issn = "0925-1022",

publisher = "Springer Netherlands",

number = "2",

}

TY - JOUR

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

AU - Ouahada, Khmaies

AU - Swart, Theo G.

AU - Ferreira, Hendrik C.

AU - Cheng, Ling

PY - 2008/8

Y1 - 2008/8

N2 - 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.

AB - 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.

KW - Constant weight codes

KW - Insertion/deletion correcting codes

KW - Permutation codes

KW - Run-length limited codes

KW - Spectral null codes

UR - https://www.scopus.com/pages/publications/43949114873

U2 - 10.1007/s10623-007-9161-7

DO - 10.1007/s10623-007-9161-7

M3 - Article

AN - SCOPUS:43949114873

SN - 0925-1022

VL - 48

SP - 141

EP - 154

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

IS - 2

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this