{"id":"https://openalex.org/W1997757717","doi":"https://doi.org/10.1142/s1793830912500437","title":"CONSTRUCTION OF m-REPEATED BURST ERROR CORRECTING BINARY LINEAR CODE","display_name":"CONSTRUCTION OF m-REPEATED BURST ERROR CORRECTING BINARY LINEAR CODE","publication_year":2012,"publication_date":"2012-08-06","ids":{"openalex":"https://openalex.org/W1997757717","doi":"https://doi.org/10.1142/s1793830912500437","mag":"1997757717"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830912500437","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830912500437","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-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/A5108250983","display_name":"Bal Kishan Dass","orcid":null},"institutions":[{"id":"https://openalex.org/I110166357","display_name":"University of Delhi","ror":"https://ror.org/04gzb2213","country_code":"IN","type":"education","lineage":["https://openalex.org/I110166357"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"B. K. DASS","raw_affiliation_strings":["Department of Mathematics, University of Delhi, Delhi - 110 007, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Delhi, Delhi - 110 007, India","institution_ids":["https://openalex.org/I110166357"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103038029","display_name":"Rashmi Verma","orcid":"https://orcid.org/0000-0002-0867-0370"},"institutions":[{"id":"https://openalex.org/I110166357","display_name":"University of Delhi","ror":"https://ror.org/04gzb2213","country_code":"IN","type":"education","lineage":["https://openalex.org/I110166357"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"RASHMI VERMA","raw_affiliation_strings":["Department of Mathematics, University of Delhi, Delhi - 110 007, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Delhi, Delhi - 110 007, India","institution_ids":["https://openalex.org/I110166357"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I110166357"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.11385126,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"04","issue":"03","first_page":"1250043","last_page":"1250043"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9980999827384949,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9980999827384949,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9973000288009644,"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.9961000084877014,"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/burst-error","display_name":"Burst error","score":0.7713844776153564},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6362983584403992},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6019169092178345},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5891185998916626},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5336874723434448},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5079157948493958},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.49285340309143066},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.4844917953014374},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.4442169964313507},{"id":"https://openalex.org/keywords/constant-weight-code","display_name":"Constant-weight code","score":0.4173751473426819},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2543085217475891},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.23562020063400269},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.18870970606803894},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.16771993041038513},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10537528991699219}],"concepts":[{"id":"https://openalex.org/C113283315","wikidata":"https://www.wikidata.org/wiki/Q1017059","display_name":"Burst error","level":3,"score":0.7713844776153564},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6362983584403992},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6019169092178345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5891185998916626},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5336874723434448},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5079157948493958},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.49285340309143066},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.4844917953014374},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.4442169964313507},{"id":"https://openalex.org/C197242373","wikidata":"https://www.wikidata.org/wiki/Q5163613","display_name":"Constant-weight code","level":5,"score":0.4173751473426819},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2543085217475891},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.23562020063400269},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.18870970606803894},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.16771993041038513},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10537528991699219},{"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":1,"locations":[{"id":"doi:10.1142/s1793830912500437","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830912500437","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1923830127","https://openalex.org/W1970018639","https://openalex.org/W1980073965","https://openalex.org/W1982617219","https://openalex.org/W2056156339","https://openalex.org/W2061680022","https://openalex.org/W2062293120","https://openalex.org/W2073544041","https://openalex.org/W2139220901","https://openalex.org/W2171825114","https://openalex.org/W2342204193","https://openalex.org/W3194602862","https://openalex.org/W4234345682"],"related_works":["https://openalex.org/W2537963609","https://openalex.org/W2772956856","https://openalex.org/W2092857423","https://openalex.org/W2087346031","https://openalex.org/W2106099497","https://openalex.org/W2361792238","https://openalex.org/W2182725540","https://openalex.org/W3126598192","https://openalex.org/W2560915679","https://openalex.org/W3001699271"],"abstract_inverted_index":{"The":[0],"purpose":[1],"of":[2,11,22,27,34,68,76],"this":[3],"paper":[4],"is":[5],"to":[6],"propose":[7],"a":[8,13,24,64,70,77],"simple":[9],"method":[10],"constructing":[12],"parity-check":[14],"matrix":[15],"for":[16,57,73],"any":[17],"binary":[18,45],"linear":[19],"code":[20],"capable":[21],"correcting":[23,80],"new":[25],"kind":[26],"burst":[28,32,78],"error":[29,33,79],"called":[30],"'m-repeated":[31],"length":[35],"b":[36],"or":[37],"less'":[38],"recently":[39],"introduced":[40],"by":[41],"the":[42,49,74],"authors.":[43],"Some":[44],"codes":[46],"based":[47],"on":[48],"proposed":[50],"technique":[51,56],"have":[52],"been":[53],"illustrated.":[54],"This":[55],"m":[58],"=":[59],"1":[60],"helps":[61],"in":[62],"resolving":[63],"long":[65],"standing":[66],"problem":[67],"devising":[69],"systematic":[71],"algorithm":[72],"construction":[75],"code.":[81]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}