Bounds and constructions for granular media coding
Artyom Sharov, Ron M. Roth · 2011
Bounds on the rate of grain-correcting codes are presented. The lower bounds are Gilbert-Varshamov-like ones, whereas the upper bounds improve on the previously known result by Mazumdar et al.. Constructions of t-grain-correcting codes of length n for certain values of n and t are discussed.