{"id":"https://openalex.org/W2109312449","doi":"https://doi.org/10.1109/isit.2010.5513667","title":"An upper bound on the separating redundancy of linear block codes","display_name":"An upper bound on the separating redundancy of linear block codes","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2109312449","doi":"https://doi.org/10.1109/isit.2010.5513667","mag":"2109312449"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513667","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513667","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/A5102938606","display_name":"Khaled Abdel-Ghaffar","orcid":"https://orcid.org/0000-0002-3128-0557"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Khaled A.S. Abdel-Ghaffar","raw_affiliation_strings":["Department ECE, University of California, Davis, CA, USA","University of California, Dept. ECE, Davis, 95616, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department ECE, University of California, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]},{"raw_affiliation_string":"University of California, Dept. ECE, Davis, 95616, USA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058084781","display_name":"Jos H. Weber","orcid":"https://orcid.org/0000-0002-8333-1301"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jos H. Weber","raw_affiliation_strings":["IRCTR/CWP, Delft University of Technnology, Delft, Netherlands","Delft University of Technology, IRCTR/CWPC, Mekelweg 4, 2628 CD, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IRCTR/CWP, Delft University of Technnology, Delft, Netherlands","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"Delft University of Technology, IRCTR/CWPC, Mekelweg 4, 2628 CD, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2934,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.49413919,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1173","last_page":"1177"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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":1.0,"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.9993000030517578,"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/T11130","display_name":"Coding theory and cryptography","score":0.9991000294685364,"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/row","display_name":"Row","score":0.7628387212753296},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.7531203031539917},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.7024104595184326},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6687725186347961},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.639356791973114},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6068652868270874},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.48927995562553406},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.47908836603164673},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45644834637641907},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4151192903518677},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.41072511672973633},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4077881872653961},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.38661396503448486},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.34421199560165405},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32248619198799133}],"concepts":[{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.7628387212753296},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.7531203031539917},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.7024104595184326},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6687725186347961},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.639356791973114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6068652868270874},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.48927995562553406},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.47908836603164673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45644834637641907},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4151192903518677},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.41072511672973633},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4077881872653961},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.38661396503448486},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.34421199560165405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32248619198799133},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2010.5513667","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513667","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:CiteSeerX.psu:10.1.1.670.7113","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.670.7113","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ewi.tudelft.nl/fileadmin/Faculteit/EWI/Over_de_faculteit/Afdelingen/Telecommunications/Organisation/Sections/WMC/Staff/Weber/Publications/doc/05513667_ISIT2010.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1606480398","https://openalex.org/W1965142549","https://openalex.org/W1977881550","https://openalex.org/W2042378894","https://openalex.org/W2095686445","https://openalex.org/W2095882513","https://openalex.org/W2104459449","https://openalex.org/W2115104320","https://openalex.org/W2115995841","https://openalex.org/W2125087461","https://openalex.org/W2140227657","https://openalex.org/W2172152579","https://openalex.org/W2291234909","https://openalex.org/W2782534263","https://openalex.org/W2895239415","https://openalex.org/W3104554114","https://openalex.org/W4212799367"],"related_works":["https://openalex.org/W2537963609","https://openalex.org/W2092857423","https://openalex.org/W2361792238","https://openalex.org/W135568846","https://openalex.org/W2460434904","https://openalex.org/W2954849755","https://openalex.org/W2182725540","https://openalex.org/W3126598192","https://openalex.org/W2066141615","https://openalex.org/W2090897912"],"abstract_inverted_index":{"Linear":[0],"block":[1],"codes":[2,74],"over":[3],"noisy":[4],"channels":[5],"causing":[6],"both":[7],"erasures":[8],"and":[9,19,30,66],"errors":[10],"can":[11,37],"be":[12,38],"decoded":[13],"by":[14],"deleting":[15],"the":[16,21,33,63,93,105,113,124],"erased":[17,34,64],"symbols":[18,65],"decoding":[20],"resulting":[22],"vector":[23],"with":[24],"respect":[25],"to":[26,70,76,117],"a":[27,45,121],"punctured":[28,73],"code":[29,125],"then":[31],"retrieving":[32],"symbols.":[35],"This":[36],"accomplished":[39],"using":[40],"separating":[41,99,106,114],"parity-check":[42,55,83,100],"matrices.":[43],"For":[44],"given":[46],"maximum":[47,78],"number":[48,79,95],"of":[49,62,80,96,123],"correctable":[50],"erasures,":[51],"such":[52],"matrices":[53,84],"yield":[54],"equations":[56],"that":[57,112],"do":[58],"not":[59],"check":[60],"any":[61],"which":[67,102,110],"are":[68],"sufficient":[69],"characterize":[71],"all":[72],"corresponding":[75],"this":[77],"erasures.":[81],"Separating":[82],"typically":[85],"have":[86],"redundant":[87],"rows.":[88],"An":[89],"upper":[90],"bound":[91],"on":[92],"minimum":[94],"rows":[97],"in":[98],"matrices,":[101],"is":[103,108],"called":[104],"redundancy,":[107],"derived":[109],"proves":[111],"redundancy":[115],"tends":[116],"behave":[118],"linearly":[119],"as":[120],"function":[122],"length.":[126]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}