Abstract
We analyze the memory-erasure tradeoff of recently proposed radio frequency identification (RFID) grouping codes. Grouping codes make it possible for an RFID reader to automatically verify the integrity of a collection of RFID tagged objects and identify any missing objects without having access to external sources. They add redundancy to the memory of tags that is then used to recover missing tag identification data (forward error correction). We present a lower bound for the redundancy and show that it can be realized asymptotically. We then consider optimized approximations for practical settings and show that their memory-erasure tradeoff is close to optimal and significantly less than that of recently proposed grouping codes.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
