{"id":"https://openalex.org/W2132747561","doi":"https://doi.org/10.1109/glocom.2004.1378129","title":"A simple and efficient burst error correcting code based on an array code","display_name":"A simple and efficient burst error correcting code based on an array code","publication_year":2005,"publication_date":"2005-04-05","ids":{"openalex":"https://openalex.org/W2132747561","doi":"https://doi.org/10.1109/glocom.2004.1378129","mag":"2132747561"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2004.1378129","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2004.1378129","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","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/A5036838465","display_name":"Dan Raphaeli","orcid":"https://orcid.org/0000-0003-3563-1067"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"D. Raphaeli","raw_affiliation_strings":["Electrical Engineering-Systems Department, Faculty of Engineering, Tel-Aviv University, Tel-Aviv, Israel","Electr. Eng. -Syst. Dept., Tel Aviv Univ., Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical Engineering-Systems Department, Faculty of Engineering, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Electr. Eng. -Syst. Dept., Tel Aviv Univ., Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5036838465"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"1106","last_page":"1110"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9994000196456909,"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.9994000196456909,"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.9991999864578247,"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.9991000294685364,"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/burst-error","display_name":"Burst error","score":0.7567943334579468},{"id":"https://openalex.org/keywords/constant-weight-code","display_name":"Constant-weight code","score":0.7219078540802002},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6878393292427063},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.6504887342453003},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.6256324648857117},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.590162992477417},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.5805561542510986},{"id":"https://openalex.org/keywords/systematic-code","display_name":"Systematic code","score":0.5764639377593994},{"id":"https://openalex.org/keywords/polynomial-code","display_name":"Polynomial code","score":0.5181832909584045},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5079861283302307},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5036453604698181},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.46257808804512024},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.46047157049179077},{"id":"https://openalex.org/keywords/cyclic-code","display_name":"Cyclic code","score":0.41340452432632446},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.3949468433856964},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35037535429000854},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.25659817457199097},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2028375267982483},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.054717183113098145}],"concepts":[{"id":"https://openalex.org/C113283315","wikidata":"https://www.wikidata.org/wiki/Q1017059","display_name":"Burst error","level":3,"score":0.7567943334579468},{"id":"https://openalex.org/C197242373","wikidata":"https://www.wikidata.org/wiki/Q5163613","display_name":"Constant-weight code","level":5,"score":0.7219078540802002},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6878393292427063},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.6504887342453003},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6256324648857117},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.590162992477417},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.5805561542510986},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.5764639377593994},{"id":"https://openalex.org/C39635130","wikidata":"https://www.wikidata.org/wiki/Q7226636","display_name":"Polynomial code","level":5,"score":0.5181832909584045},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5079861283302307},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5036453604698181},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.46257808804512024},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.46047157049179077},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.41340452432632446},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.3949468433856964},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35037535429000854},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.25659817457199097},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2028375267982483},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.054717183113098145},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2004.1378129","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2004.1378129","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.5}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1534925464","https://openalex.org/W1606480398","https://openalex.org/W1989008275","https://openalex.org/W2059651552","https://openalex.org/W2084681116","https://openalex.org/W2090471849","https://openalex.org/W2104283794","https://openalex.org/W2114197496","https://openalex.org/W2135159277","https://openalex.org/W2142901448","https://openalex.org/W2147343704","https://openalex.org/W2148406524","https://openalex.org/W2151012225","https://openalex.org/W2798333393","https://openalex.org/W3128611524","https://openalex.org/W4239889878","https://openalex.org/W6632090173","https://openalex.org/W6636396655","https://openalex.org/W6806087461","https://openalex.org/W7018733341"],"related_works":["https://openalex.org/W2009670184","https://openalex.org/W2171391334","https://openalex.org/W2377508920","https://openalex.org/W1631960500","https://openalex.org/W2886619161","https://openalex.org/W4250402636","https://openalex.org/W2082705204","https://openalex.org/W2533621910","https://openalex.org/W4212825216","https://openalex.org/W2026488611"],"abstract_inverted_index":{"We":[0,150],"show":[1,163],"that":[2,67,164],"a":[3,41,63,90],"widely":[4],"used":[5],"array":[6],"code,":[7,12],"known":[8],"as":[9,89,113],"the":[10,77,83,104,110,114,127,130,152],"even-odd":[11],"which":[13,36,108],"is":[14,31,51,70,80,100,109],"targeted":[15],"at":[16],"phased":[17],"burst":[18,26,44,91,106,119],"errors,":[19],"may":[20],"also":[21],"be":[22,54,86],"useful":[23],"for":[24,33,72,170],"non-phased":[25],"errors.":[27],"A":[28],"new":[29],"decoder":[30,131],"proposed":[32,49],"this":[34,98,166],"code":[35,84,99,148],"effectively":[37],"converts":[38],"it":[39],"into":[40],"more":[42],"general":[43],"error":[45,92,120],"correcting":[46,57,93,121],"code.":[47,94],"The":[48,95],"scheme":[50],"shown":[52],"to":[53,62,102],"capable":[55],"of":[56,117,139,141,146,154],"almost":[58],"all":[59],"bursts":[60],"up":[61],"certain":[64],"length,":[65,107],"such":[66],"its":[68],"performance":[69],"attractive":[71],"many":[73],"communication":[74],"applications.":[75],"Since":[76],"failure":[78],"rate":[79],"sufficiently":[81],"low,":[82],"can":[85],"practically":[87],"classified":[88],"redundancy":[96,112],"in":[97,137,144],"equal":[101],"twice":[103],"maximal":[105],"same":[111],"lower":[115,160],"bound":[116],"conventional":[118],"codes":[122],"(the":[123],"Reiger":[124],"bound).":[125],"Both":[126],"encoder":[128],"and":[129,143,159,162],"have":[132],"very":[133],"low":[134],"complexity,":[135],"both":[136],"terms":[138],"number":[140],"operations":[142],"terms:":[145],"computer":[147],"size.":[149],"analyze":[151],"probability":[153,167],"failure,":[155],"provide":[156],"tight":[157],"upper":[158],"bounds,":[161],"asymptotically":[165],"approaches":[168],"zero":[169],"large":[171],"blocks.":[172]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}