Title :
New upper bounds for grain-correcting and grain-detecting codes
Author :
Sharov, Artyom ; Roth, Ron M.
Author_Institution :
Comput. Sci. Dept., Technion - Israel Inst. of Technol., Haifa, Israel
fDate :
June 29 2014-July 4 2014
Abstract :
New upper bounds on the size and the rate of grain-correcting 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]-grain-correcting codes of length n improves on the previously known upper bounds on the interval τ ∈ (0, ⅛]. A lower bound of 1/2 log2 n on the minimum redundancy of ∞-grain-detecting codes of length n is presented.
Keywords :
error correction codes; error detection codes; asymptotic rate; grain-correcting codes; grain-detecting codes; minimum redundancy; upper bounds; Hamming distance; Magnetic recording; Media; Redundancy; Upper bound; Writing;
Conference_Titel :
Information Theory (ISIT), 2014 IEEE International Symposium on
Conference_Location :
Honolulu, HI
DOI :
10.1109/ISIT.2014.6875007
