Update cookies preferences

E-book: Course in Algebraic Error-Correcting Codes

  • Format - PDF+DRM
  • Price: 49,39 €*
  • * the price is final i.e. no additional discount will apply
  • Add to basket
  • Add to Wishlist
  • This ebook is for personal use only. E-Books are non-refundable.

DRM restrictions

  • Copying (copy/paste):

    not allowed

  • Printing:

    not allowed

  • Usage:

    Digital Rights Management (DRM)
    The publisher has supplied this book in encrypted form, which means that you need to install free software in order to unlock and read it.  To read this e-book you have to create Adobe ID More info here. Ebook can be read and downloaded up to 6 devices (single user with the same Adobe ID).

    Required software
    To read this ebook on a mobile device (phone or tablet) you'll need to install this free app: PocketBook Reader (iOS / Android)

    To download and read this eBook on a PC or Mac you need Adobe Digital Editions (This is a free app specially developed for eBooks. It's not the same as Adobe Reader, which you probably already have on your computer.)

    You can't read this ebook with Amazon Kindle

This textbook provides a rigorous mathematical perspective on error-correcting codes, starting with the basics and progressing through to the state-of-the-art. Algebraic, combinatorial, and geometric approaches to coding theory are adopted with the aim of highlighting how coding can have an important real-world impact. Because it carefully balances both theory and applications, this book will be an indispensable resource for readers seeking a timely treatment of error-correcting codes.





Early chapters cover fundamental concepts, introducing Shannons theorem, asymptotically good codes and linear codes. The book then goes on to cover other types of codes including chapters on cyclic codes, maximum distance separable codes, LDPC codes, p-adic codes, amongst others. Those undertaking independent study will appreciate the helpful exercises with selected solutions.











A Course in Algebraic Error-Correcting Codes suits an interdisciplinary audience atthe Masters level, including students of mathematics, engineering, physics, and computer science. Advanced undergraduates will find this a useful resource as well. An understanding of linear algebra is assumed.

Reviews

Merit of this book is its ability to bring together many topics, including current research, in a compact volume. Moreover, throughout the book, the author provides exercises that stimulate the interest of the reader. The style is clear and the topics are well presented, which makes the understanding of the subject approachable even for students coming from applied sciences. This is a remarkable textbook for a self-contained introduction to the theory of error-correcting codes and some of their modern topics. (Matteo Bonini, zbMATH 1454.94142, 2021)

Table of Parameters for Codes in the Text
ix
1 Shannon's Theorem
1(16)
1.1 Entropy
1(3)
1.2 Information Channels
4(1)
1.3 System Entropies and Mutual Information
5(5)
1.4 Decoding and Transmission Rate
10(1)
1.5 Shannon's Theorem
11(3)
1.6 Comments
14(1)
1.7 Exercises
14(3)
2 Finite Fields
17(12)
2.1 Definitions and Construction
17(3)
2.2 Properties of Finite Fields
20(1)
2.3 Factorisation of Cyclotomic Polynomials
21(3)
2.4 Affine and Projective Spaces over Finite Fields
24(2)
2.5 Comments
26(1)
2.6 Exercises
26(3)
3 Block Codes
29(18)
3.1 Minimum Distance
29(3)
3.2 Bounds on Block Codes
32(4)
3.3 Asymptotically Good Codes
36(7)
3.4 Comments
43(1)
3.5 Exercises
43(4)
4 Linear Codes
47(24)
4.1 Preliminaries
47(4)
4.2 Syndrome Decoding
51(3)
4.3 Dual Code and the MacWilliams Identities
54(4)
4.4 Linear Codes and Sets of Points in Projective Spaces
58(1)
4.5 Griesmer Bound
59(4)
4.6 Constructing Designs from Linear Codes
63(3)
4.7 Comments
66(1)
4.8 Exercises
67(4)
5 Cyclic Codes
71(12)
5.1 Basic Properties
71(4)
5.2 Quadratic Residue Codes
75(3)
5.3 BCH Codes
78(2)
5.4 Comments
80(1)
5.5 Exercises
81(2)
6 Maximum Distance Separable Codes
83(22)
6.1 Singleton Bound
84(1)
6.2 Reed--Solomon Code
84(7)
6.3 Linear MDS Codes
91(3)
6.4 MDS Conjecture
94(6)
6.5 Comments
100(1)
6.6 Exercises
101(4)
7 Alternant and Algebraic Geometric Codes
105(18)
7.1 Subfield Subcodes
105(2)
7.2 Generalised Reed--Solomon Codes
107(2)
7.3 Alternant Codes Meeting the Gilbert--Varshamov Bound
109(3)
7.4 Algebraic Geometric Codes
112(5)
7.5 Algebraic Geometric Codes Surpassing the Gilbert--Varshamov Bound
117(2)
7.6 Comments
119(1)
7.7 Exercises
119(4)
8 Low Density Parity Check Codes
123(10)
8.1 Bipartite Graphs with the Expander Property
123(3)
8.2 Low Density Parity Check Codes
126(2)
8.3 Decoding LDPC Codes
128(3)
8.4 Comments
131(1)
8.5 Exercises
131(2)
9 Reed-Muller and Kerdock Codes
133(18)
9.1 Binary Reed-Muller Codes
133(2)
9.2 Decoding Reed--Muller Codes
135(7)
9.3 Kerdock Codes
142(3)
9.4 Non-binary Reed--Muller Codes
145(3)
9.5 Comments
148(1)
9.6 Exercises
149(2)
10 p-Adic Codes
151(14)
10.1 p-Adic Numbers
151(2)
10.2 Polynomials over the p-Adic Numbers
153(2)
10.3 p-Adic Codes
155(2)
10.4 Codes over Z/pAZ
157(3)
10.5 Codes over Z/4Z
160(2)
10.6 Comments
162(1)
10.7 Exercises
162(3)
Hints and Answers to Selected Exercises 165(5)
Bibliography 170(5)
Index 175
Simeon Ball is Senior Lecturer of Mathematics at Universitat Politècnica de Catalunya in Barcelona, Spain. He has been invited speaker at many international conferences, as well as serving on the scientific and organising committee for the Fq series of conferences. His research interests include classical and quantum error-correcting codes, incidence problems in real and finite geometries, graphs and semifields, and is particularly focused on applying geometrical and algebraic methods to these combinatorial objects. He also serves on the editorial board of the Journal of Geometry, having previously served on the editorial board of Designs, Codes and Cryptography and Finite Fields and Their Applications.