Performance of Group Testing Algorithms With Near-Constant Tests-per-Item

Johnson, O, Aldridge, M orcid.org/0000-0002-9347-1586 and Scarlett, J (2019) Performance of Group Testing Algorithms With Near-Constant Tests-per-Item. IEEE Transactions on Information Theory, 65 (2). pp. 707-723. ISSN 0018-9448

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2018 IEEE. This is an author produced version of a paper published in IEEE Transactions on Information Theory. 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. Uploaded in accordance with the publisher's self-archiving policy.
Keywords: Algorithm design and analysis; group testing; measurement design; performance bounds; sparse models
Dates:
  • Published: February 2019
  • Accepted: 12 July 2018
  • Published (online): 31 July 2018
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Maths and Physical Sciences (Leeds) > School of Mathematics (Leeds) > Statistics (Leeds)
Depositing User: Symplectic Publications
Date Deposited: 02 Nov 2018 15:57
Last Modified: 31 Jan 2020 14:52
Status: Published
Publisher: IEEE
Identification Number: https://doi.org/10.1109/TIT.2018.2861772

Share / Export

Statistics