{"id":"https://openalex.org/W2025557430","doi":"https://doi.org/10.1109/isit.2005.1523472","title":"New upper bounds on A(n, d)","display_name":"New upper bounds on A(n, d)","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2025557430","doi":"https://doi.org/10.1109/isit.2005.1523472","mag":"2025557430"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523472","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-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/A5049021714","display_name":"Beniamin Mounits","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"B. Mounits","raw_affiliation_strings":["Department of Mathematics, Technion-Israel Institute of Technology, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technion-Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062149532","display_name":"Tuvi Etzion","orcid":"https://orcid.org/0000-0002-4315-4400"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"T. Etzion","raw_affiliation_strings":["Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Technion-Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044662173","display_name":"Simon Litsyn","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"S. Litsyn","raw_affiliation_strings":["Department of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11088747,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"46","issue":null,"first_page":"921","last_page":"925"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"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.9998999834060669,"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.9998999834060669,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9970999956130981,"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/hamming-distance","display_name":"Hamming distance","score":0.7481057643890381},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6903262734413147},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6458479166030884},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5994833111763},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.561149537563324},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.5540437698364258},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.546035647392273},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5371999740600586},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.48565995693206787},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45856890082359314},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.4431169927120209},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4285157322883606},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3406987190246582},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32948166131973267},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.25408291816711426},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2152007520198822},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.12930670380592346}],"concepts":[{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.7481057643890381},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6903262734413147},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6458479166030884},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5994833111763},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.561149537563324},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.5540437698364258},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.546035647392273},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5371999740600586},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.48565995693206787},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45856890082359314},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.4431169927120209},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4285157322883606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3406987190246582},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32948166131973267},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.25408291816711426},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2152007520198822},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.12930670380592346},{"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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2005.1523472","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523472","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W109405981","https://openalex.org/W1606480398","https://openalex.org/W2009324029","https://openalex.org/W2055574822","https://openalex.org/W2109703172","https://openalex.org/W2116555776","https://openalex.org/W2137806147","https://openalex.org/W2142293082","https://openalex.org/W2154746932","https://openalex.org/W2168946262","https://openalex.org/W4285719527","https://openalex.org/W6604469142"],"related_works":["https://openalex.org/W2371167013","https://openalex.org/W1964096323","https://openalex.org/W2951416090","https://openalex.org/W4302771537","https://openalex.org/W2109703172","https://openalex.org/W4285078748","https://openalex.org/W2562336992","https://openalex.org/W2364890299","https://openalex.org/W1997618736","https://openalex.org/W1976116479"],"abstract_inverted_index":{"Upper":[0],"bounds":[1,23,38,49],"on":[2,40],"the":[3,41],"maximum":[4],"number":[5],"of":[6,12,29,36],"codewords":[7],"in":[8],"a":[9,13,27],"binary":[10],"code":[11],"given":[14],"length":[15],"and":[16,32],"minimum":[17],"Hamming":[18],"distance":[19],"are":[20,24,50],"considered.":[21],"New":[22],"derived":[25],"by":[26],"combination":[28],"linear":[30],"programming":[31],"counting":[33],"arguments.":[34],"Some":[35],"these":[37],"improve":[39],"best":[42],"known":[43],"analytic":[44],"bounds.":[45],"Several":[46],"new":[47],"record":[48],"obtained":[51],"for":[52],"codes":[53],"with":[54],"small":[55],"lengths":[56]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}