{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:55:23Z","timestamp":1740131723329,"version":"3.37.3"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CAREER DMS-1753260"],"award-info":[{"award-number":["CAREER DMS-1753260"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Sloan Research Fellowship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1109\/tit.2022.3170341","type":"journal-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T21:12:24Z","timestamp":1650921144000},"page":"6388-6401","source":"Crossref","is-referenced-by-count":0,"title":["Distribution of the Minimum Distance of Random Linear Codes"],"prefix":"10.1109","volume":"68","author":[{"given":"Jing","family":"Hao","sequence":"first","affiliation":[{"name":"Department of Mathematics, Georgia Tech, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5694-7701","authenticated-orcid":false,"given":"Han","family":"Huang","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Georgia Tech, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Galyna V.","family":"Livshyts","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Georgia Tech, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantin","family":"Tikhomirov","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Georgia Tech, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1952.tb01393.x"},{"issue":"5","key":"ref2","first-page":"739","article-title":"The evaluation of signals in codes with correction of errors","volume":"117","author":"Var\u0161amov","year":"1957","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054893"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/mana.19821090103"},{"issue":"3","key":"ref5","first-page":"715","article-title":"What is the maximum number of points on a curve over F\u2082?","volume":"28","author":"Manin","year":"1981","journal-title":"J. Fac. Sci. Univ. Tokyo Sect. IA Math."},{"issue":"4","key":"ref6","first-page":"423","article-title":"Bounds for codes","volume":"333","author":"Goppa","year":"1993","journal-title":"Dokl. Acad. Nauk."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831751"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-8256-9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055688"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90002-Y"},{"issue":"1","key":"ref11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1008260505585","article-title":"On upper bounds for minimum distance and covering radius of non-binary codes","volume":"14","author":"Laihonen","year":"1998","journal-title":"Des., Codes Cryptogr."},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2007.1.83"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.800480"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20879"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.853300"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928288"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(79)90084-0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(69)80045-1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.2307\/2308881"},{"volume-title":"Essential Coding Theory","year":"2019","author":"Guruswami","key":"ref21"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9893495\/9762946-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9893495\/09762946.pdf?arnumber=9762946","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T21:27:20Z","timestamp":1705958840000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9762946\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":21,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3170341","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2022,10]]}}}