{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:48:00Z","timestamp":1730274480988,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1109\/isit.2011.6033769","type":"proceedings-article","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T13:24:20Z","timestamp":1317907460000},"page":"139-143","source":"Crossref","is-referenced-by-count":4,"title":["LP decodable permutation codes based on linearly constrained permutation matrices"],"prefix":"10.1109","author":[{"given":"Tadashi","family":"Wadayama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manabu","family":"Hagiwara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"2518","article-title":"A multilevel construction of permutation codes","volume":"e84 a","author":"wadayama","year":"2001","journal-title":"IEICE Transactions on Fundamentals"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1965.3680"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.32151"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.57208"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054729"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048455"},{"key":"ref16","article-title":"Graph covers and iterative decoding of finite-length codes","author":"koetter","year":"2003","journal-title":"Proc 3rd Int Symp Turbo Codes and Related Topics"},{"key":"ref17","first-page":"147","article-title":"Three observations on linear algebra","author":"birkhoff","year":"1946","journal-title":"Univ Nac Tucumn Rev Ser A"},{"key":"ref18","first-page":"5","article-title":"A certain zero-sum two-person game equivalent to an optimal assignment problem","author":"von neumann","year":"1953","journal-title":"Annals of Mathematics Studies 28"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033769"},{"key":"ref4","article-title":"Constructions of permutation arrays","volume":"48","author":"ding","year":"2002","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0165-3_5"},{"key":"ref6","article-title":"Rank modulation for flash memories","author":"jiang","year":"2008","journal-title":"Proc IEEE Int Symp Information Theory"},{"article-title":"Decoding error-correcting codes via linear programming","year":"2003","author":"feldman","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046212"},{"key":"ref7","article-title":"Error-correcting codes for rank modulation","author":"jiang","year":"2008","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828150"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(79)90076-7"},{"key":"ref9","first-page":"45","article-title":"Coded modulation for powerline communications","volume":"54","author":"vinck","year":"2000","journal-title":"AEU Int J Electron Commun"}],"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\/06033769.pdf?arnumber=6033769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T23:01:11Z","timestamp":1490050871000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6033769\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2011.6033769","relation":{},"subject":[],"published":{"date-parts":[[2011,7]]}}}