Restricted bi-byte correcting non-binary optimal codes
Vinod Tyagi, Tarun Lata · Discrete Mathematics Algorithms and Applications · 2018
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].