New Upper Bounds for Grain-Correcting and Grain Detecting Codes

Jump to other IT Society Websites:

New Upper Bounds for Grain-Correcting and Grain Detecting Codes

Author(s):

Creation Date: Aug 15, 2014

Published In: Jul 2014

Paper Type: Conference Paper

Book Title: Proc. of IEEE International Symposium on Information Theory

Address: Honolulu, Hawaii

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, 1 ]. A lower bound of 1 log n on the minimum redundancy of ∞-grain-detecting codes 22 of length n is presented.

Award(s) Received:

COVID-19 Updates

Read important changes and updates to the 2020 activities of the IEEE Information Theory Society due to the COVID-19 pandemic at:

https://www.itsoc.org/covid

 

Table of Contents

IEEE TechNav