default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. Sandeep Pradhan
Sandeep S. Pradhan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j46]Farhad Shirani
, S. Sandeep Pradhan:
A Structured Coding Framework for Communication and Computation Over Continuous Networks. IEEE Trans. Inf. Theory 70(3): 1629-1651 (2024)- [j45]Touheed Anwar Atif, Mohammad Aamir Sohail, S. Sandeep Pradhan:
Lossy Quantum Source Coding With a Global Error Criterion Based on a Posterior Reference Map. IEEE Trans. Inf. Theory 70(5): 3470-3498 (2024) - [c85]Xingyi He, Touheed Anwar Atif, S. Sandeep Pradhan:
Quantum Soft Covering and Decoupling with Relative Entropy Criterion. ISIT 2024: 1426-1431 - [c84]Hafez M. Garmaroudi, S. Sandeep Pradhan, Jun Chen:
Rate-Limited Optimal Transport for Quantum Gaussian Observables. ISIT 2024: 2068-2073 - [c83]James Chin-Jen Pang, S. Sandeep Pradhan, Hessam Mahdavifar:
Abelian Group Codes for Classical and CQ Channel Coding: One-Shot and Asymptotic Rate Bounds. ISIT 2024: 2712-2717 - [i68]Hojat Allah Salehi, Farhad Shirani, S. Sandeep Pradhan:
Quantum Advantage in Non-Interactive Source Simulation. CoRR abs/2402.00242 (2024) - [i67]Xingyi He, Touheed Anwar Atif, S. Sandeep Pradhan:
Quantum Soft Covering and Decoupling with Relative Entropy Criterion. CoRR abs/2402.11112 (2024) - [i66]Mohammad Aamir Sohail, Mohsen Heidari Khoozani, S. Sandeep Pradhan:
Quantum Natural Stochastic Pairwise Coordinate Descent. CoRR abs/2407.13858 (2024) - [i65]Hojat Allah Salehi, Md. Jueal Mia, S. Sandeep Pradhan, M. Hadi Amini, Farhad Shirani:
CorBin-FL: A Differentially Private Federated Learning Mechanism using Common Randomness. CoRR abs/2409.13133 (2024) - [i64]Xingyi He, S. Sandeep Pradhan:
On the Strong Converse Exponent of the Classical Soft Covering. CoRR abs/2409.18307 (2024) - 2023
- [j44]James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan:
New Bounds on the Size of Binary Codes With Large Minimum Distance. IEEE J. Sel. Areas Inf. Theory 4: 219-231 (2023) - [j43]James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan:
Capacity-Achieving Polar-Based Codes With Sparsity Constraints on the Generator Matrices. IEEE Trans. Commun. 71(9): 5023-5038 (2023) - [j42]Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Source Coding for Synthesizing Correlated Randomness. IEEE Trans. Inf. Theory 69(1): 626-649 (2023) - [c82]Mohammad Aamir Sohail, Touheed Anwar Atif, S. Sandeep Pradhan:
A New Formulation of Lossy Quantum-Classical and Classical Source Coding based on a Posterior Channel. ISIT 2023: 743-748 - [c81]Hafez M. Garmaroudi, S. Sandeep Pradhan, Jun Chen:
Rate-limited Quantum-to-Classical Optimal Transport: A Lossy Source Coding Perspective. ISIT 2023: 1925-1930 - [i63]Touheed Anwar Atif, Mohammad Aamir Sohail, S. Sandeep Pradhan:
Lossy Quantum Source Coding with a Global Error Criterion based on a Posterior Reference Map. CoRR abs/2302.00625 (2023) - [i62]James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan:
Capacity-achieving Polar-based Codes with Sparsity Constraints on the Generator Matrices. CoRR abs/2303.09511 (2023) - [i61]Hafez M. Garmaroudi, S. Sandeep Pradhan, Jun Chen:
A Coding Theorem for Rate-Limited Quantum-Classical Optimal Transport. CoRR abs/2305.10004 (2023) - [i60]Mohsen Heidari, Achilleas Anastasopoulos, S. Sandeep Pradhan:
On The Reliability Function of Discrete Memoryless Multiple-Access Channel with Feedback. CoRR abs/2306.06796 (2023) - [i59]Touheed Anwar Atif, S. Sandeep Pradhan, Andreas Winter:
Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels. CoRR abs/2306.12416 (2023) - 2022
- [j41]Touheed Anwar Atif, Mohsen Heidari, S. Sandeep Pradhan:
Faithful Simulation of Distributed Quantum Measurements With Applications in Distributed Rate-Distortion Theory. IEEE Trans. Inf. Theory 68(2): 1085-1118 (2022) - [j40]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) - [c80]Mohsen Heidari, Achilleas Anastasopoulos, S. Sandeep Pradhan:
Upper Bounds on the Feedback Error Exponent of Channels With States and With Memory. ISIT 2022: 1330-1335 - [c79]Mohammad Aamir Sohail, Touheed Anwar Atif, S. Sandeep Pradhan:
Unified approach for computing sum of sources over CQ-MAC. ISIT 2022: 1868-1873 - [c78]James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan:
New Bounds on the Size of Binary Codes with Large Minimum Distance. ISIT 2022: 1963-1968 - [c77]Touheed Anwar Atif, S. Sandeep Pradhan:
Multi-Party Quantum Purity Distillation with Bounded Classical Communication. ISIT 2022: 2974-2979 - [c76]Farhad Shirani, S. Sandeep Pradhan:
Lattices from Linear Codes: Source and Channel Networks. ISIT 2022: 3238-3243 - [i58]James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan:
New Bounds on the Size of Binary Codes with Large Minimum Distance. CoRR abs/2202.03472 (2022) - [i57]Mohsen Heidari, Achilleas Anastasopoulos, S. Sandeep Pradhan:
Upper Bounds on the Feedback Error Exponent of Channels With States and Memory. CoRR abs/2202.09933 (2022) - [i56]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) - [i55]Farhad Shirani, S. Sandeep Pradhan:
Lattices from Linear Codes: Source and Channel Networks. CoRR abs/2202.11238 (2022) - [i54]Touheed Anwar Atif, S. Sandeep Pradhan:
Multi-Party Quantum Purity Distillation with Bounded Classical Communication. CoRR abs/2203.05511 (2022) - 2021
- [j39]Farhad Shirani, S. Sandeep Pradhan:
A New Achievable Rate-Distortion Region for Distributed Source Coding. IEEE Trans. Inf. Theory 67(7): 4485-4503 (2021) - [c75]Touheed Anwar Atif, S. Sandeep Pradhan:
Distributed Quantum Faithful Simulation and Function Computation Using Algebraic Structured Measurements. ISIT 2021: 124-129 - [c74]Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Computing Sum of Sources over a Classical-Quantum MAC. ISIT 2021: 414-419 - [c73]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 - [c72]Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Synthesizing Correlated Randomness using Algebraic Structured Codes. ISIT 2021: 2417-2422 - [i53]Touheed Anwar Atif, S. Sandeep Pradhan:
Distributed Quantum Faithful Simulation and Function Computation Using Algebraic Structured Measurements. CoRR abs/2101.02360 (2021) - [i52]Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Computing Sum of Sources over a Classical-Quantum MAC. CoRR abs/2103.02082 (2021) - [i51]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) - [i50]Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Synthesizing Correlated Randomness using Algebraic Structured Codes. CoRR abs/2103.07339 (2021) - 2020
- [j38]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) - [j37]Mohsen Heidari, S. Sandeep Pradhan:
Structured Mappings and Conferencing Common Information for Multiple-Access Channels. IEEE Trans. Inf. Theory 66(7): 4203-4225 (2020) - [c71]James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan:
Capacity-achieving Polar-based LDGM Codes with Crowdsourcing Applications. ISIT 2020: 449-454 - [c70]Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Source Coding for Synthesizing Correlated Randomness. ISIT 2020: 1570-1575 - [i49]Achilleas Anastasopoulos, S. Sandeep Pradhan:
Decentralized sequential active hypothesis testing and the MAC feedback capacity. CoRR abs/2001.03807 (2020) - [i48]James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan:
Capacity-achieving Polar-based LDGM Codes with Crowdsourcing Applications. CoRR abs/2001.11986 (2020) - [i47]Touheed Anwar Atif, Arun Padakandla, S. Sandeep Pradhan:
Source Coding for Synthesizing Correlated Randomness. CoRR abs/2004.03651 (2020) - [i46]James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan:
Capacity-achieving Polar-based LDGM Codes. CoRR abs/2012.13977 (2020)
2010 – 2019
- 2019
- [j36]Farhad Shirani, S. Sandeep Pradhan:
On the Sub-Optimality of Single-Letter Coding Over Networks. IEEE Trans. Inf. Theory 65(10): 6115-6135 (2019) - [j35]Mohsen Heidari, Farhad Shirani, S. Sandeep Pradhan:
Quasi Structured Codes for Multi-Terminal Communications. IEEE Trans. Inf. Theory 65(10): 6263-6289 (2019) - [c69]Mohsen Heidari, Touheed Anwar Atif, S. Sandeep Pradhan:
Faithful Simulation of Distributed Quantum Measurements with Applications in Distributed Rate-Distortion Theory. ISIT 2019: 1162-1166 - [c68]Mohsen Heidari, S. Sandeep Pradhan, Ramji Venkataramanan:
Boolean Functions with Biased Inputs: Approximation and Noise Sensitivity. ISIT 2019: 1192-1196 - [c67]James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan:
Coding for Crowdsourced Classification with XOR Queries. ITW 2019: 1-5 - [i45]Mohsen Heidari, Touheed Anwar Atif, S. Sandeep Pradhan:
Faithful Simulation of Distributed Quantum Measurements with Applications in Distributed Rate-Distortion Theory. CoRR abs/1901.06788 (2019) - [i44]Mohsen Heidari, S. Sandeep Pradhan, Ramji Venkataramanan:
Boolean Functions with Biased Inputs: Approximation and Noise Sensitivity. CoRR abs/1901.10576 (2019) - [i43]Mohsen Heidari, S. Sandeep Pradhan:
Structured Mappings and Conferencing Common Information for Multiple-access Channels. CoRR abs/1905.04760 (2019) - [i42]Farhad Shirani, S. Sandeep Pradhan:
A New Achievable Rate-Distortion Region for Distributed Source Coding. CoRR abs/1906.08810 (2019) - [i41]James Chin-Jen Pang, Hessam Mahdavifar, S. Sandeep Pradhan:
Coding for Crowdsourced Classification with XOR Queries. CoRR abs/1906.10637 (2019) - 2018
- [j34]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) - [j33]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
An Achievable Rate-Distortion Region for Multiple Descriptions Source Coding Based on Coset Codes. IEEE Trans. Inf. Theory 64(5): 3781-3809 (2018) - [j32]S. Sandeep Pradhan, Mohsen Heidari, Aria Ghasemian Sahebi:
Corrections to "Abelian Group Codes for Channel Coding and Source Coding". IEEE Trans. Inf. Theory 64(5): 3953 (2018) - [c66]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Bounds on the Effective-length of Optimal Codes for Interference Channel with Feedback. ISIT 2018: 1126-1130 - [c65]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Lattices from Linear Codes and Fine Quantization: General Continuous Sources and Channels. ISIT 2018: 2356-2360 - [c64]Mohsen Heidari, Achilleas Anastasopoulos, S. Sandeep Pradhan:
On The Reliability Function of Discrete Memoryless Multiple-Access Channel with Feedback. ITW 2018: 1-5 - [i40]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Bounds on the Effective-length of Optimal Codes for Interference Channel with Feedback. CoRR abs/1801.05294 (2018) - [i39]Mohsen Heidari, Achilleas Anastasopoulos, S. Sandeep Pradhan:
On The Reliability Function of Discrete Memoryless Multiple-Access Channel with Feedback. CoRR abs/1801.07777 (2018) - 2017
- [j31]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) - [c63]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
A new achievable rate region for multiple-access channel with states. ISIT 2017: 36-40 - [c62]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the correlation between Boolean functions of sequences of random variables. ISIT 2017: 1301-1305 - [c61]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the sub-optimality of single-letter coding in multi-terminal communications. ISIT 2017: 1823-1827 - [c60]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the necessity of structured codes for communications over MAC with feedback. ISIT 2017: 2298-2302 - [i38]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the Correlation between Boolean Functions of Sequences of Random Variables. CoRR abs/1702.01353 (2017) - [i37]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the Sub-optimality of Single-letter Coding in Multi-terminal Communications. CoRR abs/1702.01376 (2017) - [i36]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
A New Achievable Rate Region for Multiple-Access Channel with States. CoRR abs/1702.02330 (2017) - [i35]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the Necessity of Structured Codes for Communications over MAC with Feedback. CoRR abs/1702.05544 (2017) - [i34]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
On the Sub-optimality of Single-Letter Coding over Networks. CoRR abs/1705.00410 (2017) - [i33]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
How to Compute Modulo Prime-Power Sums ? CoRR abs/1708.00665 (2017) - 2016
- [j30]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) - [c59]Farhad Shirani Chaharsooghi, Mohsen Heidari, S. Sandeep Pradhan:
Quasi Linear Codes: Application to point-to-point and multi-terminal source coding. ISIT 2016: 730-734 - [c58]Mohsen Heidari, S. Sandeep Pradhan:
How to compute modulo prime-power sums. ISIT 2016: 1824-1828 - [c57]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
New sufficient conditions for Multiple-Access Channel with correlated sources. ISIT 2016: 2019-2023 - [c56]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Trade-off between communication and cooperation in the Interference Channel. ISIT 2016: 2214-2218 - [i32]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
An Achievable Rate-Distortion Region for Multiple Descriptions Source Coding Based on Coset Codes. CoRR abs/1602.01911 (2016) - [i31]Farhad Shirani Chaharsooghi, Mohsen Heidari, S. Sandeep Pradhan:
Quasi Linear Codes: Application to Point-to-Point and Multi-Terminal Source Coding. CoRR abs/1602.04521 (2016) - [i30]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Trade-off between Communication and Cooperation in the Interference Channel. CoRR abs/1602.05287 (2016) - [i29]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
New Sufficient Conditions for Multiple-Access Channel with Correlated Sources. CoRR abs/1603.05274 (2016) - [i28]Mohsen Heidari, S. Sandeep Pradhan:
How to Compute Modulo Prime-Power Sums. CoRR abs/1609.04360 (2016) - 2015
- [j29]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Abelian Group Codes for Channel Coding and Source Coding. IEEE Trans. Inf. Theory 61(5): 2399-2414 (2015) - [j28]Ali Nazari, S. Sandeep Pradhan, Achilleas Anastasopoulos:
Error Exponent for Multiple Access Channels: Upper Bounds. IEEE Trans. Inf. Theory 61(7): 3605-3621 (2015) - [c55]Farhad Shirani Chaharsooghi, Mohsen Heidari, S. Sandeep Pradhan:
New lattice codes for multiple-descriptions. ISIT 2015: 1580-1584 - [c54]Arun Padakandla, S. Sandeep Pradhan:
Coset codes for communicating over non-additive channels. ISIT 2015: 2071-2075 - [c53]Mohsen Heidari, Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Beyond group capacity in multi-terminal communications. ISIT 2015: 2081-2085 - [i27]Arun Padakandla, S. Sandeep Pradhan:
Coset codes for communicating over non-additive channels. CoRR abs/1502.04367 (2015) - 2014
- [j27]Ali Nazari, Achilleas Anastasopoulos, S. Sandeep Pradhan:
Error Exponent for Multiple-Access Channels: Lower Bounds. IEEE Trans. Inf. Theory 60(9): 5095-5115 (2014) - [c52]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Polar codes for some multi-terminal communications problems. ISIT 2014: 316-320 - [c51]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
An achievable rate-distortion region for the multiple descriptions problem. ISIT 2014: 576-580 - [c50]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
Finite block-length gains in distributed source coding. ISIT 2014: 1702-1706 - [i26]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Nested Polar Codes Achieve the Shannon Rate-Distortion Function and the Shannon Capacity. CoRR abs/1401.6482 (2014) - [i25]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Polar Codes for Multi-terminal Communications. CoRR abs/1401.7006 (2014) - [i24]Farhad Shirani Chaharsooghi, S. Sandeep Pradhan:
An Achievable Rate-Distortion Region for the Multiple Descriptions Problem. CoRR abs/1402.2032 (2014) - [i23]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
- [j26]V. Lalitha, N. Prakash, K. Vinodh, P. Vijay Kumar, S. Sandeep Pradhan:
Linear Coding Schemes for the Distributed Computation of Subspaces. IEEE J. Sel. Areas Commun. 31(4): 678-690 (2013) - [j25]David L. Neuhoff, S. Sandeep Pradhan:
Information Rates of Densely Sampled Data: Distributed Vector Quantization and Scalar Quantization With Transforms for Gaussian Sources. IEEE Trans. Inf. Theory 59(9): 5641-5664 (2013) - [j24]Ramji Venkataramanan, S. Sandeep Pradhan:
An Achievable Rate Region for the Broadcast Channel With Feedback. IEEE Trans. Inf. Theory 59(10): 6175-6191 (2013) - [j23]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Multilevel Channel Polarization for Arbitrary Discrete Memoryless Channels. IEEE Trans. Inf. Theory 59(12): 7839-7857 (2013) - [c49]Arun Padakandla, S. Sandeep Pradhan:
Achievable rate region for three user discrete broadcast channel based on coset codes. ISIT 2013: 1277-1281 - [c48]Farhad Shirani Chaharsooghi, Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Distributed source coding in absence of common components. ISIT 2013: 1362-1366 - [c47]Arun Padakandla, S. Sandeep Pradhan:
Achievable rate region based on coset codes for multiple access channel with states. ISIT 2013: 2641-2645 - [i22]Arun Padakandla, Sandeep S. Pradhan:
A new achievable rate region for the multiple access channel with noncausal states. CoRR abs/1301.5655 (2013) - [i21]Arun Padakandla, S. Sandeep Pradhan:
Computing sum of sources over an arbitrary multiple access channel. CoRR abs/1301.5684 (2013) - [i20]V. Lalitha, N. Prakash, K. Vinodh, P. Vijay Kumar, S. Sandeep Pradhan:
Linear Coding Schemes for the Distributed Computation of Subspaces. CoRR abs/1302.5021 (2013) - [i19]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Abelian Group Codes for Source Coding and Channel Coding. CoRR abs/1305.1598 (2013) - 2012
- [c46]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Polar codes for sources with finite reconstruction alphabets. Allerton Conference 2012: 580-586 - [c45]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
On distributed source coding using Abelian group codes. Allerton Conference 2012: 2068-2074 - [c44]David L. Neuhoff, S. Sandeep Pradhan:
Rate-distortion behavior at low distortion for densely sampled Gaussian data. ISIT 2012: 358-362 - [c43]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Nested lattice codes for arbitrary continuous sources and channels. ISIT 2012: 626-630 - [c42]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Codes over non-Abelian groups: Point-to-point communications and computation over MAC. ISIT 2012: 631-635 - [c41]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 - [i18]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Asymptotically Good Codes Over Non-Abelian Groups. CoRR abs/1202.0863 (2012) - [i17]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Nested Lattice Codes for Arbitrary Continuous Sources and Channels. CoRR abs/1202.0864 (2012) - [i16]Arun Padakandla, Sandeep S. Pradhan:
A new coding theorem for three user discrete memoryless broadcast channel. CoRR abs/1207.3146 (2012) - 2011
- [j22]Lihua Weng, Achilleas Anastasopoulos, S. Sandeep Pradhan:
Diversity Gain Regions for MIMO Fading Broadcast Channels. IEEE Trans. Commun. 59(10): 2716-2728 (2011) - [j21]Dinesh Krithivasan, S. Sandeep Pradhan:
Distributed Source Coding Using Abelian Group Codes: A New Achievable Rate-Distortion Region. IEEE Trans. Inf. Theory 57(3): 1495-1519 (2011) - [j20]Ramji Venkataramanan, S. Sandeep Pradhan:
Achievable Rates for Multiple Descriptions With Feed-Forward. IEEE Trans. Inf. Theory 57(4): 2270-2277 (2011) - [j19]Ramji Venkataramanan, S. Sandeep Pradhan:
A New Achievable Rate Region for the Multiple-Access Channel With Noiseless Feedback. IEEE Trans. Inf. Theory 57(12): 8038-8054 (2011) - [c40]V. Lalitha, N. Prakash, K. Vinodh, P. Vijay Kumar, S. Sandeep Pradhan:
A nested linear codes approach to distributed function computation over subspaces. Allerton 2011: 1202-1209 - [c39]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Multilevel polarization of polar codes over arbitrary discrete memoryless channels. Allerton 2011: 1718-1725 - [c38]Arun Padakandla, Sandeep S. Pradhan:
Nested linear codes achieve Marton's inner bound for general broadcast channels. ISIT 2011: 1554-1558 - [c37]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
On the capacity of Abelian group codes over discrete memoryless channels. ISIT 2011: 1743-1747 - [c36]David L. Neuhoff, Sandeep S. Pradhan:
Information rates of densely sampled Gaussian data. ISIT 2011: 2776-2780 - [i15]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
On the Capacity of Abelian Group Codes Over Discrete Memoryless Channels. CoRR abs/1102.3243 (2011) - [i14]Ramji Venkataramanan, S. Sandeep Pradhan:
An Achievable Rate Region for the Broadcast Channel with Feedback. CoRR abs/1105.2311 (2011) - [i13]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Multilevel Polarization of Polar Codes Over Arbitrary Discrete Memoryless Channels. CoRR abs/1107.1535 (2011) - 2010
- [j18]Ramji Venkataramanan, S. Sandeep Pradhan:
On Computing the Feedback Capacity of Channels and the Feed-Forward Rate-Distortion Function of Sources. IEEE Trans. Commun. 58(7): 1889-1896 (2010) - [j17]S. Sandeep Pradhan, Kannan Ramchandran:
Correction to "on functional duality in multiuser source and channel coding problems having one-sidedcollaboration". IEEE Trans. Inf. Theory 56(9): 4763 (2010) - [c35]K. Vinodh, V. Lalitha, N. Prakash, P. Vijay Kumar, S. Sandeep Pradhan:
On the achievable rates of sources having a group alphabet in a distributed source coding setting. Allerton 2010: 479-486 - [c34]Ramji Venkataramanan, S. Sandeep Pradhan:
Achievable rates for the broadcast channel with feedback. ISIT 2010: 455-459 - [c33]Ali Nazari, Dinesh Krithivasan, S. Sandeep Pradhan, Achilleas Anastasopoulos, Ramji Venkataramanan:
Typicality graphs and their properties. ISIT 2010: 520-524 - [i12]Ali Nazari, Achilleas Anastasopoulos, S. Sandeep Pradhan:
Error Exponent for Multiple-Access Channels:Lower Bounds. CoRR abs/1010.1303 (2010) - [i11]Ali Nazari, Ramji Venkataramanan, Dinesh Krithivasan, S. Sandeep Pradhan, Achilleas Anastasopoulos:
Typicality Graphs:Large Deviation Analysis. CoRR abs/1010.1317 (2010) - [i10]Ali Nazari, S. Sandeep Pradhan, Achilleas Anastasopoulos:
A New Upper Bound on the Average Error Exponent for Multiple-Access Channels. CoRR abs/1010.1322 (2010)
2000 – 2009
- 2009
- [j16]Dinesh Krithivasan, S. Sandeep Pradhan:
Lattices for distributed source coding: jointly Gaussian sources and reconstruction of a linear function. IEEE Trans. Inf. Theory 55(12): 5628-5651 (2009) - [c32]Ali Nazari, Achilleas Anastasopoulos, S. Sandeep Pradhan:
A new universal random-coding bound for average probability error exponent for multiple-access channels. CISS 2009: 295-300 - [c31]S. Sandeep Pradhan, Ali Nazari, Achilleas Anastasopoulos:
New bounds on the maximal error exponent for multiple-access channels. ISIT 2009: 1704-1708 - [c30]Ramji Venkataramanan, S. Sandeep Pradhan:
A new achievable rate region for the discrete memoryless multiple-access channel with feedback. ISIT 2009: 2371-2375 - [i9]Ali Nazari, Achilleas Anastasopoulos, S. Sandeep Pradhan:
A New Universal Random-Coding Bound for Average Probability Error Exponent for Multiple-Access Channels. CoRR abs/0901.0948 (2009) - [i8]Ramji Venkataramanan, S. Sandeep Pradhan:
A New Achievable Rate Region for the Discrete Memoryless Multiple-Access Channel with Feedback. CoRR abs/0901.1892 (2009) - 2008
- [j15]Suhan Choi, S. Sandeep Pradhan:
A Graph-Based Framework for Transmission of Correlated Sources Over Broadcast Channels. IEEE Trans. Inf. Theory 54(7): 2841-2856 (2008) - [j14]Lihua Weng, S. Sandeep Pradhan, Achilleas Anastasopoulos:
Error Exponent Regions for Gaussian Broadcast and Multiple-Access Channels. IEEE Trans. Inf. Theory 54(7): 2919-2942 (2008) - [c29]Dinesh Krithivasan, S. Sandeep Pradhan:
Distributed source coding using Abelian group codes: Extracting performance from structure. Allerton 2008: 1538-1545 - [c28]Dinesh Krithivasan, S. Sandeep Pradhan:
An achievable rate region for distributed source coding with reconstruction of an arbitrary function of the sources. ISIT 2008: 56-60 - [c27]Ramji Venkataramanan, S. Sandeep Pradhan:
Multiple descriptions with feed-forward: A single-letter achievable rate region. ISIT 2008: 692-696 - [c26]Ali Nazari, S. Sandeep Pradhan, Achilleas Anastasopoulos:
A new sphere-packing bound for maximal error exponent for multiple-access channels. ISIT 2008: 1513-1517 - [i7]Ali Nazari, S. Sandeep Pradhan, Achilleas Anastasopoulos:
A New Sphere-Packing Bound for Maximal Error Exponent for Multiple-Access Channels. CoRR abs/0803.3645 (2008) - [i6]Dinesh Krithivasan, S. Sandeep Pradhan:
Distributed Source Coding using Abelian Group Codes. CoRR abs/0808.2659 (2008) - 2007
- [j13]S. Sandeep Pradhan:
On the Role of Feedforward in Gaussian Sources: Point-to-Point Source Coding and Multiple Description Source Coding. IEEE Trans. Inf. Theory 53(1): 331-349 (2007) - [j12]Ramji Venkataramanan, S. Sandeep Pradhan:
Source Coding With Feed-Forward: Rate-Distortion Theorems and Error Exponents for a General Source. IEEE Trans. Inf. Theory 53(6): 2154-2179 (2007) - [j11]S. Sandeep Pradhan, Suhan Choi, Kannan Ramchandran:
A Graph-Based Framework for Transmission of Correlated Sources Over Multiple-Access Channels. IEEE Trans. Inf. Theory 53(12): 4583-4604 (2007) - [c25]Dinesh Krithivasan, S. Sandeep Pradhan:
Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function. AAECC 2007: 178-187 - [c24]Ramji Venkataramanan, S. Sandeep Pradhan:
On Evaluating the Rate-Distortion Function of Sources with Feed-Forward and the Capacity of Channels with Feedback. ISIT 2007: 401-405 - [c23]S. Sandeep Pradhan, David L. Neuhoff:
Transform Coding of Densely Sampled Gaussian Data. ISIT 2007: 1111-1114 - [i5]Dinesh Krithivasan, S. Sandeep Pradhan:
Lattices for Distributed Source Coding: Jointly Gaussian Sources and Reconstruction of a Linear Function. CoRR abs/0707.3461 (2007) - [i4]Enrique J. Duarte-Melo, Awlok Josan, Mingyan Liu, David L. Neuhoff, S. Sandeep Pradhan:
On Throughput Scaling of Wireless Networks: Effect of Node Density and Propagation Model. CoRR abs/0707.4518 (2007) - [i3]Awlok Josan, Mingyan Liu, David L. Neuhoff, S. Sandeep Pradhan:
Throughput Scaling in Random Wireless Networks: A Non-Hierarchical Multipath Routing Strategy. CoRR abs/0710.1626 (2007) - [i2]Ramji Venkataramanan, S. Sandeep Pradhan:
On Evaluating the Rate-Distortion Function of Sources with Feed-Forward and the Capacity of Channels with Feedback. CoRR abs/cs/0702009 (2007) - 2006
- [j10]S. Sandeep Pradhan, Kannan Ramchandran:
On Functional Duality in Multiuser Source and Channel Coding Problems With One-Sided Collaboration. IEEE Trans. Inf. Theory 52(7): 2986-3002 (2006) - [c22]David L. Neuhoff, S. Sandeep Pradhan:
An Upper Bound to the Rate of Ideal Distributed Lossy Source Coding of Densely Sampled Data. ICASSP (5) 2006: 1137-1140 - [c21]Enrique J. Duarte-Melo, Awlok Josan, Mingyan Liu, David L. Neuhoff, S. Sandeep Pradhan:
The Effect of Node Density and Propagation Model on Throughput Scaling of Wireless Networks. ISIT 2006: 1693-1697 - [c20]Suhan Choi, S. Sandeep Pradhan:
Representation of Correlated Sources into Graphs for Transmission over Broadcast Channels. ISIT 2006: 2418-2422 - [i1]Suhan Choi, S. Sandeep Pradhan:
A Graph-based Framework for Transmission of Correlated Sources over Broadcast Channels. CoRR abs/cs/0608006 (2006) - 2005
- [j9]Prakash Ishwar, Rohit Puri, Kannan Ramchandran, S. Sandeep Pradhan:
On rate-constrained distributed estimation in unreliable sensor networks. IEEE J. Sel. Areas Commun. 23(4): 765-775 (2005) - [j8]Rohit Puri, S. Sandeep Pradhan, Kannan Ramchandran:
n-channel symmetric multiple descriptions-part II: An achievable rate-distortion region. IEEE Trans. Inf. Theory 51(4): 1377-1392 (2005) - [j7]S. Sandeep Pradhan, Kannan Ramchandran:
Generalized coset codes for distributed binning. IEEE Trans. Inf. Theory 51(10): 3457-3474 (2005) - 2004
- [j6]S. Sandeep Pradhan, Rohit Puri, Kannan Ramchandran:
n-channel symmetric multiple descriptions - part I: (n, k) source-channel erasure codes. IEEE Trans. Inf. Theory 50(1): 47-61 (2004) - [c19]D. Schongberg, Kannan Ramchandran, S. Sandeep Pradhan:
Distributed Code Constructions for the Entire Slepian-Wolf Rate Region for Arbitrarily Correlated Sources. Data Compression Conference 2004: 292-301 - [c18]S. Sandeep Pradhan, Suhan Choi, Kannan Ramchandran:
Achievable rates for multiple-access channels with correlated messages. ISIT 2004: 108 - [c17]S. Sandeep Pradhan:
Source coding with feedforward: Gaussian sources. ISIT 2004: 212 - [c16]Lihua Weng, Achilleas Anastasopoulos, S. Sandeep Pradhan:
Error exponent region for Gaussian multiple access channels. ISIT 2004: 446 - [c15]Ramji Venkataramanan, S. Sandeep Pradhan:
Source coding with feed-forward. ITW 2004: 330-335 - [c14]Lihua Weng, Achilleas Anastasopoulos, S. Sandeep Pradhan:
Diversity gain region for MIMO fading broadcast channels. ITW 2004: 359-364 - 2003
- [j5]S. Sandeep Pradhan, Kannan Ramchandran:
Distributed source coding using syndromes (DISCUS): design and construction. IEEE Trans. Inf. Theory 49(3): 626-643 (2003) - [j4]S. Sandeep Pradhan, Jim Chou, Kannan Ramchandran:
Duality between source coding and channel coding and its extension to the side information case. IEEE Trans. Inf. Theory 49(5): 1181-1203 (2003) - [c13]Jim Chou, S. Sandeep Pradhan, Kannan Ramchandran:
Turbo and Trellis-Based Constructions for Source Coding with Side Information. DCC 2003: 33-42 - [c12]S. Sandeep Pradhan, Kannan Ramchandran:
Duality in Multi-user Source and Channel Coding. Advances in Network Information Theory 2003: 239-259 - [c11]Prakash Ishwar, Rohit Puri, S. Sandeep Pradhan, Kannan Ramchandran:
On Rate-Constrained Estimation in Unreliable Sensor Networks. IPSN 2003: 178-192 - 2002
- [j3]S. Sandeep Pradhan, Julius Kusuma, Kennan Ramchandran:
Distributed compression in a dense microsensor network. IEEE Signal Process. Mag. 19(2): 51-60 (2002) - [j2]S. Sandeep Pradhan, Kannan Ramchandran:
Efficient layered data transport over multicarrier systems using optimized embedded modulation. IEEE Trans. Commun. 50(6): 877-881 (2002) - [c10]Rohit Puri, Kannan Ramchandran, S. Sandeep Pradhan:
n-Channel Multiple Descriptions: Theory and Constructions. DCC 2002: 262-271 - [c9]S. Sandeep Pradhan, Kannan Ramchandran:
On functional duality in MIMO source and channel coding problems having one-sided collaboration. ITW 2002: 115-118 - [c8]Jim Chou, Kannan Ramchandran, S. Sandeep Pradhan:
Turbo-coded trellis-based constructions for data hiding. Security and Watermarking of Multimedia Contents 2002: 399-408 - 2001
- [c7]S. Sandeep Pradhan, Kannan Ramchandran:
Enhancing Analog Image Transmission Systems Using Digital Side Information: A New Wavelet-Based Image Coding Paradigm. Data Compression Conference 2001: 63-72 - 2000
- [j1]S. Sandeep Pradhan, Kannan Ramchandran:
On the optimality of block orthogonal transforms for multiple description coding of Gaussian vector sources. IEEE Signal Process. Lett. 7(4): 76-78 (2000) - [c6]S. Sandeep Pradhan, Kannan Ramchandran:
Distributed Source Coding: Symmetric Rates and Applications to Sensor Networks. Data Compression Conference 2000: 363-372 - [c5]Jim Chou, S. Sandeep Pradhan, Laurent El Ghaoui, Kannan Ramchandran:
Watermarking Based on Duality with Distributed Source Coding and Robust Optimization Principles. ICIP 2000: 585-588 - [c4]Jim Chou, S. Sandeep Pradhan, Kannan Ramchandran:
A robust blind watermaking scheme based on distributed source coding principles. ACM Multimedia 2000: 49-56
1990 – 1999
- 1999
- [c3]S. Sandeep Pradhan, Kannan Ramchandran:
Distributed Source Coding Using Syndromes (DISCUS): Design and Construction. Data Compression Conference 1999: 158-167 - 1998
- [c2]S. Sandeep Pradhan, Kannan Ramchandran:
Optimized embedded multicarrier modulation for efficient delivery of layered video data. ICC 1998: 1009-1012 - 1997
- [c1]S. Sandeep Pradhan, Kannan Ramchandran:
Efficient layered video delivery over multicarrier systems using optimized embedded modulation. ICIP (3) 1997: 452-455
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-10-24 21:31 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:
