{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T16:05:36Z","timestamp":1648656336039},"reference-count":14,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2012,9]]},"abstract":"<jats:p> The purpose of this paper is to propose a simple method of constructing a parity-check matrix for any binary linear code capable of correcting a new kind of burst error called 'm-repeated burst error of length b or less' recently introduced by the authors. Some binary codes based on the proposed technique have been illustrated. This technique for m = 1 helps in resolving a long standing problem of devising a systematic algorithm for the construction of a burst error correcting code. <\/jats:p>","DOI":"10.1142\/s1793830912500437","type":"journal-article","created":{"date-parts":[[2012,8,6]],"date-time":"2012-08-06T08:31:23Z","timestamp":1344241883000},"page":"1250043","source":"Crossref","is-referenced-by-count":1,"title":["CONSTRUCTION OF m-REPEATED BURST ERROR CORRECTING BINARY LINEAR CODE"],"prefix":"10.1142","volume":"04","author":[{"given":"B. K.","family":"DASS","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Delhi, Delhi - 110 007, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"RASHMI","family":"VERMA","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Delhi, Delhi - 110 007, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,8,6]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1959.1057524"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1080\/15598608.2009.10411931"},{"key":"rf3","first-page":"889","volume":"99","author":"Bridwell J. D.","journal-title":"Bell Syst. Tech. J."},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057711"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1142\/S1793557108000278"},{"key":"rf6","first-page":"25","volume":"19","author":"Dass B. K.","journal-title":"Ratio Mathematica \u2014 J. Appl. Math."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"rf9","first-page":"9","volume":"50","author":"Kasahara H.","journal-title":"Electron. Commun. Jpn."},{"key":"rf10","volume-title":"Error-Correcting Codes","author":"Peterson W. W.","year":"1972"},{"key":"rf11","volume":"13","author":"Posner E. C.","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1111\/j.1460-9568.2007.05559.x"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(61)80048-X"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053771"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1963.1057819"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830912500437","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T22:43:45Z","timestamp":1565131425000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830912500437"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,6]]},"references-count":14,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2012,8,6]]},"published-print":{"date-parts":[[2012,9]]}},"alternative-id":["10.1142\/S1793830912500437"],"URL":"https:\/\/doi.org\/10.1142\/s1793830912500437","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8,6]]}}}