{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T16:08:34Z","timestamp":1787760514788,"version":"build-2784847793"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1109\/tit.2012.2196253","type":"journal-article","created":{"date-parts":[[2012,4,27]],"date-time":"2012-04-27T22:49:48Z","timestamp":1335566988000},"page":"5454-5470","source":"Crossref","is-referenced-by-count":17,"title":["LP-Decodable Permutation Codes Based on Linearly Constrained Permutation Matrices"],"prefix":"10.1109","volume":"58","author":[{"given":"Tadashi","family":"Wadayama","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manabu","family":"Hagiwara","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","first-page":"5","article-title":"A certain zero-sum two-person game equivalent to an optimal assignment problem","volume":"28","author":"von neumann","year":"1953","journal-title":"Ann Math Stud"},{"key":"ref32","article-title":"Permutation trellis-codes","author":"vinck","year":"2001","journal-title":"IEEE Int Symp Inf Theory"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2000.866429"},{"key":"ref30","first-page":"45","article-title":"Coded modulation for powerline communications","volume":"54","author":"vinck","year":"2000","journal-title":"AE Int J Electron Commun"},{"key":"ref36","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8431-1","author":"ziegler","year":"1995","journal-title":"Lectures on Polytopes"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2060030"},{"key":"ref34","first-page":"2518","article-title":"A multilevel construction of permutation codes","volume":"e84 a","author":"wadayama","year":"2001","journal-title":"IEICE Trans Fundam"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839527"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828150"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/978-1-4613-0165-3_5","volume":"123 of ima math appl","author":"forney","year":"2001","journal-title":"Codes Systems and Graphical Models"},{"key":"ref13","author":"fukuda","year":"0","journal-title":"cdd and cddplus homepage"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.992812"},{"key":"ref15","author":"feldman","year":"2003","journal-title":"Decoding error-correcting codes via linear programming"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/0097-3165(77)90009-7","article-title":"On the maximum number of permutations with given maximal and minimal distance","volume":"22","author":"frankl","year":"1977","journal-title":"J Comb Theory Ser A"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/18.57208"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018336"},{"key":"ref19","first-page":"1736","article-title":"Error-correcting codes for rank modulation","author":"jiang","year":"2008","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1968.1054110"},{"key":"ref4","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1965.3680"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054729"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055629"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056454"},{"key":"ref5","first-page":"147","article-title":"Three observations on linear algebra","volume":"5","author":"birkhoff","year":"1946","journal-title":"Univ Nac Tucumn Rev Ser A"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(79)90076-7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048455"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.809507"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/9780470277331"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.32151"},{"key":"ref22","author":"knuth","year":"1998","journal-title":"The Art of Computer Programming Volume 3"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046212"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/18.992777"},{"key":"ref23","article-title":"Graph covers and iterative decoding of finite-length code","author":"koetter","year":"2003","journal-title":"presented at the Int Symp Turbo Codes Related Topics"},{"key":"ref26","author":"stanley","year":"2000","journal-title":"Enumerative Combinatorics&#x2014 Volume 1"},{"key":"ref25","author":"schrijver","year":"2003","journal-title":"Combinatorial Optimization Polyhedra and Efficiency"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6236318\/06189389.pdf?arnumber=6189389","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T02:19:07Z","timestamp":1510625947000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6189389\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":36,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2196253","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8]]}}}