{"id":"https://openalex.org/W2170716519","doi":"https://doi.org/10.1109/tit.1960.1057584","title":"Binary codes with specified minimum distance","display_name":"Binary codes with specified minimum distance","publication_year":1960,"publication_date":"1960-09-01","ids":{"openalex":"https://openalex.org/W2170716519","doi":"https://doi.org/10.1109/tit.1960.1057584","mag":"2170716519"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1960.1057584","doi":"https://doi.org/10.1109/tit.1960.1057584","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1960.1057584","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,"listed_in":["anvur-class-a","anvur-scientific","ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"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"},"volume":null,"type":"article","is_traditional":true,"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/A5001079525","display_name":"Morris Plotkin","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"M. Plotkin","raw_affiliation_strings":["Auerbach Electronics Corporation, Philadelphia, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Auerbach Electronics Corporation, Philadelphia, PA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5001079525"],"corresponding_institution_ids":[],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":9.5278,"has_fulltext":false,"cited_by_count":377,"citation_normalized_percentile":{"value":0.97660819,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"6","issue":"4","first_page":"445","last_page":"450"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.0019000000320374966,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-codes","display_name":"binary codes","score":0.9900000095367432},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"minimum distance","score":0.8489999771118164},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6759999990463257},{"id":"https://openalex.org/keywords/code-construction","display_name":"code construction","score":0.656000018119812},{"id":"https://openalex.org/keywords/error-detection","display_name":"error detection","score":0.875},{"id":"https://openalex.org/keywords/undetected-errors","display_name":"undetected errors","score":0.7329999804496765},{"id":"https://openalex.org/keywords/binary-sequences","display_name":"binary sequences","score":0.4830000102519989},{"id":"https://openalex.org/keywords/code-size-bounds","display_name":"code size bounds","score":0.4490000009536743}],"concepts":[{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6329787373542786},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.5052903294563293},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.500899076461792},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4669288992881775},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.4384043216705322},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38959190249443054},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37916600704193115},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3643306493759155},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2752979099750519},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.08827328681945801}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1960.1057584","doi":"https://doi.org/10.1109/tit.1960.1057584","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1960.1057584","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,"listed_in":["anvur-class-a","anvur-scientific","ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-200","russia-white-list-1"],"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":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1980073965","https://openalex.org/W2342204193","https://openalex.org/W3119473442"],"related_works":["https://openalex.org/W2003149796","https://openalex.org/W2159213522","https://openalex.org/W4210375307","https://openalex.org/W2075922728","https://openalex.org/W2119995058","https://openalex.org/W4255713959","https://openalex.org/W7099606454","https://openalex.org/W2070325307","https://openalex.org/W2069629658","https://openalex.org/W2031613420"],"abstract_inverted_index":{"Twon-digit":[0],"sequences,":[1],"called":[2,27],"\"points,\"":[3],"of":[4,23,25,39,42,47,64,94,112,118,133],"binary":[5,55],"digits":[6,14],"are":[7,15],"said":[8],"to":[9,68],"be":[10],"at":[11],"distancedif":[12],"exactlydcorresponding":[13],"unlike":[16],"in":[17,29,44,73,79,92,106,109],"the":[18,45,57,61,74,80,88,107,110,126,129],"two":[19],"sequences.":[20],"The":[21],"construction":[22,117],"sets":[24],"points,":[26],"codes,":[28],"which":[30,114],"some":[31],"specified":[32],"minimum":[33,58,62,95],"distance":[34,59,96],"is":[35,41],"maintained":[36],"between":[37],"pairs":[38],"points":[40,91],"interest":[43],"design":[46],"self-checking":[48],"systems":[49],"for":[50,87,120,123],"computing":[51],"with":[52,98],"or":[53],"transmitting":[54],"digits,":[56],"being":[60],"number":[63,89],"digital":[65],"errors":[66],"required":[67],"produce":[69],"an":[70],"undetected":[71],"error":[72],"system":[75],"output.":[76],"Previous":[77],"work":[78],"field":[81,108],"had":[82],"established":[83],"general":[84],"upper":[85],"bounds":[86],"ofn-digit":[90],"codes":[93,119,127],"d":[97],"certain":[99],"properties.":[100],"This":[101],"paper":[102],"gives":[103],"new":[104],"results":[105],"form":[111],"theorems":[113],"permit":[115],"systematic":[116],"givenn,":[121],"d;":[122],"somen,":[124],"d,":[125],"contain":[128],"greatest":[130],"possible":[131],"numbers":[132],"points.":[134]},"counts_by_year":[{"year":2026,"cited_by_count":12},{"year":2025,"cited_by_count":28},{"year":2024,"cited_by_count":17},{"year":2023,"cited_by_count":19},{"year":2022,"cited_by_count":22},{"year":2021,"cited_by_count":19},{"year":2020,"cited_by_count":16},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":14},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":7}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}