{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/6318"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/6318","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Optimal Lattice Codes For the Gaussian Channel","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>","abstract_html":"&lt;p&gt;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.&lt;/p&gt; &lt;p&gt;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.&lt;/p&gt;","abstract_has_math":false,"creators":["Kassem, Walid"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Electrical and Computer Engineering","school":null,"contributors":[],"advisors":["Anderson, J.","Buda, R. de"],"committee_chairs":[],"committee_members":[],"year":1981,"date_issued":"1981","date_published":"1981","updated_at":"2026-11-18T19:38:18Z","subjects":["Electrical and Computer Engineering"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/20562"],"render_values":[{"text":"https://doi.org/10.71548/20562","href":"https://doi.org/10.71548/20562","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/1637","2056","1240566"],"render_values":[{"text":"opendissertations/1637","href":null,"code":true},{"text":"2056","href":null,"code":true},{"text":"1240566","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/6318","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/6318","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F6318","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Anderson, J.","Buda, R. de"]},{"key":"dc:contributor.department","label":"Department","values":["Electrical and Computer Engineering"]},{"key":"dc:creator","label":"Author","values":["Kassem, Walid"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T16:34:55Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T16:34:55Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2010-03-23"]},{"key":"dc:date.issued","label":"Date","values":["1981"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical and Computer Engineering"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/1637","2056","1240566"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/6318","https://doi.org/10.71548/20562"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<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>"]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Doctor of Philosophy (PhD)"]},{"key":"dc:title","label":"Title","values":["Optimal Lattice Codes For the Gaussian Channel"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Anderson, J.","Buda, R. de"],"dc:contributor.department":["Electrical and Computer Engineering"],"dc:creator":["Kassem, Walid"],"dc:date.accessioned":["2014-06-18T16:34:55Z"],"dc:date.available":["2014-06-18T16:34:55Z"],"dc:date.created":["2010-03-23"],"dc:date.issued":["1981"],"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>"],"dc:description.degree":["Doctor of Philosophy (PhD)"],"dc:identifier.other":["opendissertations/1637","2056","1240566"],"dc:identifier.uri":["http://hdl.handle.net/11375/6318","https://doi.org/10.71548/20562"],"dc:subject":["Electrical and Computer Engineering"],"dc:title":["Optimal Lattice Codes For the Gaussian Channel"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:38:18Z"}