{"id":"https://openalex.org/W2096337439","doi":"https://doi.org/10.1109/isit.2010.5513741","title":"On efficient repetition error correcting codes","display_name":"On efficient repetition error correcting codes","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2096337439","doi":"https://doi.org/10.1109/isit.2010.5513741","mag":"2096337439"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513741","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513741","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"conference-paper","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/A5002622368","display_name":"Luca G. Tallini","orcid":"https://orcid.org/0000-0003-4238-173X"},"institutions":[{"id":"https://openalex.org/I124326101","display_name":"University of Teramo","ror":"https://ror.org/01yetye73","country_code":"IT","type":"education","lineage":["https://openalex.org/I124326101"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luca G. Tallini","raw_affiliation_strings":["Dip. di Scienze della Comunicazione, Universit\u00e0 degli Studi di Teramo, Coste San Agostino, Teramo, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dip. di Scienze della Comunicazione, Universit\u00e0 degli Studi di Teramo, Coste San Agostino, Teramo, Italy","institution_ids":["https://openalex.org/I124326101"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004849825","display_name":"Noha Elarief","orcid":null},"institutions":[{"id":"https://openalex.org/I124326101","display_name":"University of Teramo","ror":"https://ror.org/01yetye73","country_code":"IT","type":"education","lineage":["https://openalex.org/I124326101"]},{"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":["IT","US"],"is_corresponding":false,"raw_author_name":"Noha Elarief","raw_affiliation_strings":["Dip. di Scienze della Comunicazione, Universit\u00e0 degli Studi di Teramo, Coste San Agostino, Teramo, Italy","School of EECS, Oregon State University, Corvallis, OR, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dip. di Scienze della Comunicazione, Universit\u00e0 degli Studi di Teramo, Coste San Agostino, Teramo, Italy","institution_ids":["https://openalex.org/I124326101"]},{"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/A5108277072","display_name":"Bella 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":false,"raw_author_name":"Bella Bose","raw_affiliation_strings":["School of EECS, Oregon State University, Corvallis, OR, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of EECS, Oregon State University, Corvallis, OR, USA","institution_ids":["https://openalex.org/I131249849"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6944,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.92942899,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1012","last_page":"1016"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9993000030517578,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5112617015838623},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4491925537586212},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.43007534742355347},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.42343869805336},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4080217480659485},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3834936022758484},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34392616152763367},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31402117013931274},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2596626281738281},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.20367351174354553},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13491374254226685}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5112617015838623},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4491925537586212},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.43007534742355347},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.42343869805336},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4080217480659485},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3834936022758484},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34392616152763367},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31402117013931274},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2596626281738281},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.20367351174354553},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13491374254226685},{"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":2,"locations":[{"id":"doi:10.1109/isit.2010.5513741","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513741","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:research.unite.it:11575/1967","is_oa":false,"landing_page_url":"http://hdl.handle.net/11575/1967","pdf_url":null,"source":{"id":"https://openalex.org/S4306401171","display_name":"UniTERAMO Research Catalog (University of Teramo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124326101","host_organization_name":"University of Teramo","host_organization_lineage":["https://openalex.org/I124326101"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2082173153","https://openalex.org/W2109386785","https://openalex.org/W2147555059","https://openalex.org/W2165012485","https://openalex.org/W2509017166","https://openalex.org/W6676293227","https://openalex.org/W6910292315"],"related_works":["https://openalex.org/W88624181","https://openalex.org/W2910428196","https://openalex.org/W2369939250","https://openalex.org/W2118907425","https://openalex.org/W2277344664","https://openalex.org/W2980963558","https://openalex.org/W2895235410","https://openalex.org/W251429526","https://openalex.org/W2304380675","https://openalex.org/W2962814632"],"abstract_inverted_index":{"This":[0],"paper":[1],"gives":[2,41],"the":[3,16,25,75,83,104,112,119,156],"theory":[4],"and":[5,18],"design":[6],"of":[7,11,20,55,73,77,85,106,118],"efficient":[8,29],"codes":[9],"capable":[10,72],"correcting":[12,74,82],"errors":[13],"caused":[14],"by":[15],"insertion":[17,76],"deletion":[19,84],"a":[21,42,52,95,137],"repeated":[22],"symbol":[23],"in":[24,88],"information":[26,49,107],"sequence.":[27],"Two":[28],"methods":[30],"are":[31],"described.":[32],"For":[33],"any":[34],"fixed":[35,43],"t+,":[36],"t-\u2208":[37],"IN,":[38],"one":[39],"method":[40,93],"length":[44,56,98],"scheme":[45,99],"to":[46,111,155],"encode":[47],"k":[48,59,109,141],"bits":[50,108],"into":[51],"systematic":[53,96],"code":[54],"n":[57],"=":[58,64,128,148],"+":[60,68,131],"r,":[61],"with":[62],"r":[63],"(t++":[65],"t-)":[66],"log2k":[67],"O(log":[69],"log":[70],"k),":[71],"t+repeated":[78],"symbols":[79,87],"and,":[80],"simultaneously,":[81],"t-repeated":[86],"every":[89],"codeword.":[90],"The":[91,115,143,153],"second":[92],"is":[94,126,146,162],"variable":[97],"which":[100],"on":[101],"average":[102],"doubles":[103],"number":[105],"compared":[110],"first":[113],"method.":[114],"time":[116],"complexity":[117,145],"entire":[120],"coding":[121],"process":[122],"for":[123],"both":[124],"schemes":[125],"T":[127],"O":[129],"(k":[130],"(1+min{t-,":[132],"t+})t)":[133],"multiplication":[134],"operations":[135],"over":[136],"finite":[138],"field":[139,150],"containing":[140],"elements.":[142,152],"space":[144],"S":[147],"O(k+t)":[149],"memory":[151],"generalization":[154],"m-ary":[157],"case,":[158],"m":[159],"\u2265":[160],"2,":[161],"also":[163],"given.":[164]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}