{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:27Z","timestamp":1773376947313,"version":"3.50.1"},"reference-count":38,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195475","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Bounding the Capacity of the Multinomial Channel Using KL Divergence Covering and Packing"],"prefix":"10.1109","author":[{"given":"Jennifer","family":"Tang","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology,Laboratory for Information and Decision Systems and Institute for Data, Systems, and Society,Cambridge,MA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2001.935990"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/jsait.2025.3595005"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.720534"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/nature11875"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.05.398"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1126\/science.aaj2038"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007106"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2024.3403488"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849789"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1038\/s41587-019-0240-x"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-43105-w"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056331"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.54897"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(94)90153-8"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.556120"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.825803"},{"key":"ref19","first-page":"114","article-title":"Multi alphabet universal coding of memoryless sources","volume":"31","author":"Shtarkov","year":"1995","journal-title":"Problems of Information Transmission"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834734"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619307"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2020.3035371"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2018.8503225"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619601"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619202"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-023-43172-0"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2024.3408053"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619334"},{"key":"ref29","first-page":"2013","article-title":"Lecture notes on information theory","volume":"6.441","author":"Polyanskiy","journal-title":"class notes for MIT"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2320500"},{"key":"ref31","volume-title":"Information Theory: From Coding to Learning","author":"Polyanskiy","year":"2025"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3247812"},{"key":"ref33","first-page":"1","article-title":"Minimax regret on patterns using kullback-leibler divergence covering","volume-title":"Annual Conference on Learning Theory (COLT)","volume":"178","author":"Tang","year":"2022"},{"key":"ref34","volume-title":"Divergence Covering","author":"Tang","year":"2022"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1017939142"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1030741081"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.3390\/e19070361"},{"key":"ref38","first-page":"016","article-title":"Lecture notes on: Information-theoretic methods for high-dimensional statistics","volume":"598","author":"Wu","journal-title":"class notes for ECE"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195475.pdf?arnumber=11195475","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:31Z","timestamp":1773347371000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195475\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195475","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}