{"id":"https://openalex.org/W4289655172","doi":"https://doi.org/10.1109/isit50566.2022.9834598","title":"Berman Codes: A Generalization of Reed-Muller Codes that Achieve BEC Capacity","display_name":"Berman Codes: A Generalization of Reed-Muller Codes that Achieve BEC Capacity","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655172","doi":"https://doi.org/10.1109/isit50566.2022.9834598"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834598","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834598","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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 International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5053548670","display_name":"Lakshmi Prasad Natarajan","orcid":"https://orcid.org/0000-0003-1552-5240"},"institutions":[{"id":"https://openalex.org/I65181880","display_name":"Indian Institute of Technology Hyderabad","ror":"https://ror.org/01j4v3x97","country_code":"IN","type":"education","lineage":["https://openalex.org/I65181880"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Lakshmi Prasad Natarajan","raw_affiliation_strings":["Indian Institute of Technology Hyderabad,Department of Electrical Engineering,Sangareddy,India,502 284"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Hyderabad,Department of Electrical Engineering,Sangareddy,India,502 284","institution_ids":["https://openalex.org/I65181880"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001685956","display_name":"Prasad Krishnan","orcid":"https://orcid.org/0000-0001-9182-6278"},"institutions":[{"id":"https://openalex.org/I64189192","display_name":"International Institute of Information Technology, Hyderabad","ror":"https://ror.org/05f11g639","country_code":"IN","type":"education","lineage":["https://openalex.org/I64189192"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Prasad Krishnan","raw_affiliation_strings":["International Institute of Information Technology,Signal Processing and Communications Re-Search Center,Hyderabad,India,500032"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"International Institute of Information Technology,Signal Processing and Communications Re-Search Center,Hyderabad,India,500032","institution_ids":["https://openalex.org/I64189192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1761","last_page":"1766"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9993000030517578,"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":0.9993000030517578,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9991999864578247,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9887999892234802,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.7177112698554993},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5899627804756165},{"id":"https://openalex.org/keywords/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.5040863752365112},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.33408939838409424},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.33165687322616577},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.316635400056839},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.3161504864692688},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1893324851989746}],"concepts":[{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.7177112698554993},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5899627804756165},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.5040863752365112},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.33408939838409424},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.33165687322616577},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.316635400056839},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.3161504864692688},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1893324851989746},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834598","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834598","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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 International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W2002348550","https://openalex.org/W2004229705","https://openalex.org/W2039466900","https://openalex.org/W2121417875","https://openalex.org/W2170542295","https://openalex.org/W2320859605","https://openalex.org/W2540200239","https://openalex.org/W2591190829","https://openalex.org/W2964292940","https://openalex.org/W3208419198","https://openalex.org/W4289655172","https://openalex.org/W6803084894"],"related_works":["https://openalex.org/W3133831695","https://openalex.org/W2037763716","https://openalex.org/W1968396483","https://openalex.org/W4297536019","https://openalex.org/W2362406576","https://openalex.org/W1798117689","https://openalex.org/W58580312","https://openalex.org/W2169737172","https://openalex.org/W4311033648","https://openalex.org/W2151937123"],"abstract_inverted_index":{"We":[0,125],"identify":[1,126],"a":[2,21,130,141,146],"family":[3,28],"of":[4,42,69,82,148,156,166],"binary":[5,168],"codes":[6,14,19,25,44,84,128,139,162],"whose":[7],"structure":[8],"is":[9,45,57,65],"similar":[10],"to":[11,86,112,153],"Reed-Muller":[12],"(RM)":[13],"and":[15,33,55,72,97,99,108,118,134],"which":[16],"include":[17],"RM":[18,67],"as":[20,31,38,114,120],"strict":[22],"subclass.":[23],"The":[24,40,79],"in":[26],"this":[27,154],"are":[29,36],"denoted":[30,37],"${\\mathcal{C}_n}(r,m)$,":[32],"their":[34,58],"duals":[35],"${{\\mathcal{B}}_n}(r,m)$.":[39],"length":[41,73],"these":[43,83,127,138,161],"n":[46,52,61,87],"<sup":[47,75],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[48,76],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">m</sup>":[49,77],",":[50],"where":[51],"\u2265":[53],"2,":[54,63],"r":[56,71],"\u2018order\u2019.":[59],"When":[60],"=":[62],"${\\mathcal{C}_n}(r,m)$":[64,119],"the":[66,103,115,121,164,167],"code":[68,117],"order":[70],"2":[74],".":[78],"special":[80],"case":[81],"corresponding":[85],"being":[88],"an":[89],"odd":[90],"prime":[91],"was":[92],"studied":[93],"by":[94,106],"Berman":[95,116,123],"(1967)":[96],"Blackmore":[98,107],"Norton":[100],"(2001).":[101],"Following":[102],"terminology":[104],"introduced":[105],"Norton,":[109],"we":[110,135,158],"refer":[111],"${{\\mathcal{B}}_n}(r,m)$":[113],"dual":[122],"code.":[124],"using":[129],"recursive":[131],"Plotkin-like":[132],"construction,":[133],"show":[136,159],"that":[137,160],"have":[140],"rich":[142],"automorphism":[143],"group.":[144],"Applying":[145],"result":[147],"Kumar":[149],"et":[150],"al.":[151],"(2016)":[152],"set":[155],"automorphisms,":[157],"achieve":[163],"capacity":[165],"erasure":[169],"channel":[170],"(BEC)":[171],"under":[172],"bit-MAP":[173],"decoding.":[174]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}