{"id":"https://openalex.org/W2564495413","doi":"https://doi.org/10.1109/isit.2005.1523483","title":"On the stopping distance and the stopping redundancy of codes","display_name":"On the stopping distance and the stopping redundancy of codes","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2564495413","doi":"https://doi.org/10.1109/isit.2005.1523483","mag":"2564495413"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523483","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523483","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","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/A5054043026","display_name":"Moshe Schwartz","orcid":"https://orcid.org/0000-0002-1449-0026"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M. Schwartz","raw_affiliation_strings":["University of California, San Diego, La Jolla, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004102644","display_name":"Alexander Vardy","orcid":"https://orcid.org/0000-0003-3303-9078"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Vardy","raw_affiliation_strings":["University of California, San Diego, La Jolla, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054043026"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":5.4746,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.9625416,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"48","issue":null,"first_page":"975","last_page":"979"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9991000294685364,"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.9976000189781189,"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/parity-check-matrix","display_name":"Parity-check matrix","score":0.588229775428772},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5629342794418335},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.5333238840103149},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5231622457504272},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.5229980945587158},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.5012493133544922},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.4877637028694153},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4797464609146118},{"id":"https://openalex.org/keywords/binary-golay-code","display_name":"Binary Golay code","score":0.46909913420677185},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4663834571838379},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.46159693598747253},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.45767518877983093},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4498528242111206},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4279952347278595},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.33159810304641724},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2727554738521576},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.23693084716796875},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.22221022844314575},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.13364699482917786},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.12189790606498718},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.09648901224136353}],"concepts":[{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.588229775428772},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5629342794418335},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.5333238840103149},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5231622457504272},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.5229980945587158},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.5012493133544922},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.4877637028694153},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4797464609146118},{"id":"https://openalex.org/C165293857","wikidata":"https://www.wikidata.org/wiki/Q1534522","display_name":"Binary Golay code","level":2,"score":0.46909913420677185},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4663834571838379},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.46159693598747253},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.45767518877983093},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4498528242111206},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4279952347278595},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.33159810304641724},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2727554738521576},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.23693084716796875},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.22221022844314575},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.13364699482917786},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.12189790606498718},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.09648901224136353},{"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.2005.1523483","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523483","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1606480398","https://openalex.org/W1995990042","https://openalex.org/W2008697975","https://openalex.org/W2011638021","https://openalex.org/W2013108310","https://openalex.org/W2029616558","https://openalex.org/W2033546746","https://openalex.org/W2045460927","https://openalex.org/W2063146933","https://openalex.org/W2068699755","https://openalex.org/W2087793641","https://openalex.org/W2095882513","https://openalex.org/W2100305297","https://openalex.org/W2104459449","https://openalex.org/W2112682069","https://openalex.org/W2133945375","https://openalex.org/W2138850861","https://openalex.org/W2167943285","https://openalex.org/W6674742683"],"related_works":["https://openalex.org/W1982790092","https://openalex.org/W2356592052","https://openalex.org/W122830177","https://openalex.org/W2809536251","https://openalex.org/W4302175014","https://openalex.org/W2952823298","https://openalex.org/W2034577597","https://openalex.org/W2904381917","https://openalex.org/W2075723463","https://openalex.org/W3014066328"],"abstract_inverted_index":{"It":[0,83],"is":[1,24,55,84,94,106,220],"now":[2],"well":[3],"known":[4],"that":[5,88,104,122,153,216,231],"the":[6,27,30,35,48,61,64,69,76,95,133,140,154,174,194,200,205,232,236,258],"performance":[7],"of":[8,29,52,57,63,79,99,136,143,177,186,196,207,235,261],"a":[9,17,58,80,111,129,146,223],"linear":[10,178],"code":[11],"Copf":[12,73,115,151],"under":[13],"iterative":[14],"decoding":[15],"on":[16,75,173,199,257],"binary":[18,208,237],"erasure":[19],"channel":[20],"(and":[21],"other":[22,190],"channels)":[23],"determined":[25],"by":[26],"size":[28,62],"smallest":[31,65],"stopping":[32,49,66,134,156,175,201,218,233,259],"set":[33,67],"in":[34,68,145],"Tanner":[36,70],"graph":[37,71],"for":[38,72,114,150,204],"Copf.":[39,53],"Several":[40],"recent":[41],"papers":[42],"refer":[43],"to":[44,86,109],"this":[45],"parameter":[46],"as":[47,139],"distance":[50,98,157],"s":[51,89,123],"This":[54],"somewhat":[56],"misnomer":[59],"since":[60],"depends":[74],"corresponding":[77,155],"choice":[78],"parity-check":[81,112,147],"matrix.":[82],"easy":[85],"see":[87],"les":[90],"d,":[91],"where":[92],"d":[93],"minimum":[96,141],"Hamming":[97],"Copf,":[100,137],"and":[101,192,238,247,254],"we":[102,214,251],"show":[103,230],"it":[105],"always":[107],"possible":[108,162],"choose":[110],"matrix":[113,148],"(with":[116],"sufficiently":[117],"many":[118],"dependent":[119],"rows)":[120],"such":[121,152],"=":[124,166],"d.":[125,167],"We":[126,168,180,229],"thus":[127],"introduce":[128],"new":[130],"parameter,":[131],"termed":[132],"redundancy":[135,176,219,260],"defined":[138],"number":[142],"rows":[144],"H":[149],"s(H)":[158,165],"attains":[159],"its":[160],"largest":[161],"value,":[163],"namely":[164],"then":[169],"derive":[170],"general":[171],"bounds":[172,256],"codes.":[179],"also":[181],"examine":[182],"several":[183],"simple":[184],"ways":[185],"constructing":[187],"codes":[188,210,242,263],"from":[189],"codes,":[191],"study":[193],"effect":[195],"these":[197],"constructions":[198],"redundancy.":[202,228],"Specifically,":[203],"family":[206],"Reed-Muller":[209],"(of":[211],"all":[212],"orders),":[213],"prove":[215],"their":[217,226],"at":[221,244],"most":[222,245],"constant":[224],"times":[225],"conventional":[227],"redundancies":[234],"ternary":[239],"extended":[240],"Golay":[241],"are":[243],"34":[246],"22,":[248],"respectively.":[249],"Finally,":[250],"provide":[252],"upper":[253],"lower":[255],"MDS":[262]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}