{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:17Z","timestamp":1740155957544,"version":"3.37.3"},"reference-count":12,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2019,4]]},"abstract":"<jats:p> In this paper, we have introduced the idea of restricted burst, which is the modification of the classical definition of burst. We show the existence of [Formula: see text]-restricted burst correcting non-binary optimal codes for byte-oriented memories with different possibilities of size of the bytes [Formula: see text] and length of burst [Formula: see text] for [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s1793830919500198","type":"journal-article","created":{"date-parts":[[2018,12,27]],"date-time":"2018-12-27T04:45:00Z","timestamp":1545885900000},"page":"1950019","source":"Crossref","is-referenced-by-count":0,"title":["Restricted bi-byte correcting non-binary optimal codes"],"prefix":"10.1142","volume":"11","author":[{"given":"Vinod","family":"Tyagi","sequence":"first","affiliation":[{"name":"Department of Mathematics, Shyam Lal College (Evening), University of Delhi, Delhi 110032, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4894-0478","authenticated-orcid":false,"given":"Tarun","family":"Lata","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Delhi, Delhi 110007, India"}]}],"member":"219","published-online":{"date-parts":[[2019,4,24]]},"reference":[{"key":"S1793830919500198BIB001","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1959.1057524"},{"key":"S1793830919500198BIB002","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676293"},{"key":"S1793830919500198BIB003","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676807"},{"key":"S1793830919500198BIB004","doi-asserted-by":"publisher","DOI":"10.1109\/18.737544"},{"key":"S1793830919500198BIB005","doi-asserted-by":"publisher","DOI":"10.1109\/18.945267"},{"key":"S1793830919500198BIB007","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"S1793830919500198BIB008","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1972.223503"},{"key":"S1793830919500198BIB009","volume-title":"Error-Correcting Codes","author":"Peterson W. W.","year":"1972","edition":"2"},{"key":"S1793830919500198BIB010","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1960.1057558"},{"key":"S1793830919500198BIB011","first-page":"143","volume":"42","author":"Tyagi V.","year":"2017","journal-title":"J. Combi. Inform. System. Sci."},{"issue":"5","key":"S1793830919500198BIB012","first-page":"2419","volume":"11","author":"Tyagi V.","year":"2015","journal-title":"Global J. Pure Appl. Math."},{"key":"S1793830919500198BIB013","doi-asserted-by":"publisher","DOI":"10.1142\/S1793557113500459"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830919500198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T15:30:09Z","timestamp":1565105409000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830919500198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":12,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2019,4,24]]},"published-print":{"date-parts":[[2019,4]]}},"alternative-id":["10.1142\/S1793830919500198"],"URL":"https:\/\/doi.org\/10.1142\/s1793830919500198","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}