Skip to main content

Construction and Categories of Codes

  • Conference paper
Information Security and Privacy (ACISP 2000)

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

Included in the following conference series:

  • 514 Accesses

Abstract

Blakley and Borosh introduced a general theory of codes, encompassing cryptographic and error control codes among others. They explored the properties of such general codes with methods from relational algebra and set theory. We provide a categorical point of view, which leads to new constructions of codes. We also exhibit a Jordan-Hölder type theorem and a Schreier refinement technique.

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

Access this chapter

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.

References

  1. Arbib, M.A., Manes, E.: Arrows, Structures, and Functors – The Categorical Imperative. Academic Press, New York (1975)

    MATH  Google Scholar 

  2. Blakley, G.R., Borosh, I.: A general theory of codes, I: Basic concepts. In: Dorninger, D., Eigenthaler, G., Kaiser, H.K., Kautschistsch, H., More, W. (eds.) Proceedings of the Klagenfurt Conference, Contributions to General Algebra, vol. 10, pp. 1–29. Verlag Johannes Heyn, Klagenfurt, Austria (1998)

    Google Scholar 

  3. Blakley, G.R., Borosh, I.: A general theory of codes, II: Paradigms and homomorphisms. In: Okamoto, E. (ed.) ISW 1997. LNCS, vol. 1396, pp. 1–30. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  4. Calderbank, A.R., Sloane, N.J.A.: Modular and padic cyclic codes. Designs, Codes, and Cryptography 6, 21–35 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cohn, P.M.: Universal Algebra. D. Reidel Publishing Company, Dordrecht (1981) (revised edition)

    MATH  Google Scholar 

  6. Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Inform. Theory 22, 644–654 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  7. Mac Lane, S.: Categories for the Working Mathematician. Springer, Berlin (1971)

    MATH  Google Scholar 

  8. Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inform. Theory 24, 106–110 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  9. Purdy, G.P.: A high-security log-in procedure. Comm. of the ACM 17(4), 442–445 (1974)

    Article  MathSciNet  Google Scholar 

  10. Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Comm. ACM 21, 120–126 (1978)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Blakley, G.R., Borosh, I., Klappenecker, A. (2000). Construction and Categories of Codes. In: Dawson, E.P., Clark, A., Boyd, C. (eds) Information Security and Privacy. ACISP 2000. Lecture Notes in Computer Science, vol 1841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10718964_22

Download citation

  • DOI: https://doi.org/10.1007/10718964_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67742-0

  • Online ISBN: 978-3-540-45030-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics