{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T16:11:21Z","timestamp":1698336681727},"reference-count":15,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"vor","delay-in-days":5674,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Trans Emerging Tel Tech"],"published-print":{"date-parts":[[1993,3]]},"abstract":"Abstract<\/jats:title>The definition and basic properties of lattice codes for the Gaussian channel are first recalled. Then, an estimation of the code rate and bounds on the error probability are presented. Lattice codes are shown to exit which reach the channel capacity. Separate coding and shape gains are introduced. Finally, the asymptotic behaviour of lattice codes is examined and we are led to conjecture that achieving capacity is a covering \u2010 rather than packing \u2010 problem.<\/jats:p>","DOI":"10.1002\/ett.4460040208","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T12:07:23Z","timestamp":1221221243000},"page":"133-140","source":"Crossref","is-referenced-by-count":0,"title":["On Lattice Coding for the Gaussian Channel"],"prefix":"10.1002","volume":"4","author":[{"given":"H\u00e9lio Magalh\u00e4es De","family":"Oliveira","sequence":"first","affiliation":[]},{"given":"G\u00e9rard","family":"Battail","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Principles of communication engineering","author":"Wozencraft J. M.","year":"1965"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2016-7"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1109\/49.29611","article-title":"Multidimensional constellations \u2010part I: introduction, figures of merit, and generalized cross constellations","author":"Forney G. D.","year":"1989","journal-title":"J. Select. Areas Commun."},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/TIT.1982.1056483","article-title":"Voronoi regions of lattices, second moments of polytopes. and quantization","author":"Conway J. H.","year":"1982","journal-title":"IEE Trans. Info. Theory"},{"key":"e_1_2_1_6_2","unstructured":"H.Magalhaes de Oliveira G.Battail:A capacity theorem for lattice codes on gaussian channels. \u201cProc. IEEE\/SBT Int. Symp. Telecomm.\u201d Sept.1990 Rio de Janeiro Brazil p.1.2.1\u20131.2.5."},{"issue":"7","key":"e_1_2_1_7_2","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF03004043","article-title":"Performance of lattice codes over the Gaussian channel","volume":"47","author":"Magalhaes de Oliveira H.","year":"1992","journal-title":"Annales Telecomm."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1949.232969"},{"key":"e_1_2_1_9_2","volume-title":"Handbook of mathematical functions","author":"Abramowitz M.","year":"1970"},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1109\/TIT.1975.1055409","article-title":"The upper error bound of a new near\u2010optimal code","volume":"21","author":"de Buda R.","year":"1975","journal-title":"IEEE Trans. Info. Theory"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1109\/49.29612","article-title":"Some optimal codes have structure","author":"de Buda R.","year":"1989","journal-title":"IEEE J. Select. Areas on Commun."},{"key":"e_1_2_1_12_2","unstructured":"H.Magalh\u00e4es de Oliveira G.Battail:Random coded modulation: performance and euclidean distance spectrum evaluation. 1991 IEEE Int. Symp. Info. Theory ISIT \u203291. Budapest Hungary June1991."},{"issue":"3","key":"e_1_2_1_12_3","first-page":"107","volume":"47","year":"1992","journal-title":"Ann. T\u00e9l\u00e9comm."},{"key":"e_1_2_1_13_2","doi-asserted-by":"crossref","first-page":"1123","DOI":"10.1109\/18.21245","article-title":"Coset Codes \u2010 part I: Introduction and geometrical classification","volume":"34","author":"Fomey G. D.","year":"1988","journal-title":"IEEE Trans. Info. Theory"},{"issue":"6","key":"e_1_2_1_14_2","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1109\/49.29618","article-title":"A leech lattice MODEM","author":"Lang G. R.","year":"1989","journal-title":"IEEE J. Select. Areas Commun."},{"issue":"7","key":"e_1_2_1_15_2","first-page":"392","article-title":"Construction explicite de bans codes longs","volume":"44","author":"Battail G.","year":"1989","journal-title":"Ann The comm."}],"container-title":["European Transactions on Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fett.4460040208","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/ett.4460040208","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T17:02:44Z","timestamp":1698253364000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/ett.4460040208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["10.1002\/ett.4460040208"],"URL":"https:\/\/doi.org\/10.1002\/ett.4460040208","archive":["Portico"],"relation":{},"ISSN":["1124-318X","1541-8251"],"issn-type":[{"value":"1124-318X","type":"print"},{"value":"1541-8251","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}