{"id":"https://openalex.org/W1520957174","doi":"https://doi.org/10.1109/isit.2004.1365520","title":"On two upper bound on the size of t-EC-AUED codes","display_name":"On two upper bound on the size of t-EC-AUED codes","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W1520957174","doi":"https://doi.org/10.1109/isit.2004.1365520","mag":"1520957174"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365520","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365520","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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/A5108201807","display_name":"B. Bose","orcid":null},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"B. Bose","raw_affiliation_strings":["School of EECS, Oregon State University, Corvallis, OR, USA"],"affiliations":[{"raw_affiliation_string":"School of EECS, Oregon State University, Corvallis, OR, USA","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030629295","display_name":"Torleiv Kl\u00f8ve","orcid":"https://orcid.org/0000-0002-9853-4136"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"T. Klove","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108201807"],"corresponding_institution_ids":["https://openalex.org/I131249849"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05677863,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"39","issue":null,"first_page":"483","last_page":"483"},"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.9955999851226807,"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.9950000047683716,"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/code","display_name":"Code (set theory)","score":0.8036402463912964},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6441627740859985},{"id":"https://openalex.org/keywords/constant-weight-code","display_name":"Constant-weight code","score":0.6386092305183411},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5702090859413147},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44488435983657837},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44049370288848877},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3875850737094879},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37193384766578674},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.25610002875328064},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.16431942582130432},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.1461871862411499},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13246607780456543}],"concepts":[{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.8036402463912964},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6441627740859985},{"id":"https://openalex.org/C197242373","wikidata":"https://www.wikidata.org/wiki/Q5163613","display_name":"Constant-weight code","level":5,"score":0.6386092305183411},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5702090859413147},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44488435983657837},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44049370288848877},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3875850737094879},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37193384766578674},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.25610002875328064},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.16431942582130432},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.1461871862411499},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13246607780456543},{"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/isit.2004.1365520","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365520","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1858188314","https://openalex.org/W2011638021","https://openalex.org/W2101925257","https://openalex.org/W2361900387","https://openalex.org/W7048703830"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2377508920","https://openalex.org/W4245351974","https://openalex.org/W2886619161","https://openalex.org/W2533621910","https://openalex.org/W2383921178","https://openalex.org/W2789761906","https://openalex.org/W2093178562","https://openalex.org/W51995393","https://openalex.org/W2358999747"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"the":[3,25,36,48],"code":[4,21,38,46,52],"that":[5,35],"capable":[6],"of":[7,51],"correcting":[8],"t-errors":[9],"and":[10],"detecting":[11,45],"unidirectional":[12,43],"errors":[13],"(t-EC-AUED":[14],"code)":[15],"is":[16,22,39],"presented.":[17],"The":[18,32],"t-EC":[19],"AUED":[20],"studied":[23],"with":[24,47],"maximal":[26],"size":[27],"by":[28],"using":[29],"Sperner's":[30],"theorem.":[31],"theorem":[33],"says":[34],"balanced":[37],"an":[40],"optimal":[41],"all":[42],"error":[44],"maximum":[49],"number":[50],"words.":[53]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}