Skip to main content
SpringerLink
Log in

Optimal Difference Systems of Sets with Multipliers

  • Conference paper
Computer Science – Theory and Applications (CSR 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3967))

Included in the following conference series:

Abstract

Difference Systems of Sets (DSS) are combinatorial structures that are used in code synchronization. A DSS is optimal if the associated code has minimum redundancy for the given block length n, alphabet size q, and error-correcting capacity ρ. An algorithm is described for finding optimal DSS that admit prescribed symmetries defined by automorphisms of the cyclic group of order n, together with optimal DSS found by this algorithm.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baumert, L.D.: Cyclic Difference Sets. Springer, Heidelberg (1971)

    Book  MATH  Google Scholar 

  2. Clague, D.J.: New classes of synchronous codes. IEEE Trans. on Electronic Computers EC-16, 290–298

    Google Scholar 

  3. Crick, H.C., Griffith, J.S., Orgel, L.E.: Codes without commas. Proc. Nat. Acad. Sci. 43, 416–421 (1957)

    Article  MathSciNet  Google Scholar 

  4. Cumming, L.J.: A Family of Circular Systematic Comma-Free Codes (to appear)

    Google Scholar 

  5. Golomb, S.W., Gordon, B., Welch, L.R.: Comma-free code. Canad. J. Math. 10(2), 202–209 (1958)

    Article  MathSciNet  MATH  Google Scholar 

  6. Hall Jr., M.: Combinatorial Theory, 2nd edn. Wiley, New York (1986)

    MATH  Google Scholar 

  7. Levenshtein, V.I.: One method of constructing quasilinear codes providing synchronization in the presence of errors. Problems of Information Transmission 7(3), 215–222 (1971)

    Google Scholar 

  8. Levenshtein, V.I.: Combinatorial problems motivated by comma-free codes. J. of Combinatorial Designs 12(3), 184–196 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Mutoh, Y., Tonchev, V.D.: Difference Systems of Sets and Cyclotomy. Discrete Math. (to appear)

    Google Scholar 

  10. Tonchev, V.D.: Difference systems of sets and code synchronization. Rendiconti del Seminario Matematico di Messina, Series II, vol. 9, pp. 217–226 (2003)

    Google Scholar 

  11. Tonchev, V.D.: Partitions of difference sets and code synchronization. Finite Fields and their Applications, Finite Fields and Their Appl. 11, 601–621 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Tonchev, V.D., Wang, H.: An algorithm for optimal difference systems of sets. J. Discrete Optimization (accepted)

    Google Scholar 

  13. Wang, H.: A New Bound for Difference Systems of Sets. J. of Combinatorial Mathematics and Combinatorial Computing (to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Michigan Technological University, Houghton, MI, 49931-1295, USA

    Vladimir D. Tonchev & Hao Wang

Authors
  1. Vladimir D. Tonchev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IRMAR, Université de Rennes, Campus de Beaulieu, 35042, Rennes Cedex, France

    Dima Grigoriev

  2. Intel Corporation, JF1-13, 2111 NE 25th Avenue, 97124, Hillsboro, OR, USA

    John Harrison

  3. Steklov Institute of Mathematics at St. Petersburg, 27 Fontanka, St., 191023, Petersburg, Russia

    Edward A. Hirsch

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tonchev, V.D., Wang, H. (2006). Optimal Difference Systems of Sets with Multipliers. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds) Computer Science – Theory and Applications. CSR 2006. Lecture Notes in Computer Science, vol 3967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753728_61

Download citation

  • DOI: https://doi.org/10.1007/11753728_61

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34166-6

  • Online ISBN: 978-3-540-34168-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation