Skip to main content
  • Textbook
  • © 1992

Introduction to Coding Theory

Authors:

Part of the book series: Graduate Texts in Mathematics (GTM, volume 86)

Buy it now

Buying options

eBook USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

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

Table of contents (11 chapters)

  1. Front Matter

    Pages i-xi
  2. Mathematical Background

    • J. H. van Lint
    Pages 1-21
  3. Shannon’s Theorem

    • J. H. van Lint
    Pages 22-30
  4. Linear Codes

    • J. H. van Lint
    Pages 31-41
  5. Some Good Codes

    • J. H. van Lint
    Pages 42-57
  6. Bounds on Codes

    • J. H. van Lint
    Pages 58-74
  7. Cyclic Codes

    • J. H. van Lint
    Pages 75-101
  8. Perfect Codes and Uniformly Packed Codes

    • J. H. van Lint
    Pages 102-117
  9. Goppa Codes

    • J. H. van Lint
    Pages 118-126
  10. Asymptotically Good Algebraic Codes

    • J. H. van Lint
    Pages 127-132
  11. Arithmetic Codes

    • J. H. van Lint
    Pages 133-140
  12. Convolutional Codes

    • J. H. van Lint
    Pages 141-154
  13. Back Matter

    Pages 155-186

About this book

The first edition of this book was conceived in 1981 as an alternative to outdated, oversized, or overly specialized textbooks in this area of discrete mathematics-a field that is still growing in importance as the need for mathematicians and computer scientists in industry continues to grow. The body of the book consists of two parts: a rigorous, mathematically oriented first course in coding theory followed by introductions to special topics. The second edition has been largely expanded and revised. The main editions in the second edition are: (1) a long section on the binary Golay code; (2) a section on Kerdock codes; (3) a treatment of the Van Lint-Wilson bound for the minimum distance of cyclic codes; (4) a section on binary cyclic codes of even length; (5) an introduction to algebraic geometry codes. Eindhoven J. H. VAN LINT November 1991 Preface to the First Edition Coding theory is still a young subject. One can safely say that it was born in 1948. It is not surprising that it has not yet become a fixed topic in the curriculum of most universities. On the other hand, it is obvious that discrete mathematics is rapidly growing in importance. The growing need for mathe­ maticians and computer scientists in industry will lead to an increase in courses offered in the area of discrete mathematics. One of the most suitable and fascinating is, indeed, coding theory.

Authors and Affiliations

  • Department of Mathematics, Eindhoven University of Technology, Eindhoven, The Netherlands

    J. H. Lint

Bibliographic Information

  • Book Title: Introduction to Coding Theory

  • Authors: J. H. Lint

  • Series Title: Graduate Texts in Mathematics

  • DOI: https://doi.org/10.1007/978-3-662-00174-5

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1992

  • eBook ISBN: 978-3-662-00174-5Published: 06 December 2012

  • Series ISSN: 0072-5285

  • Series E-ISSN: 2197-5612

  • Edition Number: 2

  • Number of Pages: XII, 186

  • Number of Illustrations: 11 b/w illustrations

  • Topics: Number Theory, Combinatorics

Buy it now

Buying options

eBook USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access