{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T12:23:00Z","timestamp":1780575780851,"version":"3.54.1"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T00:00:00Z","timestamp":1604188800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea (NRF) grant funded by the Korean Government","doi-asserted-by":"publisher","award":["NRF-2017R1D1A1B05030707"],"award-info":[{"award-number":["NRF-2017R1D1A1B05030707"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea (NRF) grant funded by the Korean Government","doi-asserted-by":"publisher","award":["NRF- 2017R1A6A3A11030486"],"award-info":[{"award-number":["NRF- 2017R1A6A3A11030486"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea (NRF) through the Basic Science Research Program funded by the Ministry of Education","doi-asserted-by":"publisher","award":["2019R1A6A1A11051177"],"award-info":[{"award-number":["2019R1A6A1A11051177"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea (NRF) grant funded by the Korea Government","doi-asserted-by":"publisher","award":["NRF-2017R1A2B2004574"],"award-info":[{"award-number":["NRF-2017R1A2B2004574"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1109\/tit.2020.2993179","type":"journal-article","created":{"date-parts":[[2020,5,7]],"date-time":"2020-05-07T20:20:21Z","timestamp":1588882821000},"page":"6762-6773","source":"Crossref","is-referenced-by-count":58,"title":["Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2917-5704","authenticated-orcid":false,"given":"Jong Yoon","family":"Hyun","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9611-8817","authenticated-orcid":false,"given":"Jungyun","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9510-3691","authenticated-orcid":false,"given":"Yoonjin","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.2361516"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2473861"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45066-1_2"},{"key":"ref13","author":"grassl","year":"2020","journal-title":"Bounds On The Minimum Distance Of Linear Codes And Quantum Codes"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056120"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2015.2455032"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2015.12.002"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511807077","author":"huffman","year":"2003","journal-title":"Fundamentals of Error-Correcting Codes"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/s00200-016-0292-9","article-title":"Three classes of binary linear codes with good parameters","volume":"27","author":"li","year":"2016","journal-title":"Applicable Algebra Eng Commun Comput"},{"key":"ref19","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1109\/MARK.1979.8817296","article-title":"Safeguarding cryptographic keys","volume":"48","author":"blakley","year":"1979","journal-title":"International Workshop on Managing Requirements Knowledge (MARK"},{"key":"ref3","first-page":"100","article-title":"A conjecture on the Griesmer boundary. (Russian) optimization methods and their applications","volume":"182","author":"belov","year":"1972","journal-title":"All-Union Summer Sem Khakusy Lake Baikal"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0442-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/18.2.97"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054512"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-3-642-45239-0_6","article-title":"On minimal and quasi-minimal linear codes","volume":"8308","author":"cohen","year":"2013","journal-title":"Cryptography and Coding"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.705584"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"367","DOI":"10.4169\/amer.math.monthly.122.04.367","article-title":"Face numbers of down-sets","volume":"122","author":"adamaszek","year":"2015","journal-title":"Amer Math Monthly"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2016.03.029"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref22","article-title":"It is indeed a fundamental construction of all linear codes","author":"xiang","year":"2016","journal-title":"arXiv 1610 06355"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90080-X"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.860412"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s12095-016-0199-0"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9234771\/09088995.pdf?arnumber=9088995","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:21:09Z","timestamp":1651080069000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9088995\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11]]},"references-count":24,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.2993179","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11]]}}}