{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:05:38Z","timestamp":1729652738903,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/allerton.2013.6736583","type":"proceedings-article","created":{"date-parts":[[2014,2,13]],"date-time":"2014-02-13T17:46:12Z","timestamp":1392313572000},"page":"621-628","source":"Crossref","is-referenced-by-count":1,"title":["On the poset structure of floating codes"],"prefix":"10.1109","author":[{"given":"Mochan","family":"Shrestha","sequence":"first","affiliation":[]},{"family":"Lihao Xu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"Rewriting codes for flash memories","author":"yaakobi","year":"2012","journal-title":"CoRR"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2010.5592956"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2200291"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736583"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797584"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205973"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802182"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018336"},{"journal-title":"Proc IEEE International Symposium on Information Theory (ISIT)","year":"2007","key":"12"},{"journal-title":"Worst-Case and Average-Case Floating Codes for Flash Memory","year":"0","key":"3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797723"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283489"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2177755"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595286"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059530"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557417"},{"key":"4","doi-asserted-by":"crossref","first-page":"336","DOI":"10.2307\/1401743","article-title":"The distributions of s\"for numerous and extensive ties in one of a pair of rankings of length","volume":"30","author":"habennan","year":"1962","journal-title":"Review of the International Statistical Institute"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205981"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/PACRIM.2009.5291244"}],"event":{"name":"2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2013,10,2]]},"location":"Monticello, IL","end":{"date-parts":[[2013,10,4]]}},"container-title":["2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6725831\/6736491\/06736583.pdf?arnumber=6736583","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T03:51:33Z","timestamp":1498103493000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6736583\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/allerton.2013.6736583","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]}}}