Skip to main content

Rectangular Basis of a Linear Code

  • Conference paper
  • First Online:
  • 465 Accesses

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

Abstract

A rectangular code is a code for which there exists an unique minimal trellis. Such a code can be considered to be an algebraically closed set under the rectangular complement operation. The notions of rectangular closure and basis were already defined. In this paper we represent a method to construct a rectangular basis of a linear code from a given linear basis.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Forney. Coset codes-part ii: Binary lattices and related codes. IEEE Trans. Inform. Theory, 34:1152–1187, 1988.

    Article  MathSciNet  Google Scholar 

  2. G. Graetzer. Universal Algebra. D. van Nostrand Company, Inc., London/Toronto/Melbourne, 1968.

    Google Scholar 

  3. F. Kschischang and V. Sorokine. On the trellis structure of block codes. IEEE Trans. Inform. Theory, 41:1924–1937, 1995.

    Article  MathSciNet  Google Scholar 

  4. J. Maucher. On the theory of rectangular codes. Ph.D Thesis,Department of Information Technology, University of Ulm, 1999.

    Google Scholar 

  5. D. Muder. Minimal trellises for block codes. IEEE Trans. Inform. Theory, 34: 1049–1053, 1988.

    Article  MathSciNet  Google Scholar 

  6. V. Sidorenko, G. Makarian, and B. Honary. Minimal trellis design for linear codes based on the shannon product. IEEE Trans. Inform. Theory, 42:2048–2053, 1996.

    Article  MathSciNet  Google Scholar 

  7. V. Sidorenko, J. Maucher, and M. Bossert. Rectangular codes and rectangular algebra. Proc. of 13.th AAECC Symposium, LNCS, Nov. 1999.

    MATH  Google Scholar 

  8. V. Sidorenko, J. Maucher, and M. Bossert. On the theory of rectangular codes. Proc. of 6.th International Workshop on Algebraic and Combinatorial Coding Theory, Sept. 1998.

    Google Scholar 

  9. V. Sidorenko, J. Maucher, M. Bossert, and R. Lucas. Rectangular codes in iterative decoding. Proc. of ITG Fachtagung, Jan. 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maucher, J., Bossert, M., Sidorenko, V. (1999). Rectangular Basis of a Linear Code. In: Walker, M. (eds) Cryptography and Coding. Cryptography and Coding 1999. Lecture Notes in Computer Science, vol 1746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46665-7_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-46665-7_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66887-9

  • Online ISBN: 978-3-540-46665-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics