{"id":"https://openalex.org/W2005913625","doi":"https://doi.org/10.1109/tit.2012.2221121","title":"Constructions of Rank Modulation Codes","display_name":"Constructions of Rank Modulation Codes","publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W2005913625","doi":"https://doi.org/10.1109/tit.2012.2221121","mag":"2005913625"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2012.2221121","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2221121","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051046818","display_name":"Arya Mazumdar","orcid":"https://orcid.org/0000-0003-4605-7996"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arya Mazumdar","raw_affiliation_strings":["Department of Electrical and Computer Engineering and Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA","Dept. of Electr. & Comput. Eng., Massachusetts Inst. of Technol., Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering and Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Massachusetts Inst. of Technol., Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004622357","display_name":"Alexander Barg","orcid":"https://orcid.org/0000-0002-8972-4413"},"institutions":[{"id":"https://openalex.org/I4210107660","display_name":"Institute for Information Transmission Problems","ror":"https://ror.org/013w2d378","country_code":"RU","type":"facility","lineage":["https://openalex.org/I4210107660"]},{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["RU","US"],"is_corresponding":false,"raw_author_name":"Alexander Barg","raw_affiliation_strings":["Russian Academy of Science, Institute for Problems of Information Transmission, Moscow, Russia","Dept of Electr. & Comput. Eng., Univ. of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Russian Academy of Science, Institute for Problems of Information Transmission, Moscow, Russia","institution_ids":["https://openalex.org/I4210107660"]},{"raw_affiliation_string":"Dept of Electr. & Comput. Eng., Univ. of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064676731","display_name":"Gilles Z\u00e9mor","orcid":"https://orcid.org/0000-0002-6041-9554"},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210166017","display_name":"Institut de Math\u00e9matiques de Bordeaux","ror":"https://ror.org/05m3r1b84","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I15057530","https://openalex.org/I4210141950","https://openalex.org/I4210160189","https://openalex.org/I4210166017"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Gilles Zemor","raw_affiliation_strings":["Institut de Math\u00e9matiques de Bordeaux UMR 5251, Bordeaux University, Talence, France","Inst. de Math. de Bordeaux, Univ. of Bordeaux, Talence, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut de Math\u00e9matiques de Bordeaux UMR 5251, Bordeaux University, Talence, France","institution_ids":["https://openalex.org/I4210166017"]},{"raw_affiliation_string":"Inst. de Math. de Bordeaux, Univ. of Bordeaux, Talence, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210166017"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":10.5402,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.98055533,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"59","issue":"2","first_page":"1018","last_page":"1029"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.6182973384857178},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.5981455445289612},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.47929471731185913},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.47585365176200867},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4575563669204712},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.4546149969100952},{"id":"https://openalex.org/keywords/hamming-space","display_name":"Hamming space","score":0.45015236735343933},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4354991614818573},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4299035668373108},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.39377060532569885},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39240026473999023},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35225075483322144},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.29727888107299805},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2520475387573242},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.24406710267066956},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.15059766173362732},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08839413523674011}],"concepts":[{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.6182973384857178},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.5981455445289612},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.47929471731185913},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.47585365176200867},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4575563669204712},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.4546149969100952},{"id":"https://openalex.org/C2779494224","wikidata":"https://www.wikidata.org/wiki/Q5645799","display_name":"Hamming space","level":5,"score":0.45015236735343933},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4354991614818573},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4299035668373108},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.39377060532569885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39240026473999023},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35225075483322144},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29727888107299805},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2520475387573242},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.24406710267066956},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.15059766173362732},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08839413523674011}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tit.2012.2221121","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2221121","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01049464v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01049464","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Information Theory, 2013, 59 (2), pp.1018--1029. ⟨10.1109/TIT.2012.2221121⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/114392","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/114392","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/194631","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/194631","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1499300513","https://openalex.org/W1600537614","https://openalex.org/W1945771600","https://openalex.org/W1981009091","https://openalex.org/W1985350257","https://openalex.org/W2065465262","https://openalex.org/W2066218472","https://openalex.org/W2076639947","https://openalex.org/W2087888940","https://openalex.org/W2096408325","https://openalex.org/W2108457565","https://openalex.org/W2110233418","https://openalex.org/W2115370421","https://openalex.org/W2120062331","https://openalex.org/W2128970384","https://openalex.org/W2144030381","https://openalex.org/W2155537866","https://openalex.org/W2157679455","https://openalex.org/W2163182174","https://openalex.org/W2171980820","https://openalex.org/W2193189705","https://openalex.org/W2326587081","https://openalex.org/W2550250202","https://openalex.org/W2977322974","https://openalex.org/W4212799367","https://openalex.org/W4253714783","https://openalex.org/W4285719527","https://openalex.org/W6629624487","https://openalex.org/W6683394296"],"related_works":["https://openalex.org/W2371167013","https://openalex.org/W2613408642","https://openalex.org/W2182731056","https://openalex.org/W4235868261","https://openalex.org/W1503555387","https://openalex.org/W1519122282","https://openalex.org/W4380994333","https://openalex.org/W2158117886","https://openalex.org/W2140899540","https://openalex.org/W2998312549"],"abstract_inverted_index":{"Rank":[0],"modulation":[1,25,140,154,181],"is":[2],"a":[3,58,68,158,177],"way":[4],"of":[5,28,30,33,45,52,61,70,98,138,152,160,171,179,190,195],"encoding":[6,94],"information":[7],"to":[8,80,105,146,176],"correct":[9,81,106,157],"errors":[10,82,107,123,161,198],"in":[11,20,54,72,83,108],"flash":[12],"memory":[13],"devices":[14],"as":[15,17,103],"well":[16],"impulse":[18],"noise":[19],"transmission":[21],"lines.":[22],"Modeling":[23],"rank":[24,139,153,180],"involves":[26],"construction":[27],"packings":[29],"the":[31,37,84,100,109,128,185,188,193,200],"space":[32],"permutations":[34,55],"equipped":[35],"with":[36,142],"Kendall":[38,85,197],"tau":[39],"distance.":[40],"As":[41,112],"our":[42,172],"main":[43],"set":[44],"results,":[46],"we":[47,66,119,149],"present":[48],"several":[49],"general":[50],"constructions":[51,88,173],"codes":[53,76,121,141,155,182],"that":[56,126,156,162],"cover":[57],"broad":[59],"range":[60],"code":[62],"parameters.":[63,144],"In":[64],"particular,":[65],"show":[67],"number":[69,159,189,194],"ways":[71],"which":[73,184],"conventional":[74],"error-correcting":[75],"can":[77],"be":[78],"modified":[79],"space.":[86],"Our":[87],"are":[89],"nonasymptotic":[90],"and":[91,95,192],"afford":[92],"simple":[93],"decoding":[96],"algorithms":[97],"essentially":[99],"same":[101],"complexity":[102],"required":[104],"Hamming":[110],"metric.":[111],"an":[113],"example,":[114],"from":[115],"binary":[116],"Bose\u2013Chaudhuri\u2013Hocquenghem":[117],"codes,":[118],"obtain":[120],"correcting$t$Kendall":[122],"in$n$memory":[124],"cells":[125],"support":[127],"order":[129],"of$n!/(\\log_{2}n!)^{t}$messages,":[130],"for":[131,183],"any":[132],"constant$t=1,2,\\ldots$.":[133],"We":[134],"give":[135],"many":[136],"examples":[137],"specific":[143],"Turning":[145],"asymptotic":[147],"analysis,":[148],"construct":[150],"families":[151],"grows":[163],"with$n$at":[164],"varying":[165],"rates,":[166],"from$\\Theta":[167],"(n)$to$\\Theta":[168],"(n^{2})$.":[169],"One":[170],"gives":[174],"rise":[175],"family":[178],"tradeoff":[186],"between":[187],"messages":[191],"correctable":[196],"approaches":[199],"optimal":[201],"scaling":[202],"rate.":[203]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}