Date of Original Version




Rights Management

© 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

In this paper, we propose a novel scheme for the design of grouping of radio-frequency identification (RFID) tags, based on the Chinese remainder theorem (CRT). Grouping allows verifying the integrity of a collection of objects without the requirement for accessing external systems, and can be extended to identify missing objects. Motivated by the redundancy property of the Chinese remainderrepresentation, we propose grouping of RFID tags via the CRT. The proposed scheme not only provides designated decoding guarantees, but also offers flexibility in constructing group generation matrices. We also characterize the key objects needed to study decoding guarantees of grouping and its extended counterpart, called rank-deficient and dead-end sets, respectively, which enable theoretical analyses of error rates. The two key objects are related to the minimum and stopping distances of a linear code, respectively. As such, the characterization offers direct connection with coding theory that helps in the understanding of the verification/identification problems being studied. Theoretical and simulation results are presented, demonstrating that the proposed scheme is an efficient approach to the design of grouping of RFID tags.





Published In

IEEE Transactions on Communications, 61, 11, 4741-4753.