{"id":"https://openalex.org/W2073107988","doi":"https://doi.org/10.1109/tit.1969.1054311","title":"A strengthened asymptotic Gilbert bound for convolutional codes (Corresp.)","display_name":"A strengthened asymptotic Gilbert bound for convolutional codes (Corresp.)","publication_year":1969,"publication_date":"1969-05-01","ids":{"openalex":"https://openalex.org/W2073107988","doi":"https://doi.org/10.1109/tit.1969.1054311","mag":"2073107988"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1969.1054311","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1969.1054311","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/A5015730226","display_name":"Edward K. Bower","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"E. Bower","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5029063535","display_name":"S. E. Dwyer","orcid":"https://orcid.org/0000-0002-2068-277X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Dwyer","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015730226"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.13420159,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"3","first_page":"433","last_page":"435"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9987999796867371,"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.9987999796867371,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9968000054359436,"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/T11797","display_name":"graph theory and CDMA systems","score":0.996399998664856,"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/convolutional-code","display_name":"Convolutional code","score":0.6386712789535522},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.62716144323349},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6172515153884888},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6062031984329224},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5959794521331787},{"id":"https://openalex.org/keywords/statement","display_name":"Statement (logic)","score":0.5763051509857178},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5073582530021667},{"id":"https://openalex.org/keywords/assertion","display_name":"Assertion","score":0.4991588592529297},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.4775962829589844},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39486047625541687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26622629165649414},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.19605383276939392},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1800694763660431},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.15025004744529724},{"id":"https://openalex.org/keywords/law","display_name":"Law","score":0.09616586565971375},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07989481091499329}],"concepts":[{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.6386712789535522},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.62716144323349},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6172515153884888},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6062031984329224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5959794521331787},{"id":"https://openalex.org/C2777026412","wikidata":"https://www.wikidata.org/wiki/Q2684591","display_name":"Statement (logic)","level":2,"score":0.5763051509857178},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5073582530021667},{"id":"https://openalex.org/C40422974","wikidata":"https://www.wikidata.org/wiki/Q741248","display_name":"Assertion","level":2,"score":0.4991588592529297},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.4775962829589844},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39486047625541687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26622629165649414},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.19605383276939392},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1800694763660431},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.15025004744529724},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.09616586565971375},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07989481091499329},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1969.1054311","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1969.1054311","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1971577485","https://openalex.org/W1985409083","https://openalex.org/W2001705110","https://openalex.org/W2081275524","https://openalex.org/W2137264294","https://openalex.org/W4251179070","https://openalex.org/W4300188436"],"related_works":["https://openalex.org/W1498103021","https://openalex.org/W2035655557","https://openalex.org/W4230849338","https://openalex.org/W4295166216","https://openalex.org/W2177044681","https://openalex.org/W1968067090","https://openalex.org/W2090313512","https://openalex.org/W2150454230","https://openalex.org/W1989997946","https://openalex.org/W3006690200"],"abstract_inverted_index":{"The":[0],"usual":[1,52],"statement":[2],"of":[3,15,19,42,45],"the":[4,43,51,62],"Gilbert":[5,54],"bound":[6],"is":[7,28],"an":[8,38],"assertion":[9],"that":[10,32],"at":[11],"least":[12],"one":[13],"member":[14],"a":[16,22],"given":[17],"ensemble":[18,44],"codes":[20,46],"satisfies":[21],"minimum":[23,48],"distance":[24,49],"criterion.":[25],"This":[26],"result":[27],"strengthened":[29],"by":[30],"showing":[31],"for":[33,61],"sufficiently":[34],"large":[35,40],"constraint":[36],"lengths,":[37],"arbitrarily":[39],"fraction":[41],"have":[47],"exceeding":[50],"asymptotic":[53,57],"bound.":[55],"New":[56],"bounds":[58],"are":[59],"derived":[60],"nonbinary":[63],"case.":[64]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}