{"id":"https://openalex.org/W2146655154","doi":"https://doi.org/10.1109/isit.2004.1365332","title":"A repeat request strategy based on sliding window decoding of convolutional codes","display_name":"A repeat request strategy based on sliding window decoding of convolutional codes","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2146655154","doi":"https://doi.org/10.1109/isit.2004.1365332","mag":"2146655154"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365332","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365332","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/A5018506368","display_name":"J\u00fcrgen Freudenberger","orcid":"https://orcid.org/0000-0002-5913-4981"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"J. Freudenberger","raw_affiliation_strings":["Department of Telecommunications and Applied Information Theory, University of Ulm (EBS), Germany"],"affiliations":[{"raw_affiliation_string":"Department of Telecommunications and Applied Information Theory, University of Ulm (EBS), Germany","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045353828","display_name":"Martin Bossert","orcid":"https://orcid.org/0000-0002-3827-9065"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"M. Bossert","raw_affiliation_strings":["Department of Telecommunications and Applied Information Theory, University of Ulm (EBS), Germany"],"affiliations":[{"raw_affiliation_string":"Department of Telecommunications and Applied Information Theory, University of Ulm (EBS), Germany","institution_ids":["https://openalex.org/I196349391"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058416031","display_name":"Sergo Shavgulidze","orcid":"https://orcid.org/0000-0001-9236-0772"},"institutions":[{"id":"https://openalex.org/I131762061","display_name":"Georgian Technical University","ror":"https://ror.org/00aamz256","country_code":"GE","type":"education","lineage":["https://openalex.org/I131762061"]}],"countries":["GE"],"is_corresponding":false,"raw_author_name":"S. Shavgulidze","raw_affiliation_strings":["Department of Digital Communication Theory, Georgian Technical University, Tbilisi, GA, Georgia"],"affiliations":[{"raw_affiliation_string":"Department of Digital Communication Theory, Georgian Technical University, Tbilisi, GA, Georgia","institution_ids":["https://openalex.org/I131762061"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5018506368"],"corresponding_institution_ids":["https://openalex.org/I196349391"],"apc_list":null,"apc_paid":null,"fwci":0.3372,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.63408265,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"295","last_page":"295"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9995999932289124,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9995999932289124,"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/convolutional-code","display_name":"Convolutional code","score":0.9472805857658386},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.786628246307373},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.7747775316238403},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7371091842651367},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6672592759132385},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.6345986127853394},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5767037868499756},{"id":"https://openalex.org/keywords/sliding-window-protocol","display_name":"Sliding window protocol","score":0.5674682855606079},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5527679324150085},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5511851906776428},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5063966512680054},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.4527932405471802},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4014568030834198},{"id":"https://openalex.org/keywords/window","display_name":"Window (computing)","score":0.1303008496761322}],"concepts":[{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.9472805857658386},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.786628246307373},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.7747775316238403},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7371091842651367},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6672592759132385},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.6345986127853394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5767037868499756},{"id":"https://openalex.org/C102392041","wikidata":"https://www.wikidata.org/wiki/Q592860","display_name":"Sliding window protocol","level":3,"score":0.5674682855606079},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5527679324150085},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5511851906776428},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5063966512680054},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.4527932405471802},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4014568030834198},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.1303008496761322},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2004.1365332","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365332","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":[{"score":0.8100000023841858,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2044921145","https://openalex.org/W2115792869","https://openalex.org/W2115827190"],"related_works":["https://openalex.org/W2134727924","https://openalex.org/W3097264971","https://openalex.org/W99853930","https://openalex.org/W1520296533","https://openalex.org/W2992200486","https://openalex.org/W190540493","https://openalex.org/W1504657239","https://openalex.org/W2010879611","https://openalex.org/W2135388054","https://openalex.org/W2566690554"],"abstract_inverted_index":{"We":[0],"investigate":[1],"a":[2,13,19,35,71,105],"decision":[3,23,60,114],"feedback":[4,61],"strategy":[5],"for":[6,42,54,69],"convolutional":[7,36,48,100],"codes":[8,65,87],"which":[9],"is":[10,80,121],"based":[11],"on":[12],"sliding":[14],"window":[15],"decoding":[16,78,84,108],"procedure":[17,79],"and":[18,38],"threshold":[20],"test":[21],"as":[22],"rule.":[24],"For":[25,74,128],"this":[26],"purpose,":[27],"we":[28],"introduce":[29],"the":[30,43,55,59,77,83,91,94,99,117,124],"burst":[31],"distance":[32],"spectrum":[33],"of":[34,45,58,85,93,98],"code":[37],"derive":[39],"asymptotic":[40,56,119],"bounds":[41],"ensemble":[44],"periodically":[46],"time-varying":[47],"codes.":[49],"These":[50],"results":[51,132],"are":[52,66],"helpful":[53],"analysis":[57],"scheme.":[62,73],"Unit":[63],"memory":[64],"particularly":[67],"suited":[68],"such":[70],"transmission":[72],"these":[75,135],"codes,":[76],"reduced":[81],"to":[82,104,123],"block":[86],"with":[88,111],"lengths":[89],"in":[90],"order":[92],"overall":[95],"constraint":[96],"length":[97],"code.":[101],"This":[102],"leads":[103],"significantly":[106],"smaller":[107],"complexity":[109],"compared":[110],"other":[112],"known":[113,126],"rules.":[115],"Whereas":[116],"achievable":[118],"performance":[120],"close":[122],"best":[125],"bounds.":[127,136],"low":[129],"rates,":[130],"our":[131],"even":[133],"improve":[134]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
