{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:48:37Z","timestamp":1730274517736,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033927","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"2100-2104","source":"Crossref","is-referenced-by-count":8,"title":["Computing the ball size of frequency permutations under chebyshev distance"],"prefix":"10.1109","author":[{"given":"Min-Zheng","family":"Shieh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi-Chun","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2008.10.029"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1965.3680"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046241"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2069253"},{"key":"ref14","article-title":"Coding and modulation for power-line communications","author":"vinck","year":"2000","journal-title":"Proc Int Symp Power Line Commun Appl"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2000.866429"},{"key":"ref16","first-page":"45","article-title":"Coded modulation for powerline communications","volume":"54","author":"vinck","year":"2000","journal-title":"Proc Int J Electron Commun"},{"key":"ref4","first-page":"1736","article-title":"Error-Correcting Codes for Rank Modulation","author":"jiang","year":"2008","journal-title":"Proc IEEE Intl Symp Inf Th"},{"key":"ref3","first-page":"1731","article-title":"Rank Modulation for Flash Memories","author":"jiang","year":"2008","journal-title":"Proc IEEE Intl Symp Inf Th"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-010-9454-0"},{"key":"ref5","article-title":"Frequency permutation arrays within distance one","author":"kl\u00e3ve","year":"2009","journal-title":"Reports in Informatics Dept of Informatics"},{"key":"ref8","first-page":"211","article-title":"Efficient Encoding and Decoding with Permutation Arrays","author":"lin","year":"2008","journal-title":"Proc IEEE Intl Symp Inf Th"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046212"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/jcd.20096"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.809507"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2002.1046507"}],"event":{"name":"2011 IEEE International Symposium on Information Theory - ISIT","start":{"date-parts":[[2011,7,31]]},"location":"St. Petersburg, Russia","end":{"date-parts":[[2011,8,5]]}},"container-title":["2011 IEEE International Symposium on Information Theory Proceedings"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6026198\/6033677\/06033927.pdf?arnumber=6033927","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T23:49:48Z","timestamp":1490053788000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033927\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033927","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}