{"id":"https://openalex.org/W2108851207","doi":"https://doi.org/10.1109/tit.1969.1054263","title":"Minimum distance estimates of the performance of sequential decoders","display_name":"Minimum distance estimates of the performance of sequential decoders","publication_year":1969,"publication_date":"1969-01-01","ids":{"openalex":"https://openalex.org/W2108851207","doi":"https://doi.org/10.1109/tit.1969.1054263","mag":"2108851207"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1969.1054263","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1969.1054263","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/A5109804540","display_name":"John E. Savage","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. Savage","raw_affiliation_strings":["Division of Engineering, Brown University, Providence, RI, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Division of Engineering, Brown University, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109804540"],"corresponding_institution_ids":["https://openalex.org/I27804330"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.35905045,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"1","first_page":"128","last_page":"140"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9994999766349792,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6535254120826721},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.5889784693717957},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5514333844184875},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5240645408630371},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5114427804946899},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4796605408191681},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45862075686454773},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4460160732269287},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4459036886692047},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40029600262641907},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3534072935581207},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.3454245924949646},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.0942208468914032}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6535254120826721},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.5889784693717957},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5514333844184875},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5240645408630371},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5114427804946899},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4796605408191681},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45862075686454773},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4460160732269287},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4459036886692047},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40029600262641907},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3534072935581207},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.3454245924949646},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0942208468914032},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"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},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1969.1054263","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1969.1054263","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1527268325","https://openalex.org/W1577906631","https://openalex.org/W1971577485","https://openalex.org/W1976797517","https://openalex.org/W1991133427","https://openalex.org/W1993944611","https://openalex.org/W1999621872","https://openalex.org/W2001705110","https://openalex.org/W2064759901","https://openalex.org/W2087362480","https://openalex.org/W2128700225","https://openalex.org/W2158923807","https://openalex.org/W2264297261","https://openalex.org/W4234345682"],"related_works":["https://openalex.org/W4390826522","https://openalex.org/W1650414643","https://openalex.org/W2976484395","https://openalex.org/W1546755125","https://openalex.org/W2133231244","https://openalex.org/W2154612888","https://openalex.org/W2514995321","https://openalex.org/W3136353702","https://openalex.org/W1499116563","https://openalex.org/W1998204618"],"abstract_inverted_index":{"In":[0,17],"the":[1,6,29,32,49,62,67,72,80,92,96,103,121,125,130,139,151,174,184,189,200,214,219],"past,":[2],"criteria":[3],"for":[4],"predicting":[5],"performance":[7,30],"of":[8,28,37,48,61,71,79,85,95,106,132,153,163,191,193,203,213],"individual":[9],"codes":[10,166,192],"with":[11,44,143,146,167,183,221],"sequential":[12],"decoding":[13,107,134,204],"have":[14],"been":[15],"intuitive.":[16],"this":[18],"paper,":[19],"simple":[20],"tests":[21],"are":[22],"derived":[23,101],"that":[24],"allow":[25],"easy":[26],"determination":[27],"on":[31,102],"BSC":[33,63,220],"(binary":[34],"symmetric":[35],"channel)":[36],"a":[38,45,77,133,168,197],"given":[39],"binary":[40,164],"convolutional":[41,165],"code":[42,122],"decoded":[43],"modified":[46],"version":[47],"Fano":[50],"algorithm.":[51],"A":[52,98],"\"distance-guaranteed":[53],"computational":[54,216],"cutoff":[55,217],"rate,\"R_{dgcomp},":[56],"is":[57,76,100,110,136,155,177,181,206],"defined":[58],"in":[59],"terms":[60],"crossover":[64,222],"probability":[65,131,152,223],"and":[66,90,109,115,138],"\"uniform":[68],"minimum":[69,81,170],"distance\"":[70],"code.":[73,97],"The":[74,161,208],"latter":[75],"measure":[78],"distance":[82,171],"between":[83],"codewords":[84],"all":[86],"lengths":[87],"up":[88],"to":[89,112,117],"including":[91],"constraint":[93,118,144],"length":[94,119,145],"bound":[99,140,176],"average":[104,201],"number":[105,202],"computations":[108,205],"shown":[111],"be":[113],"small":[114,156],"insensitive":[116],"if":[120],"rate,R,":[123],"satisfies":[124],"testR":[126],"<":[127,186],"R_{dgcomp}.":[128],"Also,":[129],"error":[135,154],"overbounded":[137],"decreases":[141],"exponentially":[142],"exponent(R_{dgcomp}":[147],"-":[148,158],"R).":[149],"Consequently,":[150],"if(R_{dgcom}":[157],"R)is":[159],"large.":[160],"existence":[162,190],"uniform":[169],"which":[172,199],"meets":[173],"Gilbert":[175],"demonstrated.":[178],"This":[179],"result":[180],"combined":[182],"conditionR":[185],"R_{dgcomp}to":[187],"show":[188],"rate":[194],"less":[195],"than":[196],"rateR_{D}for":[198],"small.":[207],"rateR_{D}is":[209],"approximately":[210],"one":[211],"half":[212],"true":[215],"rateR_{comp}on":[218],"of10^{-4}.":[224]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}