Skip to main content
Springer Nature Link
Log in

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

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Agrell E., Vardy A., Zeger K. (2000) Upper bounds for constant-weight codes. IEEE. Trans. Inf. Theory 46(7): 2373–2395

    Article  MATH  MathSciNet  Google Scholar 

  2. Blake I.F., Cohen G., Deza M. (1979) Coding with permutations. Inf. Contr. 43(1): 1–19

    Article  MATH  MathSciNet  Google Scholar 

  3. Chang J.C., Chen R.J., Kløve T., Tsai S.C. (2003) Distance-preserving mappings from binary vectors to permutations. IEEE. Trans. Inf. Theory 49(4): 1054–1059

    Article  MATH  Google Scholar 

  4. Ding C., Fu F.-W., Kløve T., Wei V.F.-W. (2002) Construction of permutation arrays. IEEE. Trans. Inf. Theory 48(4): 977–980

    Article  MATH  Google Scholar 

  5. Ferreira H.C., Vinck A.J.H.: Interference cancellation with permutation trellis codes. In: Proc 2000 IEEE Vehicular Tech Conf, Boston, MA, USA, pp. 2401–2407 (2000)

  6. Ferreira H.C., Clarke W.A., Helberg A.S.J., Abdel-Ghaffar K.A.S., Vinck A.J.H. (1997) Insertion/deletion correction with spectral nulls. IEEE. Trans. Inf. Theory 43(2): 722–732

    Article  MATH  Google Scholar 

  7. Gorog E. (1968) Alphabets with desirable frequency spectrum properties. IBM J. Res. Dev. 12: 234–241

    Article  Google Scholar 

  8. Immink K.A.S. (1999) Codes for Mass Data Storage Systems. Shannon Foundation Publishers, The Netherlands

    Google Scholar 

  9. Levenshtein V.I. (1966) Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys.-Doklady 10(8): 707–710

    MathSciNet  Google Scholar 

  10. Rains E., Sloane N.J.A.: Table of constant weight binary codes. http://www.research.att.com/~njas/codes/Andw/ (2005).

  11. Sloane N.J.A. (2002) On single-deletion-correcting codes. In: Arasu KT, Seress A (eds.) Codes and Designs. Ray-Chaudhuri Festschrift, Walter de Gruyter, Berlin, pp 273–291

    Google Scholar 

  12. Sloane N.J.A.: The on-line encyclopedia of integer sequences. http://www.research.att.com/~njas/sequences/ (2005).

  13. Swart T.G., de Beer I., Ferreira H.C.: On the distance optimality of permutation mappings. In: Proc. 2005 IEEE Intl. Symp. Inf. Theory, Adelaide, Australia, pp. 1068–1072 (2005).

  14. Vinck A.J.H. (2000) Coded modulation for powerline communications. AEÜ Int. J. Electron. Commun. 54(1): 45–49

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Electronic Engineering Science, University of Johannesburg, P.O. Box 524, Auckland Park, 2006, South Africa

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

Authors
  1. Khmaies Ouahada
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Theo G. Swart
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hendrik C. Ferreira
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ling Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hendrik C. Ferreira.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ouahada, K., Swart, T.G., Ferreira, H.C. et al. Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes. Des. Codes Cryptogr. 48, 141–154 (2008). https://doi.org/10.1007/s10623-007-9161-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-007-9161-7

Keywords

AMS Classifications

Search

Navigation