|
|||||||||||||||||||||||||||||||||||
|
1 Review
|
Average Customer Review
Share your thoughts with other customers
Create your own review
|
|
Most Helpful First | Newest First
|
|
0 of 3 people found the following review helpful:
1.0 out of 5 stars
mistake on page 14,
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. |
|
Most Helpful First | Newest First
|
|
Introduction to Error Correcting Codes (Artech House Telecommunications Library) by Michael Purser (Hardcover - November 30, 1994)
$110.00
In Stock | |
 
| ||
