{"id":"https://openalex.org/W2140885097","doi":"https://doi.org/10.1109/tit.1968.1054128","title":"New generalizations of the Reed-Muller codes--II: Nonprimitive codes","display_name":"New generalizations of the Reed-Muller codes--II: Nonprimitive codes","publication_year":1968,"publication_date":"1968-03-01","ids":{"openalex":"https://openalex.org/W2140885097","doi":"https://doi.org/10.1109/tit.1968.1054128","mag":"2140885097"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1968.1054128","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1968.1054128","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/A5023980396","display_name":"Edward Weldon","orcid":"https://orcid.org/0000-0002-0493-9344"},"institutions":[{"id":"https://openalex.org/I1331384533","display_name":"University of Hawaii System","ror":"https://ror.org/03tzaeb71","country_code":"US","type":"education","lineage":["https://openalex.org/I1331384533"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"E. Weldon","raw_affiliation_strings":["Department of Electrical Engineering, University of Hawai, Honolulu, HI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Hawai, Honolulu, HI, USA","institution_ids":["https://openalex.org/I1331384533"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023980396"],"corresponding_institution_ids":["https://openalex.org/I1331384533"],"apc_list":null,"apc_paid":null,"fwci":18.5807,"has_fulltext":false,"cited_by_count":78,"citation_normalized_percentile":{"value":0.99300699,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"14","issue":"2","first_page":"199","last_page":"205"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9976999759674072,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9976999759674072,"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/T11130","display_name":"Coding theory and cryptography","score":0.9973000288009644,"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/T12029","display_name":"DNA and Biological Computing","score":0.9952999949455261,"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/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.7825686931610107},{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.7822870016098022},{"id":"https://openalex.org/keywords/reed\u2013solomon-error-correction","display_name":"Reed\u2013Solomon error correction","score":0.643183708190918},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.6408246159553528},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.6011911630630493},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.5775898098945618},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5585377216339111},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5379491448402405},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5087023377418518},{"id":"https://openalex.org/keywords/raptor-code","display_name":"Raptor code","score":0.5078118443489075},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5062586665153503},{"id":"https://openalex.org/keywords/fountain-code","display_name":"Fountain code","score":0.4879995882511139},{"id":"https://openalex.org/keywords/tornado-code","display_name":"Tornado code","score":0.4799219071865082},{"id":"https://openalex.org/keywords/expander-code","display_name":"Expander code","score":0.4768686890602112},{"id":"https://openalex.org/keywords/luby-transform-code","display_name":"Luby transform code","score":0.47028258442878723},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.4270889163017273},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.38342440128326416},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3579937517642975},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33731287717819214},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2843135595321655}],"concepts":[{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.7825686931610107},{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.7822870016098022},{"id":"https://openalex.org/C78065487","wikidata":"https://www.wikidata.org/wiki/Q1061598","display_name":"Reed\u2013Solomon error correction","level":5,"score":0.643183708190918},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.6408246159553528},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.6011911630630493},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.5775898098945618},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5585377216339111},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5379491448402405},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5087023377418518},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.5078118443489075},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5062586665153503},{"id":"https://openalex.org/C76132124","wikidata":"https://www.wikidata.org/wiki/Q5474786","display_name":"Fountain code","level":5,"score":0.4879995882511139},{"id":"https://openalex.org/C65058987","wikidata":"https://www.wikidata.org/wiki/Q7826005","display_name":"Tornado code","level":5,"score":0.4799219071865082},{"id":"https://openalex.org/C108509264","wikidata":"https://www.wikidata.org/wiki/Q5420758","display_name":"Expander code","level":5,"score":0.4768686890602112},{"id":"https://openalex.org/C128151799","wikidata":"https://www.wikidata.org/wiki/Q13563306","display_name":"Luby transform code","level":5,"score":0.47028258442878723},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.4270889163017273},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.38342440128326416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3579937517642975},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33731287717819214},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2843135595321655},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1968.1054128","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1968.1054128","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1985800138","https://openalex.org/W2004229705","https://openalex.org/W2083774980","https://openalex.org/W2085145600","https://openalex.org/W2097385238","https://openalex.org/W2121417875","https://openalex.org/W2144253890","https://openalex.org/W3216147140","https://openalex.org/W4234345682","https://openalex.org/W4245256025","https://openalex.org/W6804434002"],"related_works":["https://openalex.org/W2041319252","https://openalex.org/W3197169861","https://openalex.org/W2124185731","https://openalex.org/W1966899942","https://openalex.org/W2121145816","https://openalex.org/W3141193846","https://openalex.org/W2095450438","https://openalex.org/W2140885097","https://openalex.org/W4214685101","https://openalex.org/W2949151893"],"abstract_inverted_index":{"In":[0,174],"this":[1],"paper":[2],"a":[3,66,161],"class":[4],"of":[5,34,37,52,65,72,82,103,107,133,144,163,185,193],"nonprimitive":[6,26,196],"cyclic":[7],"codes":[8,17,88,100,106,119,145,156,198],"quite":[9],"similar":[10],"in":[11,116,203],"structure":[12],"to":[13,23,31,60],"the":[14,35,38,48,70,73,87,99,104,108,118,125,138,141,152,155,164,171,191],"original":[15,165],"Reed-Muller":[16,27,172,197],"is":[18,95,146,151],"presented.":[19,46],"These":[20,75],"codes,":[21,28],"referred":[22],"herein":[24],"as":[25,69,122,124],"are":[29,45,58,101,120,178],"shown":[30,59,97],"possess":[32],"many":[33],"properties":[36],"primitive":[39],"codes.":[40,127,173],"Specifically,":[41],"two":[42,142],"major":[43],"results":[44],"First":[47],"code":[49,83,134],"length,":[50],"number":[51],"information":[53],"symbols,":[54],"and":[55,85,111,136,190],"minimum":[56,92,113,188],"distance":[57],"be":[61,158],"related":[62],"by":[63,168],"means":[64],"parameter":[67],"known":[68],"order":[71],"code.":[74],"relationships":[76],"show":[77],"that":[78,98,154],"for":[79,129,170,201],"given":[80],"values":[81,132],"length":[84,110,135],"rate":[86,137],"have":[89],"relatively":[90],"large":[91,187],"distances.":[93],"It":[94],"also":[96],"subcodes":[102],"BCH":[105,126],"same":[109],"guaranteed":[112],"distance;":[114],"thus":[115],"general":[117],"not":[121],"powerful":[123],"However,":[128],"most":[130],"interesting":[131],"difference":[139],"between":[140],"types":[143],"slight.":[147],"The":[148],"second":[149],"result":[150],"observation":[153],"can":[157],"decoded":[159],"with":[160],"variation":[162],"algorithm":[166],"proposed":[167],"Reed":[169],"other":[175],"words,":[176],"they":[177],"<tex":[179],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[180],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">L</tex>":[181],"-step":[182],"orthogonalizable.":[183],"Because":[184],"their":[186,194],"distances":[189],"simplicity":[192],"decoders,":[195],"seem":[199],"attractive":[200],"use":[202],"error-control":[204],"systems":[205],"requiring":[206],"multiple":[207],"random-error":[208],"correction.":[209]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-02-27T16:54:17.756197","created_date":"2025-10-10T00:00:00"}