New upper bounds for grain-correcting and grain-detecting codes

Artyom Sharov, Ron M. Roth
2014 2014 IEEE International Symposium on Information Theory  
New upper bounds on the size and the rate of graincorrecting codes are presented. The new upper bound on the size of t-grain-correcting codes of length n improves on the best known upper bounds for certain values of n and t, whereas the new upper bound on the asymptotic rate of ⌈τ n⌉-graincorrecting codes of length n improves on the previously known upper bounds on the interval τ ∈ (0, 1 8 ]. A lower bound of 1 2 log 2 n on the minimum redundancy of ∞-grain-detecting codes of length n is presented.
doi:10.1109/isit.2014.6875007 dblp:conf/isit/SharovR14 fatcat:6u4poghbvfg6ziqdwusq4igjdi