{"id":"https://openalex.org/W1688268837","doi":"https://doi.org/10.1109/itw.2015.7133087","title":"Refined upper bounds on stopping redundancy of binary linear codes","display_name":"Refined upper bounds on stopping redundancy of binary linear codes","publication_year":2015,"publication_date":"2015-04-01","ids":{"openalex":"https://openalex.org/W1688268837","doi":"https://doi.org/10.1109/itw.2015.7133087","mag":"1688268837"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2015.7133087","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2015.7133087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1410.8753","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Yauhen Yakimenka","orcid":null},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"education","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Yauhen Yakimenka","raw_affiliation_strings":["Institute of Computer Science, University of Tartu, Estonia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Tartu, Estonia","institution_ids":["https://openalex.org/I56085075"]}]},{"author_position":"last","author":{"id":null,"display_name":"Vitaly Skachek","orcid":null},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"education","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Vitaly Skachek","raw_affiliation_strings":["Institute of Computer Science, University of Tartu, Estonia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Tartu, Estonia","institution_ids":["https://openalex.org/I56085075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I56085075"],"apc_list":null,"apc_paid":null,"fwci":1.0582,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.7355817,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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.9998999834060669,"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/T11130","display_name":"Coding theory and cryptography","score":0.9995999932289124,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.6658999919891357},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.6111999750137329},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5752999782562256},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5687999725341797},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.49160000681877136},{"id":"https://openalex.org/keywords/stopping-rule","display_name":"Stopping rule","score":0.4090000092983246},{"id":"https://openalex.org/keywords/optimal-stopping","display_name":"Optimal stopping","score":0.39309999346733093},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3788999915122986}],"concepts":[{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.6658999919891357},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6593999862670898},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.6111999750137329},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5752999782562256},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5687999725341797},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5544999837875366},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.49160000681877136},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41260001063346863},{"id":"https://openalex.org/C2983961125","wikidata":"https://www.wikidata.org/wiki/Q1288707","display_name":"Stopping rule","level":2,"score":0.4090000092983246},{"id":"https://openalex.org/C99414536","wikidata":"https://www.wikidata.org/wiki/Q7098950","display_name":"Optimal stopping","level":2,"score":0.39309999346733093},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3788999915122986},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3756999969482422},{"id":"https://openalex.org/C99888217","wikidata":"https://www.wikidata.org/wiki/Q1288707","display_name":"Stopping time","level":2,"score":0.36320000886917114},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.3345000147819519},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.3197000026702881},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.3109000027179718},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2987000048160553},{"id":"https://openalex.org/C60782215","wikidata":"https://www.wikidata.org/wiki/Q3333679","display_name":"Probabilistic method","level":3,"score":0.2842999994754791},{"id":"https://openalex.org/C5465570","wikidata":"https://www.wikidata.org/wiki/Q5326898","display_name":"Early stopping","level":3,"score":0.2840999960899353},{"id":"https://openalex.org/C163561899","wikidata":"https://www.wikidata.org/wiki/Q1994977","display_name":"Logical matrix","level":3,"score":0.2822999954223633},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.25699999928474426}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/itw.2015.7133087","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2015.7133087","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1410.8753","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1410.8753","pdf_url":"https://arxiv.org/pdf/1410.8753","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1410.8753","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1410.8753","pdf_url":"https://arxiv.org/pdf/1410.8753","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1988416194","https://openalex.org/W1991706950","https://openalex.org/W2008209264","https://openalex.org/W2095882513","https://openalex.org/W2100305297","https://openalex.org/W2104459449","https://openalex.org/W2106682188","https://openalex.org/W2115995841","https://openalex.org/W2125087461","https://openalex.org/W2138850861","https://openalex.org/W2140227657","https://openalex.org/W2156660752","https://openalex.org/W2164611661"],"related_works":[],"abstract_inverted_index":{"The":[0,44],"l-th":[1],"stopping":[2,36,45,62],"redundancy":[3,46],"\u03c1\u03b9(C)":[4],"of":[5,24,30,39,61],"the":[6,21,27,34,58,72,83,88,95,106,123],"binary":[7],"[n,":[8],"k,":[9],"d]":[10],"code":[11],"C,":[12,31],"1":[13,113],"\u2264":[14,16,114,116],"l":[15,115],"d,":[17],"is":[18,38,48,120],"defined":[19,49],"as":[20,50],"minimum":[22],"number":[23],"rows":[25,86],"in":[26,87],"parity-check":[28,89],"matrix":[29],"such":[32],"that":[33],"smallest":[35],"set":[37],"size":[40],"at":[41],"least":[42],"l.":[43],"\u03c1(C)":[47],"\u03c1d(C).":[51],"In":[52,77],"this":[53],"work,":[54],"we":[55,80,102],"improve":[56,103],"on":[57,105,110],"probabilistic":[59,96],"analysis":[60],"redundancy,":[63],"proposed":[64],"by":[65,126],"Han,":[66],"Siegel":[67],"and":[68,91],"Vardy,":[69],"which":[70],"yields":[71],"best":[73,107],"bounds":[74,109],"known":[75,108],"today.":[76],"our":[78],"approach,":[79],"judiciously":[81],"select":[82],"first":[84],"few":[85],"matrix,":[90],"then":[92],"continue":[93],"with":[94],"method.":[97],"By":[98],"using":[99],"similar":[100],"techniques,":[101],"also":[104],"\u03c1\u03b9(C),":[111],"for":[112],"d.":[117],"Our":[118],"approach":[119],"compared":[121],"to":[122],"existing":[124],"methods":[125],"numerical":[127],"computations.":[128]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2016-06-24T00:00:00"}