Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Optimal 2-Dimensional 3-Dispersion Lattices

  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2643))

  • 724 Accesses

Abstract

We examine 2-dimensional 3-dispersion lattice interleavers in three connectivity models: the rectangular grid with either 4 or 8 neighbors, and the hexagonal grid. We provide tight lower bounds on the interleaving degree in all cases and show lattices which achieve the bounds.

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

Access this chapter

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Similar content being viewed by others

References

  1. Abdel-Ghaffar, K.A.S., McEliece, R.J., van Tilborg, H.C.A.: Two-dimensional burst identification codes and their use in burst correction. IEEE Trans. on Inform. Theory 34 (1988) 494–504

    Article  MATH  Google Scholar 

  2. Blaum, M., Farrell, P.G.: Array codes for cluster-error correction. Electronic Letters 30 (1994) 1752–1753

    Article  Google Scholar 

  3. Farrell, P.G.: Array codes for correcting cluster-error patterns. In: Proc. IEE Conf. Elect. Signal Processing (York, England). (1982)

    Google Scholar 

  4. Imai, R.M.: Two-dimensional fire codes. IEEE Trans. on Inform. Theory 19 (1973) 796–806

    Article  MATH  MathSciNet  Google Scholar 

  5. Imai, R.M.: A theory of two-dimensional cyclic codes. Inform. and Control 34 (1977) 1–21

    Article  MATH  MathSciNet  Google Scholar 

  6. Blaum, M., Bruck, J., Vardy, A.: Interleaving schemes for multidimensional cluster errors. IEEE Trans. on Inform. Theory 44 (1998) 730–743

    Article  MATH  MathSciNet  Google Scholar 

  7. Etzion, T., Vardy, A.: Two-dimensional interleaving schemes with repetitions: constructions and bounds. IEEE Trans. on Inform. Theory 48 (2002) 428–457

    Article  MATH  MathSciNet  Google Scholar 

  8. Etzion, T., Schwartz, M., Vardy, A.: Optimal tristance anticodes. manuscript in preparation, October 2002.

    Google Scholar 

  9. Schwartz, M., Etzion, T.: Optimal 2-dimensional 3-dispersion lattices. manuscript in preparation, August 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schwartz, M., Etzion, T. (2003). Optimal 2-Dimensional 3-Dispersion Lattices. In: Fossorier, M., Høholdt, T., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2003. Lecture Notes in Computer Science, vol 2643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44828-4_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-44828-4_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40111-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics