{"id":"https://openalex.org/W2056125990","doi":"https://doi.org/10.1109/tit.1983.1056743","title":"Some results on the existence of binary linear codes (Corresp.)","display_name":"Some results on the existence of binary linear codes (Corresp.)","publication_year":1983,"publication_date":"1983-11-01","ids":{"openalex":"https://openalex.org/W2056125990","doi":"https://doi.org/10.1109/tit.1983.1056743","mag":"2056125990"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1983.1056743","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056743","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/A5080629927","display_name":"Michele Elia","orcid":"https://orcid.org/0000-0002-8074-8232"},"institutions":[{"id":"https://openalex.org/I4210100607","display_name":"Institute of Electronics, Computer and Telecommunication Engineering","ror":"https://ror.org/00n4jbh84","country_code":"IT","type":"facility","lineage":["https://openalex.org/I4210100607","https://openalex.org/I4210155236"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"M. Elia","raw_affiliation_strings":["Istituto di Elettronica e Telecomunicazioni, Torino, Italy"],"affiliations":[{"raw_affiliation_string":"Istituto di Elettronica e Telecomunicazioni, Torino, Italy","institution_ids":["https://openalex.org/I4210100607"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5080629927"],"corresponding_institution_ids":["https://openalex.org/I4210100607"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.14943029,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"29","issue":"6","first_page":"933","last_page":"934"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9991000294685364,"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.9991000294685364,"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.9947999715805054,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.992900013923645,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6675772070884705},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6041049361228943},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5720948576927185},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.5561199188232422},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5524935126304626},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5517574548721313},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5175277590751648},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.4652095437049866},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.43121621012687683},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.42066723108291626},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2622118592262268},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25831812620162964},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.254028856754303},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.25199681520462036},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.12351080775260925}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6675772070884705},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6041049361228943},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5720948576927185},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.5561199188232422},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5524935126304626},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5517574548721313},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5175277590751648},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.4652095437049866},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.43121621012687683},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.42066723108291626},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2622118592262268},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25831812620162964},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.254028856754303},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.25199681520462036},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.12351080775260925},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1983.1056743","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1983.1056743","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":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1606480398","https://openalex.org/W1980073965","https://openalex.org/W2014944833","https://openalex.org/W2084368719","https://openalex.org/W2109084006","https://openalex.org/W2165731899","https://openalex.org/W2342204193"],"related_works":["https://openalex.org/W2964136540","https://openalex.org/W645598334","https://openalex.org/W2140303386","https://openalex.org/W2109703172","https://openalex.org/W2087721965","https://openalex.org/W2133843984","https://openalex.org/W2097641068","https://openalex.org/W1976116479","https://openalex.org/W3127537071","https://openalex.org/W2731597386"],"abstract_inverted_index":{"A":[0],"lower":[1],"bound":[2,21],"is":[3],"given":[4,13,34],"on":[5],"the":[6,19,42],"size":[7],"of":[8,12],"a":[9],"linear":[10],"code":[11],"length":[14],"and":[15],"distance":[16],"which":[17],"improves":[18],"Varshamov":[20,43],"in":[22],"certain":[23],"cases,":[24],"though":[25],"not":[26],"asymptotically.":[27],"Specific":[28],"triples":[29],"<tex":[30],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[31],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">(n,k,d)</tex>":[32],"are":[33],"with":[35],"values":[36],"larger":[37],"than":[38],"those":[39],"guaranteed":[40],"by":[41],"bound.":[44]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}