Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Anshoo Tandon"'
Publikováno v:
2022 IEEE Information Theory Workshop (ITW).
The Chow-Liu algorithm (IEEE Trans.~Inform.~Theory, 1968) has been a mainstay for the learning of tree-structured graphical models from i.i.d.\ sampled data vectors. Its theoretical properties have been well-studied and are well-understood. In this p
Publikováno v:
IEEE Transactions on Information Theory. 66:7602-7614
The “bee-identification problem” was formally defined by Tandon, Tan and Varshney [ IEEE Trans. Commun. , vol. 67, 2019], and the error exponent was studied. This work extends the results for the “absentee bees” scenario, where a fraction of
Publikováno v:
Journal of Communications and Networks. 22:303-315
Next generation wireless networks are under high risk of security attacks due to increased connectivity and information sharing among peer nodes. Some of the nodes could potentially be malicious, intending to disrupt or tamper sensitive data transfer
Publikováno v:
IEEE Transactions on Information Forensics and Security. 15:435-446
Clustering Internet of Things (IoT) networks, to alleviate the network scalability problem, provides an opportunity for an adversary to compromise a set of nodes by simply compromising the relay they are associated with. In such scenarios, an adversa
Publikováno v:
IEEE Transactions on Green Communications and Networking. 3:988-996
Run-length limited (RLL) codes are a well-studied class of constrained codes having application in diverse areas, such as optical and magnetic data recording systems, DNA-based storage, and visible light communication. RLL codes have also been propos
Publikováno v:
IEEE Transactions on Communications. 67:7405-7416
Consider the problem of identifying a massive number of bees, uniquely labeled with barcodes, using noisy measurements. We formally introduce this “bee-identification problem”, define its error exponent, and derive efficiently computable upper an
Publikováno v:
Journal of Communications and Networks. 21:458-468
Increased device connectivity and information sharing in wireless IoT networks increases the risk of cyber attack by malicious nodes. In this paper, we present an effective and practical scheme for detecting data integrity and selective forwarding at
Publikováno v:
ISIT
We apply the generalized sphere-packing bound to two classes of subblock-constrained codes. À la Fazeli et al. (2015), we make use of automorphisms to significantly reduce the number of variables in the associated linear programming problem. In part
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::689f0a32a2cc1427a1c37f35b8023e9b
https://hdl.handle.net/10356/159500
https://hdl.handle.net/10356/159500
Given side information that an Ising tree-structured graphical model is homogeneous and has no external field, we derive the exact asymptotics of learning its structure from independently drawn samples. Our results, which leverage the use of probabil
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ae98258db0bb4c77a276e2ccb43c9419
Autor:
Mehul Motani, Anshoo Tandon
Publikováno v:
IEEE Transactions on Vehicular Technology. 66:1506-1518
We consider a system where users are polled for transmission by a central server, and the link layer of each user employs automatic repeat request (ARQ) to ensure error-free delivery of packets. We present a cross-layer approach for reducing average