{"id":"https://openalex.org/W4310902908","doi":"https://doi.org/10.1109/itw54588.2022.9965911","title":"Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels","display_name":"Linear Runlength-Limited Subcodes of Reed-Muller Codes and Coding Schemes for Input-Constrained BMS Channels","publication_year":2022,"publication_date":"2022-11-01","ids":{"openalex":"https://openalex.org/W4310902908","doi":"https://doi.org/10.1109/itw54588.2022.9965911"},"language":"en","primary_location":{"id":"doi:10.1109/itw54588.2022.9965911","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw54588.2022.9965911","pdf_url":null,"source":{"id":"https://openalex.org/S4363606450","display_name":"2022 IEEE Information Theory Workshop (ITW)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-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/A5087839421","display_name":"V. Arvind Rameshwar","orcid":"https://orcid.org/0000-0002-5284-215X"},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"V. Arvind Rameshwar","raw_affiliation_strings":["Indian Institute of Science,Department of Electrical Communication Engineering,Bengaluru,560012"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Science,Department of Electrical Communication Engineering,Bengaluru,560012","institution_ids":["https://openalex.org/I59270414"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059452861","display_name":"Navin Kashyap","orcid":null},"institutions":[{"id":"https://openalex.org/I59270414","display_name":"Indian Institute of Science Bangalore","ror":"https://ror.org/04dese585","country_code":"IN","type":"education","lineage":["https://openalex.org/I59270414"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Navin Kashyap","raw_affiliation_strings":["Indian Institute of Science,Department of Electrical Communication Engineering,Bengaluru,560012"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Science,Department of Electrical Communication Engineering,Bengaluru,560012","institution_ids":["https://openalex.org/I59270414"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5087839421"],"corresponding_institution_ids":["https://openalex.org/I59270414"],"apc_list":null,"apc_paid":null,"fwci":0.4324,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.50041713,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"624","last_page":"629"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9972000122070312,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6450098752975464},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.6014373898506165},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5661035776138306},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5335742831230164},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5197869539260864},{"id":"https://openalex.org/keywords/coset","display_name":"Coset","score":0.5136939287185669},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.49481648206710815},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.48073649406433105},{"id":"https://openalex.org/keywords/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.47669121623039246},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4663291275501251},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.46539151668548584},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.430797815322876},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.4300054609775543},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.41340893507003784},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.36141538619995117},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.31956809759140015},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3091033697128296},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23106729984283447},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.13982361555099487},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06621837615966797}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6450098752975464},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.6014373898506165},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5661035776138306},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5335742831230164},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5197869539260864},{"id":"https://openalex.org/C85307737","wikidata":"https://www.wikidata.org/wiki/Q751969","display_name":"Coset","level":2,"score":0.5136939287185669},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.49481648206710815},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.48073649406433105},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.47669121623039246},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4663291275501251},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.46539151668548584},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.430797815322876},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.4300054609775543},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.41340893507003784},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.36141538619995117},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.31956809759140015},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3091033697128296},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23106729984283447},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.13982361555099487},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06621837615966797},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw54588.2022.9965911","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw54588.2022.9965911","pdf_url":null,"source":{"id":"https://openalex.org/S4363606450","display_name":"2022 IEEE Information Theory Workshop (ITW)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1606480398","https://openalex.org/W1970974504","https://openalex.org/W1974382727","https://openalex.org/W2115104320","https://openalex.org/W2124235059","https://openalex.org/W2127490352","https://openalex.org/W2150498905","https://openalex.org/W2162906694","https://openalex.org/W2175334662","https://openalex.org/W2179644698","https://openalex.org/W2591190829","https://openalex.org/W3037718443","https://openalex.org/W3208419198","https://openalex.org/W4255389307","https://openalex.org/W4289655202","https://openalex.org/W4310902908","https://openalex.org/W6803084894","https://openalex.org/W6841597840"],"related_works":["https://openalex.org/W2161284257","https://openalex.org/W4389292288","https://openalex.org/W4210934707","https://openalex.org/W4307782542","https://openalex.org/W4366985329","https://openalex.org/W2037339745","https://openalex.org/W1972655355","https://openalex.org/W2952736220","https://openalex.org/W2603800327","https://openalex.org/W2137843273"],"abstract_inverted_index":{"In":[0],"this":[1,185],"work,":[2],"we":[3,164],"address":[4],"the":[5,8,31,69,72,89,95,107,110,120,123,131,152,178,204],"question":[6],"of":[7,11,14,19,40,58,88,97,122,154,173,180,191,197,203],"largest":[9],"rate":[10,96,137],"linear":[12,82,141,189],"subcodes":[13],"Reed-Muller":[15],"(RM)":[16],"codes,":[17],"all":[18],"whose":[20,64],"codewords":[21],"respect":[22],"a":[23,155,166],"runlength-limited":[24],"(RLL)":[25],"constraint.":[26],"Our":[27],"interest":[28],"is":[29,100],"in":[30,68,106,145,177,195],"(d,":[32,83,142,156],"\u221e)-RLL":[33,84,143,157],"constraint,":[34],"which":[35],"mandates":[36],"that":[37,79,94],"every":[38],"pair":[39],"successive":[41],"1s":[42],"be":[43],"separated":[44],"by":[45],"at":[46,101],"least":[47],"d":[48],"0s.":[49],"Consider":[50],"any":[51,81,188],"sequence":[52],"${\\left\\{":[53],"{{\\mathcal{C}_m}}":[54],"\\right\\}_{m":[55],"\\geq":[56],"1}}$":[57],"RM":[59,124,174,193],"codes":[60,125],"with":[61],"increasing":[62],"blocklength,":[63],"rates":[65],"approach":[66],"R,":[67],"limit":[70,108,179],"as":[71,109,148],"blocklength":[73,111,181],"goes":[74,112],"to":[75,113,130,183],"infinity.":[76,114],"We":[77,115],"show":[78],"for":[80,140,151,199],"subcode,":[85],"${\\hat":[86,98],"{\\mathcal{C}}_m}$,":[87],"code":[90,186],"${\\mathcal{C}_m}$,":[91],"it":[92],"holds":[93],"{\\mathcal{C}}_m}$":[99],"most":[102],"$\\frac{R}{{d":[103],"+":[104],"1}}$,":[105],"also":[116],"consider":[117],"scenarios":[118],"where":[119],"coordinates":[121],"are":[126],"not":[127],"ordered":[128],"according":[129],"standard":[132],"lexicographic":[133],"ordering,":[134],"and":[135],"derive":[136],"upper":[138],"bounds":[139],"subcodes,":[144],"those":[146],"cases":[147],"well.":[149],"Next,":[150],"setting":[153],"input-constrained":[158],"binary":[159],"memoryless":[160],"symmetric":[161],"(BMS)":[162],"channel,":[163],"devise":[165],"new":[167],"coding":[168],"scheme,":[169],"based":[170],"on":[171],"cosets":[172],"codes.":[175],"Again,":[176],"going":[182],"infinity,":[184],"outperforms":[187],"subcode":[190],"an":[192],"code,":[194],"terms":[196],"rate,":[198],"low":[200],"noise":[201],"regimes":[202],"channel.":[205]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}