{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T11:22:49Z","timestamp":1790680969872,"version":"4.1.0"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11171370"],"award-info":[{"award-number":["11171370"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11271005"],"award-info":[{"award-number":["11271005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Central China Normal University, Wuhan, China, within the Excellent Doctoral Dissertation Cultivation","award":["2013YBYB43"],"award-info":[{"award-number":["2013YBYB43"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1109\/tit.2014.2368138","type":"journal-article","created":{"date-parts":[[2014,11,7]],"date-time":"2014-11-07T15:29:56Z","timestamp":1415374196000},"page":"82-90","source":"Crossref","is-referenced-by-count":36,"title":["Thresholds of Random Quasi-Abelian Codes"],"prefix":"10.1109","volume":"61","author":[{"given":"Yun","family":"Fan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liren","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2004.10.002"},{"key":"ref11","first-page":"123","article-title":"Weighted modules and representations of codes","volume":"6","author":"heise","year":"1998","journal-title":"Proc ACC"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-67994-0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.100207"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003833"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055262"},{"key":"ref17","article-title":"Random quasi-abelian codes and self-orthogonal negacyclic codes","author":"lin","year":"2014"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.809501"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.907500"},{"key":"ref28","first-page":"739","article-title":"Estimate of the number of signals in error correcting codes","volume":"117","author":"varshamov","year":"1957","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref4","first-page":"39","article-title":"New lower bounds for the minimal distance of linear quasicyclic and almost linear cyclic codes","volume":"28","author":"chepyzhov","year":"1992","journal-title":"Problemy Peredachi Inf"},{"key":"ref27","first-page":"43","article-title":"On weight enumerators of some codes","volume":"22","author":"shparlinsky","year":"1986","journal-title":"Problemy Peredechi Inf"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(69)90497-5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102416192"},{"key":"ref29","first-page":"201","article-title":"Quasi-abelian codes","volume":"21","author":"wasan","year":"1977","journal-title":"Pub Inst Math"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref8","article-title":"Cumulative distance enumerators of random codes and their thresholds","author":"fan","year":"2012"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9726-y"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.876244"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.11.004"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.800480"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055150"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001"},{"key":"ref21","author":"mcdonald","year":"1974","journal-title":"Finite Rings with Identity"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"99","DOI":"10.3934\/amc.2007.1.99","article-title":"Gilbert–Varshamov type bounds for linear codes over finite chain rings","volume":"1","author":"\u00f6zbudak","year":"2007","journal-title":"Adv Math Commun"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057061"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054053"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6994912\/06949686.pdf?arnumber=6949686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:27:50Z","timestamp":1641986870000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6949686\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":29,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2368138","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}