{"id":"https://openalex.org/W2101205570","doi":"https://doi.org/10.1109/tit.1972.1054902","title":"On block codes with specified maximum distance (Corresp.)","display_name":"On block codes with specified maximum distance (Corresp.)","publication_year":1972,"publication_date":"1972-11-01","ids":{"openalex":"https://openalex.org/W2101205570","doi":"https://doi.org/10.1109/tit.1972.1054902","mag":"2101205570"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1972.1054902","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1972.1054902","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/A5101926450","display_name":"Sane Umesh Reddy","orcid":"https://orcid.org/0009-0007-5007-6950"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S. Reddy","raw_affiliation_strings":["Department of Electrical Engineering, University of Iowa, Iowa, IA, USA","[Department of Electrical Engineering, University of Iowa, Iowa, IA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Iowa, Iowa, IA, USA","institution_ids":["https://openalex.org/I126307644"]},{"raw_affiliation_string":"[Department of Electrical Engineering, University of Iowa, Iowa, IA, USA]","institution_ids":["https://openalex.org/I126307644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101926450"],"corresponding_institution_ids":["https://openalex.org/I126307644"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.14953618,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"18","issue":"6","first_page":"823","last_page":"824"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9994000196456909,"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.9994000196456909,"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.9994000196456909,"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.9904999732971191,"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/hamming-distance","display_name":"Hamming distance","score":0.7776308059692383},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.7188085913658142},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.7001753449440002},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5845125317573547},{"id":"https://openalex.org/keywords/hamming-graph","display_name":"Hamming graph","score":0.5648557543754578},{"id":"https://openalex.org/keywords/hamming","display_name":"Hamming(7,4)","score":0.5534915924072266},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5211443901062012},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.512624204158783},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.48942962288856506},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46970459818840027},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4243994355201721},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.41368716955184937},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33222174644470215},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3295941948890686},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.1429683268070221}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.7776308059692383},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.7188085913658142},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.7001753449440002},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5845125317573547},{"id":"https://openalex.org/C29696283","wikidata":"https://www.wikidata.org/wiki/Q369440","display_name":"Hamming graph","level":5,"score":0.5648557543754578},{"id":"https://openalex.org/C112932734","wikidata":"https://www.wikidata.org/wiki/Q2322550","display_name":"Hamming(7,4)","level":5,"score":0.5534915924072266},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5211443901062012},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.512624204158783},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.48942962288856506},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46970459818840027},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4243994355201721},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.41368716955184937},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33222174644470215},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3295941948890686},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.1429683268070221}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1972.1054902","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1972.1054902","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":1,"referenced_works":["https://openalex.org/W2146508604"],"related_works":["https://openalex.org/W2008960744","https://openalex.org/W2786543974","https://openalex.org/W4300879987","https://openalex.org/W2105471374","https://openalex.org/W2964136540","https://openalex.org/W2157927633","https://openalex.org/W1964096323","https://openalex.org/W4302771537","https://openalex.org/W2951416090","https://openalex.org/W4285078748"],"abstract_inverted_index":{"A":[0],"new":[1],"class":[2],"of":[3,30],"block":[4],"codes":[5,25],"with":[6],"specified":[7,37],"length":[8],"and":[9],"maximum":[10,34],"Hamming":[11,35],"distance":[12,36],"between":[13],"the":[14,23,27,33],"codewords":[15],"is":[16,19,38],"given.":[17],"It":[18],"also":[20],"shown":[21],"that":[22],"proposed":[24],"have":[26],"largest":[28],"number":[29],"words":[31],"when":[32],"1,":[39],"2,":[40],"or":[41],"3.":[42]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}