{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T15:34:30Z","timestamp":1730302470623,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T00:00:00Z","timestamp":1701129600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T00:00:00Z","timestamp":1701129600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key R&D Program of China","doi-asserted-by":"publisher","award":["2022ZD0115303"],"award-info":[{"award-number":["2022ZD0115303"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,11,28]]},"DOI":"10.1109\/vcc60689.2023.10474808","type":"proceedings-article","created":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T19:50:45Z","timestamp":1711482645000},"page":"218-223","source":"Crossref","is-referenced-by-count":0,"title":["Multichannel One-Time Length Encoding: Exploiting Channel Redundancy"],"prefix":"10.1109","author":[{"given":"Hoover H. F.","family":"Yin","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong,Department of Information Engineering"}]},{"given":"Xishi","family":"Wang","sequence":"additional","affiliation":[{"name":"n-hop technologies Ltd"}]},{"given":"Qi","family":"Cao","sequence":"additional","affiliation":[{"name":"Guangzhou Institute, Xidian University"}]},{"given":"Shiqiu","family":"Liu","sequence":"additional","affiliation":[{"name":"Peng Cheng Laboratory"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513244"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871615"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849758"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611502"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503211"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517894"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/tencon55691.2022.9977596"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165818"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834710"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITW55543.2023.10161634"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3236688"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2013.2260538"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1119\/1.5100943"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.physleta.2015.12.004"},{"key":"ref16","first-page":"2437","article-title":"Parallel algorithm for learning optimal Bayesian network structure","volume":"12","author":"Tamada","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2007.903229"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1525\/9780520319875-014"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4842-8_27"},{"volume-title":"Combinatorial Algorithms: For Computers and Calculators","year":"2014","author":"Nijenhuis","key":"ref20"},{"volume-title":"Combinatorial Algorithms: Generation, Enumeration, and Search","year":"1998","author":"Kreher","key":"ref21"},{"key":"ref22","article-title":"Generating the mth lexicographical element of a mathematical combination","author":"McCaffrey","year":"2004","journal-title":"Microsoft Developer Network"},{"key":"ref23","article-title":"Unranking combinations lexicographically: An efficient new strategy compared with others","author":"Donnot","year":"2020","journal-title":"HAL hal-02462764"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2015.2460222"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2307\/2589148"},{"issue":"2","key":"ref26","first-page":"5","article-title":"Inequalities on the Lambert W function and hyperpower function","volume":"9","author":"Hoorfar","year":"2008","journal-title":"Journal of Inequalities in Pure and Applied Mathematics"},{"volume-title":"Upper and lower bounds for Lambert W function","year":"2023","key":"ref27"},{"volume-title":"The Lost Notebook and Other Unpublished Papers","year":"1988","author":"Aiyangar","key":"ref28"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.2307\/2308012"}],"event":{"name":"2023 IEEE Virtual Conference on Communications (VCC)","start":{"date-parts":[[2023,11,28]]},"location":"NY, USA","end":{"date-parts":[[2023,11,30]]}},"container-title":["2023 IEEE Virtual Conference on Communications (VCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10474593\/10474603\/10474808.pdf?arnumber=10474808","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T20:22:03Z","timestamp":1711657323000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10474808\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,28]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/vcc60689.2023.10474808","relation":{},"subject":[],"published":{"date-parts":[[2023,11,28]]}}}