{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:37:19Z","timestamp":1773376639049,"version":"3.50.1"},"reference-count":34,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206773","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1961-1966","source":"Crossref","is-referenced-by-count":6,"title":["Secret Sharing Over a Gaussian Broadcast Channel: Optimal Coding Scheme Design and Deep Learning Approach at Short Blocklength"],"prefix":"10.1109","author":[{"given":"Rumia","family":"Sultana","sequence":"first","affiliation":[{"name":"Wichita State University,Department of EECS,Wichita,KS,67260"}]},{"given":"Vidhi","family":"Rana","sequence":"additional","affiliation":[{"name":"Wichita State University,Department of EECS,Wichita,KS,67260"}]},{"given":"R\u00e9mi A.","family":"Chou","sequence":"additional","affiliation":[{"name":"Wichita State University,Department of EECS,Wichita,KS,67260"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/142374"},{"key":"ref12","article-title":"MINE: Mutual information neural estimation","author":"belghazi","year":"2018"},{"key":"ref34","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1134\/S0032946013010079"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523727"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611401"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39568-7_20"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2017.2758370"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/ecja.4410690906"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3237259"},{"key":"ref16","article-title":"Explicit wiretap channel codes via source coding, universal hashing, and distribution approximation, when the channels’ statistics are uncertain","author":"chou","year":"2022","journal-title":"IEEE Trans Inf Forensics Security"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2017.8254154"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2704586"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2019.8815464"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.3390\/e21080755"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513794"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3395352.3402654"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2011.2134093"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2348915"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2010.5592833"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874974"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_18"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2019.2945619"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3122808"},{"key":"ref7","article-title":"Distributed secret sharing over a public channel from correlated random variables","author":"chou","year":"2021"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517753"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2421905"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","article-title":"Secret-sharing schemes: A survey","author":"beimel","year":"2011","journal-title":"Proc of Int Conf on Coding and Cryptology"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437656"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513769"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206773.pdf?arnumber=10206773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:12Z","timestamp":1773347232000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206773\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206773","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}