Introduction to Error Correcting Codes (Artech House Telecommunications Library) [Hardcover]

Michael Purser (Author)

Book Description

Publication Date: November 30, 1994 | ISBN-10: 0890067848 | ISBN-13: 978-0890067840

This title covers the fundamentals of error-correcting codes for the non-specialist user, from general concepts through to the most common error-correcting codes applied to bit transmission in packet switched networks and personal cellular systems. It also includes sections on linear blockades, BCH codes and cyclic codes. The work is intended for professionals and students needing a thorough tutorial in error correction.

Product Details

• Hardcover: 148 pages
• Publisher: Artech House Publishers (November 30, 1994)
• Language: English
• ISBN-10: 0890067848
• ISBN-13: 978-0890067840
• Product Dimensions: 9.3 x 6.3 x 0.6 inches
• Shipping Weight: 12 ounces (View shipping rates and policies)
• Average Customer Review: 1.0 out of 5 stars  See all reviews (1 customer review)
• Amazon Best Sellers Rank: #5,508,562 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

0 of 3 people found the following review helpful:

1.0 out of 5 stars mistake on page 14, April 2, 2004

By A Customer

This review is from: Introduction to Error Correcting Codes (Artech House Telecommunications Library) (Hardcover)

I have to admit that I read only the first 14 pages of the book,
until I ran into a wrong proof of a wrong result - I am a beginner in the field and that was enough of the book for me. Purser proves that over all codewords any bit position has an equal number of 0's and 1's, for a linear code. However, consider a linear code: (000), (100), (010), (110). The last bit is always zero! If there are additional assumptions that are made - they are not stated, and
the proof is also wrong. The mistake in the proof - c2+e1 doesn't
have to be in the original subgroup - see the example above.