This course introduces the theory of error-correcting codes to computer scientists. This theory, dating back to the works of Shannon and Hamming from the late 40's, overflows with theorems, techniques, and notions of interest to theoretical computer scientists. The course will focus on results of asymptotic and algorithmic significance. Principal topics include: Construction and existence results for error-correcting codes. Limitations on the combinatorial performance of error-correcting codes. Decoding algorithms. Applications in computer science.
Coding for the AWGN channel; block and convolutional codes; lattice and trellis codes; capacity-approaching codes; equalization of linear Gaussian channels; linear, decision-feedback, and MLSD equalization; precoding; multicarrier modulation; and topics in wireless communication.
No restrictions on your remixing, redistributing, or making derivative works.
Give credit to the author, as required.
Your remixing, redistributing, or making derivatives works comes with some
restrictions, including how it is shared.
Your redistributing comes with some restrictions. Do not remix or make
derivative works.
Copyrighted materials, available under Fair Use and the TEACH Act for US-based
educators, or other custom arrangements. Go to the resource provider to see
their individual restrictions.
