default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArun Padakandla
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Abram Magner, Arun Padakandla:
Fat shattering, joint measurability, and PAC learnability of POVM hypothesis classes. Quantum Inf. Process. 23(10): 337 (2024)- [c27]Abram Magner, Arun Padakandla:
Empirical Risk Minimization and Uniform Convergence for Probabilistically Observed and Quantum Measurement Hypothesis Classes. ISIT 2024: 563-568 - [c26]Arun Padakandla, Naqueeb Warsi:
Simulation of Separable Quantum Measurements on Bipartite States via Likelihood POVMs. ISIT 2024: 1438-1443 - 2023
- [j11]Touheed Anwar Atif
, Arun Padakandla, S. Sandeep Pradhan:
Source Coding for Synthesizing Correlated Randomness. IEEE Trans. Inf. Theory 69(1): 626-649 (2023) - [i21]Abram Magner, Arun Padakandla:
Fat Shattering, Joint Measurability, and PAC Learnability of POVM Hypothesis Classes. CoRR abs/2308.12304 (2023) - 2022
- [j10]Mohammad Aamir Sohail, Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Computing Sum of Sources Over a Classical-Quantum MAC. IEEE Trans. Inf. Theory 68(12): 7913-7934 (2022) - [c25]Arun Padakandla, Abram Magner:
PAC Learning of Quantum Measurement Classes : Sample Complexity Bounds and Universal Consistency. AISTATS 2022: 11305-11319 - [c24]Sayantan Chakraborty, Arun Padakandla, Pranab Sen:
Centralised multi link measurement compression with side information. ISIT 2022: 61-66 - [c23]Arun Padakandla:
Communicating over a Classical-Quantum MAC with State Information Distributed at Senders. ISIT 2022: 2445-2450 - [c22]Arun Padakandla:
An Achievable Rate Region for 3-User Classical-Quantum Broadcast Channels. ISIT 2022: 2821-2826 - [i20]Mohammad Aamir Sohail, Touheed Anwar Atif, S. Sandeep Pradhan, Arun Padakandla:
Unified approach for computing sum of sources over CQ-MAC. CoRR abs/2202.10403 (2022) - [i19]Arun Padakandla:
An Achievable Rate Region for 3-User Classical-Quantum Broadcast Channels. CoRR abs/2203.00110 (2022) - [i18]Arun Padakandla:
Communicating over a Classical-Quantum MAC with State Information Distributed at Senders. CoRR abs/2203.01308 (2022) - [i17]Sayantan Chakraborty, Arun Padakandla, Pranab Sen:
Centralised multi link measurement compression with side information. CoRR abs/2203.16157 (2022) - 2021
- [j9]Arun Padakandla:
Communicating Correlated Sources Over MAC and Interference Channels II: Joint Source-Channel Coding. IEEE Trans. Inf. Theory 67(6): 3847-3872 (2021) - [c21]Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Computing Sum of Sources over a Classical-Quantum MAC. ISIT 2021: 414-419 - [c20]Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Achievable rate-region for 3 - User Classical-Quantum Interference Channel using Structured Codes. ISIT 2021: 760-765 - [c19]Mohsen Heidari, Arun Padakandla, Wojciech Szpankowski:
A Theoretical Framework for Learning from Quantum Data. ISIT 2021: 1469-1474 - [c18]Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Synthesizing Correlated Randomness using Algebraic Structured Codes. ISIT 2021: 2417-2422 - [i16]Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Computing Sum of Sources over a Classical-Quantum MAC. CoRR abs/2103.02082 (2021) - [i15]Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Achievable rate-region for 3-User Classical-Quantum Interference Channel using Structured Codes. CoRR abs/2103.03978 (2021) - [i14]Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Synthesizing Correlated Randomness using Algebraic Structured Codes. CoRR abs/2103.07339 (2021) - [i13]Mohsen Heidari, Arun Padakandla, Wojciech Szpankowski:
A Theoretical Framework for Learning from Quantum Data. CoRR abs/2107.06406 (2021) - [i12]Arun Padakandla:
Optimal Simulation of Quantum Measurements via the Likelihood POVMs. CoRR abs/2109.12586 (2021) - 2020
- [j8]S. Sandeep Pradhan, Arun Padakandla, Farhad Shirani:
An Algebraic and Probabilistic Framework for Network Information Theory. Found. Trends Commun. Inf. Theory 18(2): 173-379 (2020) - [j7]Arun Padakandla, P. R. Kumar, Wojciech Szpankowski:
The Trade-Off Between Privacy and Fidelity via Ehrhart Theory. IEEE Trans. Inf. Theory 66(4): 2549-2569 (2020) - [j6]Arun Padakandla:
Communicating Correlated Sources Over MAC and Interference Channels I: Separation-Based Schemes. IEEE Trans. Inf. Theory 66(7): 4104-4128 (2020) - [c17]Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Source Coding for Synthesizing Correlated Randomness. ISIT 2020: 1570-1575 - [i11]Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Source Coding for Synthesizing Correlated Randomness. CoRR abs/2004.03651 (2020)
2010 – 2019
- 2019
- [c16]Arun Padakandla:
Achievable Rate-Distortion Region for Robust Distributed Source Coding. ITW 2019: 1-5 - [c15]Arun Padakandla:
On Enhancing the Fixed Block-Length Coding Scheme for Joint source-channel communication. ITW 2019: 1-5 - 2018
- [j5]Arun Padakandla, S. Sandeep Pradhan:
Achievable Rate Region for Three User Discrete Broadcast Channel Based on Coset Codes. IEEE Trans. Inf. Theory 64(4): 2267-2297 (2018) - [c14]Abram Magner, Arun Padakandla:
Network Archaeology via Epidemic Processes: The Case of Growing Trees. Allerton 2018: 879-886 - [c13]Arun Padakandla, P. R. Kumar, Wojciech Szpankowski:
Preserving Privacy and Fidelity via Ehrhart Theory. ISIT 2018: 696-700 - [i10]Arun Padakandla, P. R. Kumar, Wojciech Szpankowski:
The Trade-off between Privacy and Fidelity via Ehrhart Theory. CoRR abs/1803.03611 (2018) - 2017
- [j4]Arun Padakandla, S. Sandeep Pradhan:
An Achievable Rate Region Based on Coset Codes for Multiple Access Channel With States. IEEE Trans. Inf. Theory 63(10): 6393-6415 (2017) - [c12]Arun Padakandla:
Communicating correlated sources over an interference channel. ISIT 2017: 1441-1445 - [c11]Arun Padakandla:
Communicating correlated sources over a MAC. ISIT 2017: 1673-1677 - [c10]Arun Padakandla:
Communicating correlated sources over multi-user channels. ITA 2017: 1-9 - [i9]Arun Padakandla:
Communicating Correlated Sources Over an Interference Channel. CoRR abs/1701.06977 (2017) - 2016
- [j3]Arun Padakandla, Aria Ghasemian Sahebi, S. Sandeep Pradhan:
An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes. IEEE Trans. Inf. Theory 62(3): 1250-1279 (2016) - [c9]Arun Padakandla:
Communicating correlated sources over a MAC in the absence of a Gács-Körner common part. ISIT 2016: 2014-2018 - [i8]Arun Padakandla:
On Transmitting Correlated Sources over a MAC. CoRR abs/1601.07091 (2016) - 2015
- [c8]Arun Padakandla, S. Sandeep Pradhan:
Coset codes for communicating over non-additive channels. ISIT 2015: 2071-2075 - [i7]Arun Padakandla, S. Sandeep Pradhan:
Coset codes for communicating over non-additive channels. CoRR abs/1502.04367 (2015) - 2014
- [i6]Arun Padakandla, Aria Ghasemian Sahebi, S. Sandeep Pradhan:
An Achievable rate region for the $3-$user interference channel based on coset codes. CoRR abs/1403.4583 (2014) - 2013
- [c7]Arun Padakandla, S. Sandeep Pradhan:
Achievable rate region for three user discrete broadcast channel based on coset codes. ISIT 2013: 1277-1281 - [c6]Arun Padakandla:
Computing sum of sources over an arbitrary multiple access channel. ISIT 2013: 2144-2148 - [c5]Arun Padakandla, S. Sandeep Pradhan:
Achievable rate region based on coset codes for multiple access channel with states. ISIT 2013: 2641-2645 - [i5]Arun Padakandla, Sandeep S. Pradhan:
A new achievable rate region for the multiple access channel with noncausal states. CoRR abs/1301.5655 (2013) - [i4]Arun Padakandla, S. Sandeep Pradhan:
Computing sum of sources over an arbitrary multiple access channel. CoRR abs/1301.5684 (2013) - 2012
- [c4]Arun Padakandla, Aria Ghasemian Sahebi, S. Sandeep Pradhan:
A new achievable rate region for the 3-user discrete memoryless interference channel. ISIT 2012: 2256-2260 - [i3]Arun Padakandla, Sandeep S. Pradhan:
A new coding theorem for three user discrete memoryless broadcast channel. CoRR abs/1207.3146 (2012) - 2011
- [c3]Arun Padakandla, Sandeep S. Pradhan:
Nested linear codes achieve Marton's inner bound for general broadcast channels. ISIT 2011: 1554-1558
2000 – 2009
- 2009
- [j2]Arun Padakandla, Rajesh Sundaresan:
Separable Convex Optimization Problems with Linear Ascending Constraints. SIAM J. Optim. 20(3): 1185-1204 (2009) - [j1]Arun Padakandla, Rajesh Sundaresan:
Power minimization for CDMA under colored noise. IEEE Trans. Commun. 57(10): 3103-3112 (2009) - 2008
- [c2]Arun Padakandla, Rajesh Sundaresan:
Complexity of scheduling for minimum power on a GMAC. ISIT 2008: 2698-2701 - 2007
- [c1]Arun Padakandla, Rajesh Sundaresan:
On The Duality Between Rate And Power Optimizations. ISIT 2007: 2796-2800 - [i2]Arun Padakandla, Rajesh Sundaresan:
Separable convex optimization problems with linear ascending constraints. CoRR abs/0707.2265 (2007) - 2006
- [i1]Rajesh Sundaresan, Arun Padakandla:
The Size of Optimal Sequence Sets for Synchronous CDMA Systems. CoRR abs/cs/0606015 (2006)
Coauthor Index
aka: Sandeep S. Pradhan
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-10-15 21:41 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:
