Coding theory a first course Linginstant download
Coding theory a first course Linginstant download
or textbooks at https://ebookultra.com
_____ Follow the link below to get your download now _____
https://ebookultra.com/download/coding-theory-a-first-
course-ling/
https://ebookultra.com/download/a-first-course-in-network-theory-1st-
edition-ernesto-estrada/
https://ebookultra.com/download/introduction-to-coding-theory-2nd-
edition-bierbrauer/
https://ebookultra.com/download/riemann-surfaces-and-algebraic-curves-
a-first-course-in-hurwitz-theory-1st-edition-renzo-cavalieri/
Logical Reasoning A First Course Rob P. Nederpelt
https://ebookultra.com/download/logical-reasoning-a-first-course-rob-
p-nederpelt/
https://ebookultra.com/download/electronics-a-first-course-third-
edition-owen-bishop/
https://ebookultra.com/download/a-first-course-on-
aerodynamics-2012-edition-arnab-roy/
https://ebookultra.com/download/a-first-course-of-mathematical-
analysis-david-alexander-brannan/
https://ebookultra.com/download/a-first-course-in-integral-
equations-2ed-edition-wazwaz/
Coding theory a first course Ling Digital Instant
Download
Author(s): Ling, San;Xing, Chaoping
ISBN(s): 9780521821919, 0521821916
Edition: Repr
File Details: PDF, 1.36 MB
Year: 2010
Language: english
This page intentionally left blank
Coding Theory
A First Course
The authors of this book have, for several years, successfully taught a course on coding
theory to students at the National University of Singapore. This book is based on their
experiences and provides a thoroughly modern introduction to the subject. There is a
wealth of examples and exercises, some of which introduce students to novel or more
advanced material.
Coding Theory
A First Course
SAN LING
CHAOPING XING
National University of Singapore
Cambridge, New York, Melbourne, Madrid, Cape Town, Singapore, São Paulo
Cambridge University Press has no responsibility for the persistence or accuracy of s
for external or third-party internet websites referred to in this publication, and does not
guarantee that any content on such websites is, or will remain, accurate or appropriate.
To Mom and Dad
and my beloved wife Bee Keow
S. L.
Preface page xi
1 Introduction 1
Exercises 4
2 Error detection, correction and decoding 5
2.1 Communication channels 5
2.2 Maximum likelihood decoding 8
2.3 Hamming distance 8
2.4 Nearest neighbour/minimum distance decoding 10
2.5 Distance of a code 11
Exercises 14
3 Finite fields 17
3.1 Fields 17
3.2 Polynomial rings 22
3.3 Structure of finite fields 26
3.4 Minimal polynomials 30
Exercises 36
4 Linear codes 39
4.1 Vector spaces over finite fields 39
4.2 Linear codes 45
4.3 Hamming weight 46
4.4 Bases for linear codes 48
4.5 Generator matrix and parity-check matrix 52
4.6 Equivalence of linear codes 56
4.7 Encoding with a linear code 57
4.8 Decoding of linear codes 59
vii
viii Contents
4.8.1 Cosets 59
4.8.2 Nearest neighbour decoding for linear codes 61
4.8.3 Syndrome decoding 62
Exercises 66
5 Bounds in coding theory 75
5.1 The main coding theory problem 75
5.2 Lower bounds 80
5.2.1 Sphere-covering bound 80
5.2.2 Gilbert–Varshamov bound 82
5.3 Hamming bound and perfect codes 83
5.3.1 Binary Hamming codes 84
5.3.2 q-ary Hamming codes 87
5.3.3 Golay codes 88
5.3.4 Some remarks on perfect codes 92
5.4 Singleton bound and MDS codes 92
5.5 Plotkin bound 95
5.6 Nonlinear codes 96
5.6.1 Hadamard matrix codes 98
5.6.2 Nordstrom–Robinson code 98
5.6.3 Preparata codes 99
5.6.4 Kerdock codes 99
5.7 Griesmer bound 100
5.8 Linear programming bound 102
Exercises 106
6 Constructions of linear codes 113
6.1 Propagation rules 113
6.2 Reed–Muller codes 118
6.3 Subfield codes 121
Exercises 126
7 Cyclic codes 133
7.1 Definitions 133
7.2 Generator polynomials 136
7.3 Generator and parity-check matrices 141
7.4 Decoding of cyclic codes 145
7.5 Burst-error-correcting codes 150
Exercises 153
Contents ix
References 215
Bibliography 217
Index 219
Preface
xi
xii Preface
linear algebra. The results on finite fields needed in the book are covered in
Chapter 3.
The design of good codes, from both the theoretical and practical points of
view, is a very important problem in coding theory. General bounds on the
parameters of codes are often used as benchmarks to determine how good a
given code is, while, from the practical perspective, a code must admit an effi-
cient decoding scheme before it can be considered useful. Since the beginning
of coding theory, researchers have done much work in these directions and, in
the process, have constructed many interesting families of codes. This book is
built pretty much around these themes. A fairly detailed discussion on some
well known bounds is included in Chapter 5, while quite a number of decoding
techniques are discussed throughout this book. An effort is also made to in-
troduce systematically many of the well known families of codes, for example,
Hamming codes, Golay codes, Reed–Muller codes, cyclic codes, BCH codes,
Reed–Solomon codes, alternant codes, Goppa codes, etc.
In order to stay sufficiently focused and to keep the book within a manageable
size, we have to omit certain well established topics or examples, such as a
thorough treatment of weight enumerators, from our discussion. Wherever
possible, we try to include some of these omitted topics in the exercises at
the end of each chapter. More than 250 problems have been included to help
strengthen the reader’s understanding and to serve as an additional source of
examples and results.
Finally, it is a pleasure for us to acknowledge the help we have received
while writing this book. Our research work in coding theory has received
generous financial assistance from the Ministry of Education (Singapore), the
National University of Singapore, the Defence Science and Technology
Agency (Singapore) and the Chinese Academy of Sciences. We are thank-
ful to these organizations for their support. We thank those who have read
through the drafts carefully and provided us with invaluable feedback, espe-
cially Fangwei Fu, Wilfried Meidl, Harald Niederreiter, Yuansheng Tang (who
has also offered us generous help in the preparation of Section 9.4), Arne
Winterhof and Sze Ling Yeo, as well as the students in the classes MA3218
and MA4261. David Chew has been most helpful in assisting us with problems
concerning LATEX, and we are most grateful for his help. We would also like to
thank Shanthi d/o Devadas for secretarial help.
1 Introduction
Example 1.0.1 Consider the source encoding of four fruits, apple, banana,
cherry, grape, as follows:
apple → 00, banana → 01, cherry → 10, grape → 11.
Suppose the message ‘apple’, which is encoded as 00, is transmitted over a
noisy channel. The message may become distorted and may be received as 01
(see Fig. 1.2). The receiver may not realize that the message was corrupted.
This communication fails.
The idea of channel coding is to encode the message again after the source
coding by introducing some form of redundancy so that errors can be detected
or even corrected. Thus, Fig. 1.1 becomes Fig. 1.3.
Fig. 1.1.
1
Exploring the Variety of Random
Documents with Different Content
“Promoted breeding cattle,
To make the Cretans bloodier in battle;
For we all know that English people are
Fed upon beef. . . . .
We know, too, they are very fond of war—
A pleasure—like all pleasures—rather dear.”
1.D. The copyright laws of the place where you are located also
govern what you can do with this work. Copyright laws in most
countries are in a constant state of change. If you are outside
the United States, check the laws of your country in addition to
the terms of this agreement before downloading, copying,
displaying, performing, distributing or creating derivative works
based on this work or any other Project Gutenberg™ work. The
Foundation makes no representations concerning the copyright
status of any work in any country other than the United States.
1.E.6. You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form,
including any word processing or hypertext form. However, if
you provide access to or distribute copies of a Project
Gutenberg™ work in a format other than “Plain Vanilla ASCII” or
other format used in the official version posted on the official
Project Gutenberg™ website (www.gutenberg.org), you must,
at no additional cost, fee or expense to the user, provide a copy,
a means of exporting a copy, or a means of obtaining a copy
upon request, of the work in its original “Plain Vanilla ASCII” or
other form. Any alternate format must include the full Project
Gutenberg™ License as specified in paragraph 1.E.1.
• You pay a royalty fee of 20% of the gross profits you derive
from the use of Project Gutenberg™ works calculated using the
method you already use to calculate your applicable taxes. The
fee is owed to the owner of the Project Gutenberg™ trademark,
but he has agreed to donate royalties under this paragraph to
the Project Gutenberg Literary Archive Foundation. Royalty
payments must be paid within 60 days following each date on
which you prepare (or are legally required to prepare) your
periodic tax returns. Royalty payments should be clearly marked
as such and sent to the Project Gutenberg Literary Archive
Foundation at the address specified in Section 4, “Information
about donations to the Project Gutenberg Literary Archive
Foundation.”
• You comply with all other terms of this agreement for free
distribution of Project Gutenberg™ works.
1.F.
1.F.1. Project Gutenberg volunteers and employees expend
considerable effort to identify, do copyright research on,
transcribe and proofread works not protected by U.S. copyright
law in creating the Project Gutenberg™ collection. Despite these
efforts, Project Gutenberg™ electronic works, and the medium
on which they may be stored, may contain “Defects,” such as,
but not limited to, incomplete, inaccurate or corrupt data,
transcription errors, a copyright or other intellectual property
infringement, a defective or damaged disk or other medium, a
computer virus, or computer codes that damage or cannot be
read by your equipment.
Most people start at our website which has the main PG search
facility: www.gutenberg.org.
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
ebookultra.com