{"id":"https://openalex.org/W2115422885","doi":"https://doi.org/10.1109/isit.2006.261600","title":"A bound for codes with given minimum and maximum distances","display_name":"A bound for codes with given minimum and maximum distances","publication_year":2006,"publication_date":"2006-07-01","ids":{"openalex":"https://openalex.org/W2115422885","doi":"https://doi.org/10.1109/isit.2006.261600","mag":"2115422885"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2006.261600","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5026698531","display_name":"Tor Helleseth","orcid":"https://orcid.org/0000-0003-1290-3541"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Tor Helleseth","raw_affiliation_strings":["Department of Informatics, University of Bergen, POB 7800, N-5020 Bergen, Norway. Email: Tor.Helleseth@ii.uib.no"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, POB 7800, N-5020 Bergen, Norway. Email: Tor.Helleseth@ii.uib.no","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030629295","display_name":"Torleiv Kl\u00f8ve","orcid":"https://orcid.org/0000-0002-9853-4136"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Torleiv Klove","raw_affiliation_strings":["Department of Informatics, University of Bergen, POB 7800, N-5020 Bergen, Norway. Email: Torleiv.Klove@ii.uib.no"],"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, POB 7800, N-5020 Bergen, Norway. Email: Torleiv.Klove@ii.uib.no","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032314154","display_name":"V.I. Levenshtein","orcid":null},"institutions":[{"id":"https://openalex.org/I86427540","display_name":"Keldysh Institute of Applied Mathematics","ror":"https://ror.org/01dv3hq14","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210124601","https://openalex.org/I86427540"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Vladimir Levenshtein","raw_affiliation_strings":["Keldysh Inst. for Applied Mathematics, Russian Academy of Sciences, Miusskaya sq. 4, 125047 Moscow, Russia. Email: leven@keldysh.ru"],"affiliations":[{"raw_affiliation_string":"Keldysh Inst. for Applied Mathematics, Russian Academy of Sciences, Miusskaya sq. 4, 125047 Moscow, Russia. Email: leven@keldysh.ru","institution_ids":["https://openalex.org/I86427540"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.417,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":15,"citation_normalized_percentile":{"value":0.648172,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":85,"max":86},"biblio":{"volume":null,"issue":null,"first_page":"292","last_page":"296"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"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":1.0,"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.9999,"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/T10849","display_name":"Finite Group Theory Research","score":0.9947,"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/hamming-space","display_name":"Hamming space","score":0.7628484},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.7367311},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.7030187},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.5918557},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.4929464},{"id":"https://openalex.org/keywords/hamming","display_name":"Hamming(7,4)","score":0.4709108}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.77352846},{"id":"https://openalex.org/C2779494224","wikidata":"https://www.wikidata.org/wiki/Q5645799","display_name":"Hamming space","level":5,"score":0.7628484},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.74287933},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.7367311},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.7030187},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6093664},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.5918557},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.55082846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.54649967},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.4929464},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49275616},{"id":"https://openalex.org/C112932734","wikidata":"https://www.wikidata.org/wiki/Q2322550","display_name":"Hamming(7,4)","level":5,"score":0.4709108},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.45126015},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3684392},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28534475},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.13134164},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2006.261600","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":13,"referenced_works":["https://openalex.org/W109405981","https://openalex.org/W1606480398","https://openalex.org/W1945608836","https://openalex.org/W1973483608","https://openalex.org/W2016867107","https://openalex.org/W2029376662","https://openalex.org/W2033633322","https://openalex.org/W2109084006","https://openalex.org/W2138524567","https://openalex.org/W2147865489","https://openalex.org/W2154554005","https://openalex.org/W2169207476","https://openalex.org/W229475645"],"related_works":["https://openalex.org/W4302771537","https://openalex.org/W3205692356","https://openalex.org/W2951416090","https://openalex.org/W2613408642","https://openalex.org/W2371167013","https://openalex.org/W2122308665","https://openalex.org/W2115422885","https://openalex.org/W1966523540","https://openalex.org/W1964096323","https://openalex.org/W1519122282"],"abstract_inverted_index":{"A":[0],"new":[1,37],"upper":[2],"bound":[3,22,38],"on":[4],"the":[5,10,36],"cardinality":[6],"of":[7,32],"codes":[8,33],"in":[9],"Hamming":[11],"space":[12],"with":[13],"given":[14,42],"minimum":[15],"and":[16,29],"maximum":[17],"distances":[18],"is":[19,23,39],"proved.":[20],"The":[21],"compared":[24],"to":[25],"some":[26,30],"known":[27],"bounds,":[28],"classes":[31],"for":[34],"which":[35],"tight":[40],"are":[41]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2115422885","counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3}],"updated_date":"2024-12-12T21:19:59.164774","created_date":"2016-06-24"}