Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/6318
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Anderson, J. | en_US |
dc.contributor.advisor | Buda, R. de | en_US |
dc.contributor.author | Kassem, Walid | en_US |
dc.date.accessioned | 2014-06-18T16:34:55Z | - |
dc.date.available | 2014-06-18T16:34:55Z | - |
dc.date.created | 2010-03-23 | en_US |
dc.date.issued | 1981 | en_US |
dc.identifier.other | opendissertations/1637 | en_US |
dc.identifier.other | 2056 | en_US |
dc.identifier.other | 1240566 | en_US |
dc.identifier.uri | http://hdl.handle.net/11375/6318 | - |
dc.description.abstract | <p>Lattices are used to construct a class of equal-energy codes for the Gaussian channel and the resultant error probability tends to zero for large n at all rates below channel capacity. The error probability is explicitly bounded for any given lattice code and then further further bounded for a general code using the Minkowski-Hlawka theorem of the geometry of numbers. Similar bounds are applied also to maximum-energy codes, to show that such lattice codes are near-optimal.</p> <p>Finally, the error bounds are applied to explicit codes defined for all n=2ᵐ. These codes are shown to have a low Pℯ at rates higher than any previously attained.</p> | en_US |
dc.subject | Electrical and Computer Engineering | en_US |
dc.subject | Electrical and Computer Engineering | en_US |
dc.title | Optimal Lattice Codes For the Gaussian Channel | en_US |
dc.type | thesis | en_US |
dc.contributor.department | Electrical and Computer Engineering | en_US |
dc.description.degree | Doctor of Philosophy (PhD) | en_US |
Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
File | Size | Format | |
---|---|---|---|
fulltext.pdf | 5.45 MB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.