Bounds and Constructions for Granular Media Coding

@article{Sharov2011BoundsAC,
  title={Bounds and Constructions for Granular Media Coding},
  author={Artyom Sharov and Ron M. Roth},
  journal={IEEE Transactions on Information Theory},
  year={2011},
  volume={60},
  pages={2010-2027}
}
Bounds on the rates 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 Constructions of t-grain-correcting codes of length n for certain values of n and t are discussed. Finally, an infinite family of codes of rate approaching 1 that can detect an arbitrary number of grain errors is shown to exist. 
Highly Cited
This paper has 18 citations. REVIEW CITATIONS