受强制性开放获取政策约束的文章 - Arti Yardi了解详情
无法在其他位置公开访问的文章：4 篇
查看
Blind reconstruction of binary cyclic codes
AD Yardi, S Vijayakumaran, A Kumar
European Wireless 2014; 20th European Wireless Conference, 1-6, 2014
强制性开放获取政策： Department of Science & Technology, India
查看
A covert queueing problem with busy period statistic
A Yardi, T Bodas
IEEE Communications Letters 25 (3), 726-729, 2020
强制性开放获取政策： Department of Science & Technology, India
查看
Estimating the maximum a posteriori threshold for serially concatenated turbo codes
T Benaddi, AD Yardi, C Poulliat, I Andriyanova
2019 IEEE International Symposium on Information Theory (ISIT), 1347-1351, 2019
强制性开放获取政策： Agence Nationale de la Recherche
查看
Detecting Linear Block Codes via Deep Learning
A Yardi, VK Kancharla, A Mishra
2023 IEEE Wireless Communications and Networking Conference (WCNC), 1-6, 2023
强制性开放获取政策： Department of Science & Technology, India
可在其他位置公开访问的文章：4 篇
查看
Properties of syndrome distribution for blind reconstruction of cyclic codes
AD Yardi, S Vijayakumaran
Applicable Algebra in Engineering, Communication and Computing, 1-19, 2019
强制性开放获取政策： Department of Science & Technology, India
查看
EBP-GEXIT Charts for M-Ary AWGN Channel for Generalized LDPC and Turbo Codes
A Yardi, T Benaddi, C Poulliat, I Andriyanova
IEEE Transactions on Communications 70 (6), 3613-3626, 2022
强制性开放获取政策： Department of Science & Technology, India, Agence Nationale de la Recherche
查看
Approximate Gradient Coding for Heterogeneous Nodes
A Johri, A Yardi, T Bodas
2021 IEEE Information Theory Workshop (ITW), 1-6, 2021
强制性开放获取政策： Department of Science & Technology, India
查看
Covert queueing problem with a Markovian statistic
A Yardi, T Bodas
2021 IEEE Information Theory Workshop (ITW), 1-6, 2021
强制性开放获取政策： Department of Science & Technology, India
出版信息和资助信息由计算机程序自动确定