{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T14:30:04Z","timestamp":1769265004495,"version":"3.49.0"},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1109\/tit.2022.3183619","type":"journal-article","created":{"date-parts":[[2022,6,16]],"date-time":"2022-06-16T19:36:11Z","timestamp":1655408171000},"page":"7096-7099","source":"Crossref","is-referenced-by-count":7,"title":["On the Trifference Problem for Linear Codes"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3757-2526","authenticated-orcid":false,"given":"Cosmin","family":"Pohoata","sequence":"first","affiliation":[{"name":"Department of Mathematics, Yale University, New Haven, CT, USA"}]},{"given":"Dmitriy","family":"Zakharov","sequence":"additional","affiliation":[{"name":"Laboratory of Combinatorial and Geometric Structures, MIPT, Dolgoprudny, Russia"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"A Guide to LaTeX","author":"Kopka","year":"1999"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548398003411"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90013-4"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057187"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2020.105335"},{"key":"ref6","article-title":"New bounds for perfect $k$-hashing","author":"Costa","year":"2020","journal-title":"arXiv:2002.11025"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2017.185.1.7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2017.185.1.8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006811"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/0605009"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2021.105580"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-012-0020-5"},{"key":"ref13","first-page":"411","article-title":"Coding of an information source having ambiguous alphabet and the entropy of graphs","volume-title":"Proc. 6th Prague Conf. Inf. Theory","author":"K\u0151rner"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(88)80048-9"},{"key":"ref15","volume-title":"A Symmetric Formulation Croot-Lev-Pach-Ellenberg-Gijswijt Capset Bound","author":"Tao","year":"2016"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9925894\/09797776.pdf?arnumber=9797776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T05:03:40Z","timestamp":1706763820000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9797776\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11]]},"references-count":15,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3183619","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11]]}}}