Logins are currently disabled.
ERA is undergoing scheduled maintenance this morning and is currently only available as read-only. If you have questions or concerns, please email erahelp@ualberta.ca.
Search
Skip to Search Results- 2Insertion/deletion channels
- 1Asynchronization
- 1Binary erasure channel (BEC)
- 1Binary symmetric channel (BSC)
- 1Capacity expansion
- 1Channel codes
-
Spring 2013
One of the most stunning results of information theory is the channel coding theorem addressing the maximum rate of reliable communication over a noisy channel, known as channel capacity. In this thesis, we consider two problems emerging from the classic channel coding theorem. First, we study...
-
Fall 2012
For successful correction of errors in a digital communication system, information about the channel, such as timing, noise power, fading gain, etc., should normally be available at the receiver. To this end, most receivers use channel parameter estimation and timing recovery modules. However,...