In fulfillment of one of my 2015 goals, I started reading A Book of Abstract Algebra by Charles Pinter this year. Reading a math book isn’t the same as reading most prose. You have to engage with the text in a different way, doing at least as much as reading. Among other things, many books include much of their content in the exercises. Pinter definitely is one of those books.
The book surprised me by having more applications (and earlier in it) than I expected. Thus, I started a repository for code I write for this book. Automata appears in the second chapter, for example. One of the problem sets in particular grabbed my attention: maximum-likelihood decoding. The rest of this post mostly explains to my future self why and how I did what I did. If it helps another “independent student” like me, great! But I can’t promise I can answer questions about it very well.
Note to self: get MathJax working in Jekyll at some point.
Understanding the theory here involves two key realizations.
- Only certain codewords are valid, due to the use of specific bits within the word as parity checks (a form of error checking).
- The distance between any two codewords (the weight their XOR) is the minimum number of bit flips to change one codeword into another.
Therefore, if we receive an invalid word, we check to see which valid codeword is “nearest” to it. In a code where the minimum distance is 2, that means that flipping a single bit in a word can always be detected. Flipping two bits, though, may mean that we get another “valid” codeword in error. Larger minimum distances help. If the minimum distance is m, then we can always detect errors of m-1 bits (because those can never result in another valid codeword). Even better, we can correct errors of (m-1)/2 bits or fewer. We do this by finding the minimum distance between the received word and the valid codewords (XORing and calculating the weight), then correcting to the nearest one.
This exposed some gaps in my knowledge of Python around bitwise operators. It didn’t help that the problem labels the bits in an awkward fashion (at least to my programmer-mind), since it starts by labeling the most significant bit a1. I don’t doubt that Python has easier ways to do all this, but I couldn’t find them and wanted to focus on the math more than the code. So first I wrote a quick function to slice out a given bit from the word:
I also refreshed my memory on the format string specifications. For outputting a number as a five-bit word, for example,
print format(num, '05b') makes things nice and neat. So does LaTeX in IPython, enclosing the markup text in
$ for inline or
$$ for new lines!
Calculating the binary weight (number of 1s) is a little goofy to me. Literally I have to convert it to a string first, then count the instances of the substring