{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T02:01:32Z","timestamp":1768528892538,"version":"3.49.0"},"reference-count":14,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1109\/tit.2015.2496308","type":"journal-article","created":{"date-parts":[[2015,10,30]],"date-time":"2015-10-30T19:45:54Z","timestamp":1446234354000},"page":"121-130","source":"Crossref","is-referenced-by-count":13,"title":["The Random Coding Bound Is Tight for the Average Linear Code or Lattice"],"prefix":"10.1109","volume":"62","author":[{"given":"Yuval","family":"Domb","sequence":"first","affiliation":[]},{"given":"Ram","family":"Zamir","sequence":"additional","affiliation":[]},{"given":"Meir","family":"Feder","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2224145"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.2307\/1969027"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004100030656"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139045520"},{"key":"ref14","first-page":"1","article-title":"A simple proof for the existence of ‘good’ pairs of nested lattices","author":"ordentlich","year":"2012","journal-title":"Proc IEEE 27th Conv Elect Electron Eng Israel (IEEEI)"},{"key":"ref4","author":"barg","year":"0","journal-title":"On the Asymptotic Accuracy of the Union Bound"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.800480"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.822577"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(96)00107-0"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.312163"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.641543"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054971"},{"key":"ref1","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2249-9","author":"conway","year":"1993","journal-title":"Sphere Packings Lattices and Groups"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7360961\/07312995.pdf?arnumber=7312995","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:58:01Z","timestamp":1642003081000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7312995\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":14,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2496308","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1]]}}}