Date of Original Version
© 2013 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Abstract or Description
This letter proposes a novel scheme for grouping of radio-frequency identification (RFID) tags, based on strongly selective families (SSFs). Grouping of RFID tags allows verifying the integrity of groups of objects without external systems such as databases or verifiers, and can be extended to identify missing objects. The existing scheme is based on Gallager's low-density parity-check (LDPC) codes and, as such, it cannot easily achieve designated decoding guarantees due to its pseudo-random nature. Motivated by the strongly selective property of SSFs, this study proposes grouping of RFID tags via SSFs, such that designated decoding guarantees are more easily achieved. Simulation and theoretical results are presented, demonstrating that the proposed scheme can greatly improve the performance of the existing one.
IEEE Communications Magazine, 17, 6, 1120-1123.