default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArti D. Yardi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c9]Arti D. Yardi, Vamshi Krishna Kancharla, Amrita Mishra:
Detecting Linear Block Codes via Deep Learning. WCNC 2023: 1-6- 2022
- [j5]Arti D. Yardi:
Third-party cyclic code reconstruction over binary erasure channel. Int. J. Inf. Coding Theory 6(1): 1-21 (2022) - [j4]Arti D. Yardi
, Tarik Benaddi, Charly Poulliat, Iryna Andriyanova:
EBP-GEXIT Charts for M-Ary AWGN Channel for Generalized LDPC and Turbo Codes. IEEE Trans. Commun. 70(6): 3613-3626 (2022) - 2021
- [j3]Arti D. Yardi, Tejas Bodas:
A Covert Queueing Problem With Busy Period Statistic. IEEE Commun. Lett. 25(3): 726-729 (2021) - [c8]Tim Hellemans, Arti D. Yardi, Tejas Bodas:
Download time analysis for distributed storage systems with node failures. ISIT 2021: 2060-2065 - [c7]Amogh Johri, Arti D. Yardi, Tejas Bodas:
Approximate Gradient Coding for Heterogeneous Nodes. ITW 2021: 1-6 - [c6]Arti D. Yardi, Tejas Bodas:
Covert queueing problem with a Markovian statistic. ITW 2021: 1-6 - [i7]Arti D. Yardi, Tarik Benaddi, Charly Poulliat, Iryna Andriyanova:
EBP-GEXIT Charts for M-ary AWGN Channel for Generalized LDPC and Turbo Codes. CoRR abs/2103.05953 (2021) - [i6]Tim Hellemans, Arti D. Yardi, Tejas Bodas:
Download time analysis for distributed storage systems with node failures. CoRR abs/2105.02926 (2021) - [i5]Amogh Johri, Arti D. Yardi, Tejas Bodas:
Approximate Gradient Coding for Heterogeneous Nodes. CoRR abs/2105.06124 (2021) - [i4]Arti D. Yardi, Tejas Bodas:
Covert queueing problem with a Markovian statistic. CoRR abs/2109.05702 (2021) - 2020
- [j2]Arti D. Yardi, Saravanan Vijayakumaran:
Properties of syndrome distribution for blind reconstruction of cyclic codes. Appl. Algebra Eng. Commun. Comput. 31(1): 23-41 (2020)
2010 – 2019
- 2019
- [c5]Tarik Benaddi, Arti D. Yardi, Charly Poulliat, Iryna Andriyanova:
Estimating the Maximum a Posteriori Threshold for Serially Concatenated Turbo Codes. ISIT 2019: 1347-1351 - 2018
- [c4]Arti D. Yardi, Iryna Andriyanova, Charly Poulliat:
EBP-GEXIT Charts Over the Binary-Input AWGN Channel for Generalized and Doubly-Generalized LDPC Codes. ISIT 2018: 496-500 - [c3]Arti D. Yardi:
Blind Reconstruction of Binary Cyclic Codes over Binary Erasure Channel. ISITA 2018: 301-305 - 2017
- [i3]Arti D. Yardi, Ruud Pellikaan:
On shortened and punctured cyclic codes. CoRR abs/1705.09859 (2017) - [i2]Arti D. Yardi, Saravanan Vijayakumaran:
Properties of Syndrome Distribution for Blind Reconstruction of Cyclic Codes. CoRR abs/1710.02703 (2017) - 2016
- [j1]Arti D. Yardi, Saravanan Vijayakumaran, Animesh Kumar:
Blind Reconstruction of Binary Cyclic Codes From Unsynchronized Bitstream. IEEE Trans. Commun. 64(7): 2693-2706 (2016) - 2014
- [c2]Arti D. Yardi, Animesh Kumar, Saravanan Vijayakumaran:
Channel-code detection by a third-party receiver via the likelihood ratio test. ISIT 2014: 1051-1055 - 2013
- [c1]Arti D. Yardi, Saravanan Vijayakumaran:
Detecting linear block codes in noise using the GLRT. ICC 2013: 4895-4899 - 2012
- [i1]Arti D. Yardi, Saravanan Vijayakumaran:
Detecting Linear Block Codes in Noise using the GLRT. CoRR abs/1210.8267 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
