default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAditya Ramamoorthy
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
[j38]Anindya Bijoy Das
, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton:
Sparsity-Preserving Encodings for Straggler-Optimal Distributed Matrix Computations at the Edge. IEEE Internet Things J. 11(21): 34455-34470 (2024)- [j37]Konstantinos Konstantinidis, Namrata Vaswani, Aditya Ramamoorthy:
Detection and Mitigation of Byzantine Attacks in Distributed Training. IEEE/ACM Trans. Netw. 32(2): 1493-1508 (2024) - [i58]Aditya Ramamoorthy, Ruoyu Meng, Vrinda S. Girimaji:
Leveraging partial stragglers within gradient coding. CoRR abs/2405.19509 (2024) - [i57]Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton:
Sparsity-Preserving Encodings for Straggler-Optimal Distributed Matrix Computations at the Edge. CoRR abs/2408.05152 (2024) - 2023
- [j36]Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton:
Distributed Matrix Computations With Low-Weight Encodings. IEEE J. Sel. Areas Inf. Theory 4: 363-378 (2023) - [c62]Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton:
Preserving Sparsity and Privacy in Straggler-Resilient Distributed Matrix Computations. Allerton 2023: 1-8 - [c61]Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton:
Coded Matrix Computations for D2D-Enabled Linearized Federated Learning. ICASSP 2023: 1-5 - [c60]Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton:
Distributed Matrix Computations with Low-weight Encodings. ISIT 2023: 1979-1984 - [c59]Kyungrak Son, Aditya Ramamoorthy:
Coded matrix computation with gradient coding. ISIT 2023: 2183-2188 - [i56]Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton:
Distributed Matrix Computations with Low-weight Encodings. CoRR abs/2301.12685 (2023) - [i55]Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton:
Coded Matrix Computations for D2D-enabled Linearized Federated Learning. CoRR abs/2302.12305 (2023) - [i54]Kyungrak Son, Aditya Ramamoorthy:
Coded matrix computation with gradient coding. CoRR abs/2304.13685 (2023) - [i53]Ruoyu Meng, Aditya Ramamoorthy:
Communication complexity of entanglement assisted multi-party computation. CoRR abs/2305.04435 (2023) - [i52]Anindya Bijoy Das, Aditya Ramamoorthy, David J. Love, Christopher G. Brinton:
Preserving Sparsity and Privacy in Straggler-Resilient Distributed Matrix Computations. CoRR abs/2308.04331 (2023) - 2022
- [j35]Anindya Bijoy Das, Aditya Ramamoorthy:
A Unified Treatment of Partial Stragglers and Sparse Matrices in Coded Matrix Computation. IEEE J. Sel. Areas Inf. Theory 3(2): 241-256 (2022) - [j34]Aditya Ramamoorthy, Li Tang:
Numerically Stable Coded Matrix Computations via Circulant and Rotation Matrix Embeddings. IEEE Trans. Inf. Theory 68(4): 2684-2703 (2022) - [j33]Anindya Bijoy Das, Aditya Ramamoorthy:
Coded Sparse Matrix Computation Schemes That Leverage Partial Stragglers. IEEE Trans. Inf. Theory 68(6): 4156-4181 (2022) - [j32]Praneeth Narayanamurthy, Namrata Vaswani, Aditya Ramamoorthy:
Federated Over-Air Subspace Tracking From Incomplete and Corrupted Data. IEEE Trans. Signal Process. 70: 3906-3920 (2022) - [c58]Praneeth Narayanamurthy, Namrata Vaswani, Aditya Ramamoorthy:
Federated Over-Air Robust Subspace Tracking from Missing Data. ICASSP 2022: 5598-5602 - [c57]Anindya Bijoy Das, Aditya Ramamoorthy:
An Integrated Method to Deal with Partial Stragglers and Sparse Matrices in Distributed Computations. ISIT 2022: 1010-1015 - [c56]Konstantinos Konstantinidis, Aditya Ramamoorthy:
Aspis: Robust Detection for Distributed Learning. ISIT 2022: 2058-2063 - [i51]Konstantinos Konstantinidis, Aditya Ramamoorthy:
Efficient Detection and Filtering Systems for Distributed Training. CoRR abs/2208.08085 (2022) - 2021
- [j31]Kyungrak Son, Aditya Ramamoorthy, Wan Choi:
Distributed Matrix Multiplication Using Group Algebra for On-Device Edge Computing. IEEE Signal Process. Lett. 28: 2097-2101 (2021) - [j30]Anindya Bijoy Das, Aditya Ramamoorthy, Namrata Vaswani:
Efficient and Robust Distributed Matrix Computations via Convolutional Coding. IEEE Trans. Inf. Theory 67(9): 6266-6282 (2021) - [c55]Anindya Bijoy Das, Aditya Ramamoorthy:
Coded sparse matrix computation schemes that leverage partial stragglers. ISIT 2021: 1570-1575 - [c54]Aditya Ramamoorthy, Li Tang:
Numerically stable coded matrix computations via circulant and rotation matrix embeddings. ISIT 2021: 1712-1717 - [c53]Anindya Bijoy Das, Aditya Ramamoorthy, Namrata Vaswani:
Efficient and Robust Distributed Matrix Computations via Convolutional Coding. ISIT 2021: 1724-1729 - [c52]Anindya Bijoy Das, Aditya Ramamoorthy:
A Unified Treatment of Partial Stragglers and Sparse Matrices in Coded Matrix Computation. ITW 2021: 1-6 - [c51]Konstantinos Konstantinidis, Aditya Ramamoorthy:
ByzShield: An Efficient and Robust System for Distributed Training. MLSys 2021 - [i50]Konstantinos Konstantinidis, Aditya Ramamoorthy:
Aspis: A Robust Detection System for Distributed Learning. CoRR abs/2108.02416 (2021) - [i49]Anindya Bijoy Das, Aditya Ramamoorthy:
A Unified Treatment of Partial Stragglers and Sparse Matrices in Coded Matrix Computation. CoRR abs/2109.12070 (2021) - 2020
- [j29]Aditya Ramamoorthy, Anindya Bijoy Das, Li Tang:
Straggler-Resistant Distributed Matrix Computation via Coding Theory: Removing a Bottleneck in Large-Scale Data Processing. IEEE Signal Process. Mag. 37(3): 136-145 (2020) - [j28]Konstantinos Konstantinidis, Aditya Ramamoorthy:
Resolvable Designs for Speeding Up Distributed Computing. IEEE/ACM Trans. Netw. 28(4): 1657-1670 (2020) - [j27]Hooshang Ghasemi, Aditya Ramamoorthy:
Asynchronous Coded Caching With Uncoded Prefetching. IEEE/ACM Trans. Netw. 28(5): 2146-2159 (2020) - [i48]Aditya Ramamoorthy, Anindya Bijoy Das, Li Tang:
Straggler-resistant distributed matrix computation via coding theory. CoRR abs/2002.03515 (2020) - [i47]Praneeth Narayanamurthy, Namrata Vaswani, Aditya Ramamoorthy:
Federated Over-the-Air Subspace Learning from Incomplete Data. CoRR abs/2002.12873 (2020) - [i46]Konstantinos Konstantinidis, Aditya Ramamoorthy:
ByzShield: An Efficient and Robust System for Distributed Training. CoRR abs/2010.04902 (2020) - [i45]Anindya Bijoy Das, Aditya Ramamoorthy:
Coded sparse matrix computation schemes that leverage partial stragglers. CoRR abs/2012.06065 (2020)
2010 – 2019
- 2019
- [j26]Li Tang, Konstantinos Konstantinidis, Aditya Ramamoorthy:
Erasure Coding for Distributed Matrix Multiplication for Matrices With Bounded Entries. IEEE Commun. Lett. 23(1): 8-11 (2019) - [c50]Konstantinos Konstantinidis, Aditya Ramamoorthy:
CAMR: Coded Aggregated MapReduce. ISIT 2019: 1427-1431 - [c49]Aditya Ramamoorthy, Li Tang, Pascal O. Vontobel:
Universally Decodable Matrices for Distributed Matrix-Vector Multiplication. ISIT 2019: 1777-1781 - [c48]Anindya Bijoy Das, Aditya Ramamoorthy:
Distributed Matrix-Vector Multiplication: A Convolutional Coding Approach. ISIT 2019: 3022-3026 - [i44]Konstantinos Konstantinidis, Aditya Ramamoorthy:
CAMR: Coded Aggregated MapReduce. CoRR abs/1901.07418 (2019) - [i43]Anindya Bijoy Das, Aditya Ramamoorthy:
Distributed Matrix-Vector Multiplication: A Convolutional Coding Approach. CoRR abs/1901.08716 (2019) - [i42]Aditya Ramamoorthy, Li Tang, Pascal O. Vontobel:
Universally Decodable Matrices for Distributed Matrix-Vector Multiplication. CoRR abs/1901.10674 (2019) - [i41]Hooshang Ghasemi, Aditya Ramamoorthy:
Asynchronous Coded Caching. CoRR abs/1907.06801 (2019) - [i40]Anindya Bijoy Das, Aditya Ramamoorthy, Namrata Vaswani:
Random Convolutional Coding for Robust and Straggler Resilient Distributed Matrix Computation. CoRR abs/1907.08064 (2019) - [i39]Konstantinos Konstantinidis, Aditya Ramamoorthy:
Resolvable Designs for Speeding up Distributed Computing. CoRR abs/1908.05666 (2019) - [i38]Aditya Ramamoorthy, Li Tang:
Numerically stable coded matrix computations via circulant and rotation matrix embeddings. CoRR abs/1910.06515 (2019) - 2018
- [j25]Li Tang, Aditya Ramamoorthy:
Coded Caching Schemes With Reduced Subpacketization From Linear Block Codes. IEEE Trans. Inf. Theory 64(4): 3099-3120 (2018) - [j24]Ardhendu Tripathy, Aditya Ramamoorthy:
Sum-Networks From Incidence Structures: Construction and Capacity Analysis. IEEE Trans. Inf. Theory 64(5): 3461-3480 (2018) - [j23]Bin Li, Aditya Ramamoorthy, R. Srikant:
Mean-Field Analysis of Coding Versus Replication in Large Data Storage Systems. ACM Trans. Model. Perform. Evaluation Comput. Syst. 3(1): 3:1-3:28 (2018) - [c47]Konstantinos Konstantinidis, Aditya Ramamoorthy:
Leveraging Coding Techniques for Speeding up Distributed Computing. GLOBECOM 2018: 1-6 - [c46]Anindya Bijoy Das, Li Tang, Aditya Ramamoorthy:
C3LES: Codes for Coded Computation that Leverage Stragglers. ITW 2018: 1-5 - [c45]Ardhendu Tripathy, Aditya Ramamoorthy:
Zero-error Function Computation on a Directed Acyclic Network. ITW 2018: 1-5 - [i37]Konstantinos Konstantinidis, Aditya Ramamoorthy:
Leveraging Coding Techniques for Speeding up Distributed Computing. CoRR abs/1802.03049 (2018) - [i36]Ardhendu Tripathy, Aditya Ramamoorthy:
Zero-error Function Computation on a Directed Acyclic Network. CoRR abs/1805.03730 (2018) - [i35]Anindya Bijoy Das, Li Tang, Aditya Ramamoorthy:
C3LES: Codes for Coded Computation that Leverage Stragglers. CoRR abs/1809.06242 (2018) - [i34]Li Tang, Konstantinos Konstantinidis, Aditya Ramamoorthy:
Erasure coding for distributed matrix multiplication for matrices with bounded entries. CoRR abs/1811.02144 (2018) - 2017
- [j22]Hooshang Ghasemi, Aditya Ramamoorthy:
Improved Lower Bounds for Coded Caching. IEEE Trans. Inf. Theory 63(7): 4388-4413 (2017) - [c44]Hooshang Ghasemi, Aditya Ramamoorthy:
Algorithms for asynchronous coded caching. ACSSC 2017: 636-640 - [c43]Hooshang Ghasemi, Aditya Ramamoorthy:
Asynchronous coded caching. ISIT 2017: 2438-2442 - [c42]Li Tang, Aditya Ramamoorthy:
Low subpacketization schemes for coded caching. ISIT 2017: 2790-2794 - [i33]Li Tang, Aditya Ramamoorthy:
Low Subpacketization Schemes for Coded Caching. CoRR abs/1706.00101 (2017) - 2016
- [j21]Oktay Ölmez, Aditya Ramamoorthy:
Fractional Repetition Codes With Flexible Repair From Combinatorial Designs. IEEE Trans. Inf. Theory 62(4): 1565-1591 (2016) - [c41]Li Tang, Aditya Ramamoorthy:
Coded Caching with Low Subpacketization Levels. GLOBECOM Workshops 2016: 1-6 - [c40]Bin Li, Aditya Ramamoorthy, R. Srikant:
Mean-field-analysis of coding versus replication in cloud storage systems. INFOCOM 2016: 1-9 - [c39]Li Tang, Aditya Ramamoorthy:
Coded caching for networks with the resolvability property. ISIT 2016: 420-424 - [c38]Hooshang Ghasemi, Aditya Ramamoorthy:
Further results on lower bounds for coded caching. ISIT 2016: 2319-2323 - [c37]Ardhendu Tripathy, Aditya Ramamoorthy:
On computation rates for arithmetic sum. ISIT 2016: 2354-2358 - [i32]Ardhendu Tripathy, Aditya Ramamoorthy:
On Computation Rates for Arithmetic Sum. CoRR abs/1601.07228 (2016) - [i31]Li Tang, Aditya Ramamoorthy:
Coded Caching for Networks with the Resolvability Property. CoRR abs/1605.01424 (2016) - [i30]Li Tang, Aditya Ramamoorthy:
Coded Caching with Low Subpacketization Levels. CoRR abs/1607.07920 (2016) - [i29]Ardhendu Tripathy, Aditya Ramamoorthy:
Sum-networks from incidence structures: construction and capacity analysis. CoRR abs/1611.01887 (2016) - [i28]Ardhendu Tripathy, Aditya Ramamoorthy:
Sum-networks from undirected graphs: construction and capacity analysis. CoRR abs/1612.07773 (2016) - 2015
- [c36]Ardhendu Tripathy, Aditya Ramamoorthy:
Capacity of sum-networks for different message alphabets. ISIT 2015: 606-610 - [c35]Hooshang Ghasemi, Aditya Ramamoorthy:
Improved lower bounds for coded caching. ISIT 2015: 1696-1700 - [i27]Hooshang Ghasemi, Aditya Ramamoorthy:
Improved Lower Bounds for Coded Caching. CoRR abs/1501.06003 (2015) - [i26]Ardhendu Tripathy, Aditya Ramamoorthy:
Capacity of Sum-networks for Different Message Alphabets. CoRR abs/1504.05618 (2015) - 2014
- [j20]Shurui Huang, Aditya Ramamoorthy:
On the Multiple-Unicast Capacity of 3-Source, 3-Terminal Directed Acyclic Networks. IEEE/ACM Trans. Netw. 22(1): 285-299 (2014) - [c34]Ardhendu Tripathy, Aditya Ramamoorthy:
Sum-networks from undirected graphs: Construction and capacity analysis. Allerton 2014: 651-658 - [i25]Oktay Ölmez, Aditya Ramamoorthy:
Fractional repetition codes with flexible repair from combinatorial designs. CoRR abs/1408.5780 (2014) - 2013
- [j19]Aditya Ramamoorthy, Michael Langberg:
Communicating the Sum of Sources Over a Network. IEEE J. Sel. Areas Commun. 31(4): 655-665 (2013) - [j18]Shurui Huang, Aditya Ramamoorthy:
An Achievable Region for the Double Unicast Problem Based on a Minimum Cut Analysis. IEEE Trans. Commun. 61(7): 2890-2899 (2013) - [j17]Naveen Kumar, Aditya Ramamoorthy, Murti V. Salapaka:
Error Analysis for ML Sequence Detection in ISI Channels With Gauss Markov Noise. IEEE Trans. Signal Process. 61(14): 3647-3652 (2013) - [c33]Oktay Ölmez, Aditya Ramamoorthy:
Constructions of fractional repetition codes from combinatorial designs. ACSSC 2013: 647-651 - [c32]Sayan Ghosal, Govind Saraswat, Aditya Ramamoorthy, Murti V. Salapaka:
Topography detection using innovations mismatch method for high speed and high density dynamic mode AFM. ACC 2013: 5500-5505 - [c31]Xin Yin, Zhao Song, Karin S. Dorman, Aditya Ramamoorthy:
PREMIER Turbo: Probabilistic error-correction using Markov inference in errored reads using the turbo principle. GlobalSIP 2013: 73-76 - [c30]Xin Yin, Zhao Song, Karin S. Dorman, Aditya Ramamoorthy:
PREMIER - PRobabilistic error-correction using Markov inference in errored reads. ISIT 2013: 1626-1630 - [c29]Oktay Ölmez, Aditya Ramamoorthy:
Replication based storage systems with local repair. NetCod 2013: 1-6 - [i24]Xin Yin, Zhao Song, Karin S. Dorman, Aditya Ramamoorthy:
PREMIER - PRobabilistic Error-correction using Markov Inference in Errored Reads. CoRR abs/1302.0212 (2013) - [i23]Shurui Huang, Aditya Ramamoorthy:
On the multiple unicast capacity of 3-source, 3-terminal directed acyclic networks. CoRR abs/1302.4474 (2013) - [i22]Oktay Ölmez, Aditya Ramamoorthy:
Replication based storage systems with local repair. CoRR abs/1305.5764 (2013) - 2012
- [j16]Shizheng Li, Aditya Ramamoorthy:
Multiple-Source Slepian-Wolf Coding Under a Linear Equation Correlation Model. IEEE Trans. Commun. 60(9): 2402-2407 (2012) - [j15]Aditya Ramamoorthy, Vwani P. Roychowdhury, Sudhir Kumar Singh:
Selfish Distributed Compression Over Networks: Correlation Induces Anarchy. IEEE Trans. Inf. Theory 58(5): 3182-3197 (2012) - [j14]Lei Ke, Aditya Ramamoorthy, Zhengdao Wang, Huarui Yin:
Degrees of Freedom Region for an Interference Network With General Message Demands. IEEE Trans. Inf. Theory 58(6): 3787-3797 (2012) - [c28]Oktay Ölmez, Aditya Ramamoorthy:
Repairable replication-based storage systems using resolvable designs. Allerton Conference 2012: 1174-1181 - [c27]Shurui Huang, Aditya Ramamoorthy:
On the multiple unicast capacity of 3-source, 3-terminal directed acyclic networks. ITA 2012: 152-159 - [i21]Oktay Ölmez, Aditya Ramamoorthy:
Repairable Replication-based Storage Systems Using Resolvable Designs. CoRR abs/1210.2110 (2012) - 2011
- [j13]Shizheng Li, Aditya Ramamoorthy:
Protection Against Link Errors and Failures Using Network Coding. IEEE Trans. Commun. 59(2): 518-528 (2011) - [j12]Aditya Ramamoorthy:
Minimum Cost Distributed Source Coding Over a Network. IEEE Trans. Inf. Theory 57(1): 461-475 (2011) - [j11]Shurui Huang, Aditya Ramamoorthy, Muriel Médard:
Minimum Cost Mirror Sites Using Network Coding: Replication versus Coding at the Source Nodes. IEEE Trans. Inf. Theory 57(2): 1080-1091 (2011) - [j10]Ahmed E. Kamal, Aditya Ramamoorthy, Long Long, Shizheng Li:
Overlay protection against link failures using network coding. IEEE/ACM Trans. Netw. 19(4): 1071-1084 (2011) - [c26]Shurui Huang, Aditya Ramamoorthy:
A Note on the Multiple Unicast Capacity of Directed Acyclic Networks. ICC 2011: 1-6 - [c25]Lei Ke, Aditya Ramamoorthy, Zhengdao Wang, Huarui Yin:
Degrees of freedom region for an interference network with general message demands. ISIT 2011: 36-40 - [c24]Shizheng Li, Aditya Ramamoorthy:
Algebraic codes for Slepian-Wolf code design. ISIT 2011: 1861-1865 - [c23]Shurui Huang, Aditya Ramamoorthy:
An achievable region for the double unicast problem based on a minimum cut analysis. ITW 2011: 120-124 - [p1]Shizheng Li, Aditya Ramamoorthy:
Networked Distributed Source Coding. Theoretical Aspects of Distributed Computing in Sensor Networks 2011: 191-224 - [i20]Lei Ke, Aditya Ramamoorthy, Zhengdao Wang, Huarui Yin:
Degrees of Freedom Region for an Interference Network with General Message Demands. CoRR abs/1101.3068 (2011) - [i19]Shurui Huang, Aditya Ramamoorthy:
A note on the multiple unicast capacity of directed acyclic networks. CoRR abs/1101.3285 (2011) - [i18]Shizheng Li, Aditya Ramamoorthy:
Algebraic codes for Slepian-Wolf code design. CoRR abs/1106.2792 (2011) - [i17]Shurui Huang, Aditya Ramamoorthy:
An achievable region for the double unicast problem based on a minimum cut analysis. CoRR abs/1111.0595 (2011) - 2010
- [j9]Shizheng Li, Aditya Ramamoorthy:
Improved Compression of Network Coding Vectors Using Erasure Decoding and List Decoding. IEEE Commun. Lett. 14(8): 749-751 (2010) - [j8]Naveen Kumar, Pranav Agarwal, Aditya Ramamoorthy, Murti V. Salapaka:
Maximum-likelihood sequence detector for dynamic mode high density probe storage. IEEE Trans. Commun. 58(6): 1686-1694 (2010) - [c22]Cuizhu Shi, Aditya Ramamoorthy:
Improved combinatorial algorithms for wireless information flow. Allerton 2010: 875-880 - [c21]Naveen Kumar, Aditya Ramamoorthy, Murti V. Salapaka:
Performance Evaluation for ML Sequence Detection in ISI Channels with Gauss Markov Noise. GLOBECOM 2010: 1-5 - [c20]Michael Langberg, Aditya Ramamoorthy:
Communicating the sum of sources in a 3-sources/3-terminals network; revisited. ISIT 2010: 1853-1857 - [i16]Aditya Ramamoorthy, Michael Langberg:
Communicating the sum of sources over a network. CoRR abs/1001.5319 (2010) - [i15]Shizheng Li, Aditya Ramamoorthy:
Improved compression of network coding vectors using erasure decoding and list decoding. CoRR abs/1006.0245 (2010) - [i14]Naveen Kumar, Aditya Ramamoorthy, Murti V. Salapaka:
Performance evaluation for ML sequence detection in ISI channels with Gauss Markov Noise. CoRR abs/1006.5036 (2010) - [i13]Cuizhu Shi, Aditya Ramamoorthy:
Improved Combinatorial Algorithms for Wireless Information Flow. CoRR abs/1010.1331 (2010) - [i12]Ahmed E. Kamal, Aditya Ramamoorthy, Long Long, Shizheng Li:
Overlay Protection Against Link Failures Using Network Coding. CoRR abs/1011.3550 (2010)
2000 – 2009
- 2009
- [j7]Cuizhu Shi, Aditya Ramamoorthy:
Design and analysis of E2RC codes. IEEE J. Sel. Areas Commun. 27(6): 889-898 (2009) - [j6]Jaehong Kim, Aditya Ramamoorthy, Steven W. McLaughlin:
The design of efficiently-encodable rate-compatible LDPC codes - [transactions papers]. IEEE Trans. Commun. 57(2): 365-375 (2009) - [j5]Shizheng Li, Aditya Ramamoorthy:
Rate and power allocation under the pairwise distributed source coding constraint. IEEE Trans. Commun. 57(12): 3771-3781 (2009) - [c19]Naveen Kumar, Pranav Agarwal, Aditya Ramamoorthy, Murti V. Salapaka:
Maximum-Likelihood Sequence Detector for Dynamic Mode High Density Probe Storage. GLOBECOM 2009: 1-6 - [c18]Cuizhu Shi, Aditya Ramamoorthy:
Design and Analysis of E2 RC Codes Using EXIT Chart. ICC 2009: 1-5 - [c17]Aditya Ramamoorthy, Vwani P. Roychowdhury, Sumit K. Singh:
Selfish Distributed Compression over Networks. INFOCOM 2009: 3011-3015 - [c16]Aditya Ramamoorthy, Shizheng Li:
Protection against link errors and failures using network coding in overlay networks. ISIT 2009: 986-990 - [c15]Michael Langberg, Aditya Ramamoorthy:
Communicating the sum of sources in a 3-sources/3-terminals network. ISIT 2009: 2121-2125 - [i11]Cuizhu Shi, Aditya Ramamoorthy:
Design and Analysis of E2RC Codes. CoRR abs/0903.2315 (2009) - [i10]Shizheng Li, Aditya Ramamoorthy:
Protection against link errors and failures using network coding in overlay networks. CoRR abs/0905.2248 (2009) - [i9]Naveen Kumar, Pranav Agarwal, Aditya Ramamoorthy, Murti V. Salapaka:
Maximum-Likelihood Sequence Detector for Dynamic Mode High Density Probe Storage. CoRR abs/0908.1789 (2009) - [i8]Aditya Ramamoorthy, Richard D. Wesel:
The Single Source Two Terminal Network with Network Coding. CoRR abs/0908.2847 (2009) - [i7]Cuizhu Shi, Aditya Ramamoorthy:
Fast Algorithm for Finding Unicast Capacity of Linear Deterministic Wireless Relay Networks. CoRR abs/0909.5507 (2009) - [i6]Shurui Huang, Aditya Ramamoorthy, Muriel Médard:
Minimum cost content distribution using network coding: Replication vs. coding at the source nodes. CoRR abs/0910.2263 (2009) - 2008
- [c14]Ahmed E. Kamal, Aditya Ramamoorthy:
Overlay protection against link failures using network coding. CISS 2008: 527-533 - [c13]Naveen Kumar, Pranav Agarwal, Aditya Ramamoorthy, Murti V. Salapaka:
Channel modeling and detector design for dynamic mode high density probe storage. CISS 2008: 1273-1278 - [c12]Cuizhu Shi, Aditya Ramamoorthy:
Protograph E2RC Codes. GLOBECOM 2008: 1117-1121 - [c11]Aditya Ramamoorthy:
Communicating the sum of sources over a network. ISIT 2008: 1646-1650 - [c10]Shizheng Li, Aditya Ramamoorthy:
Rate and power allocation under the pairwise distributed source coding constraint. ISIT 2008: 2312-2316 - [i5]Aditya Ramamoorthy, Vwani P. Roychowdhury, Sudhir Kumar Singh:
Distributed Compression with Selfish Terminals: Correlation Induces Anarchy. CoRR abs/0804.1840 (2008) - [i4]Aditya Ramamoorthy:
Communicating the sum of sources over a network. CoRR abs/0805.0051 (2008) - [i3]Shizheng Li, Aditya Ramamoorthy:
Rate and power allocation under the pairwise distributed source coding constraint. CoRR abs/0807.2292 (2008) - 2007
- [j4]Arun A. Somasundara, Aditya Ramamoorthy, Mani B. Srivastava:
Mobile Element Scheduling with Dynamic Deadlines. IEEE Trans. Mob. Comput. 6(4): 395-410 (2007) - [c9]Aditya Ramamoorthy, Nedeljko Varnica:
Error Floors of LDPC Coded BICM. ICC 2007: 839-844 - [c8]Aditya Ramamoorthy:
Minimum cost distributed source coding over a network. ISIT 2007: 1761-1765 - [i2]Aditya Ramamoorthy:
Minimum cost distributed source coding over a network. CoRR abs/0704.2808 (2007) - [i1]Jaehong Kim, Aditya Ramamoorthy, Steven W. McLaughlin:
The Design of Efficiently-Encodable Rate-Compatible LDPC Codes. CoRR abs/0705.0543 (2007) - 2006
- [j3]Aditya Ramamoorthy, Kamal Jain, Philip A. Chou, Michelle Effros:
Separating distributed source coding from network coding. IEEE Trans. Inf. Theory 52(6): 2785-2795 (2006) - [c7]Jaehong Kim, Aditya Ramamoorthy, Steven W. McLaughlin:
Design of Efficiently-Encodable Rate-Compatible Irregular LDPC Codes. ICC 2006: 1131-1136 - [c6]Jaehong Kim, Woonhaing Hur, Aditya Ramamoorthy, Steven W. McLaughlin:
Design of Rate-Compatible Irregular LDPC Codes for Incremental Redundancy Hybrid ARQ Systems. ISIT 2006: 1139-1143 - 2005
- [j2]Aditya Ramamoorthy, Jun Shi, Richard D. Wesel:
On the capacity of network coding for random networks. IEEE Trans. Inf. Theory 51(8): 2878-2885 (2005) - [c5]Aman Kansal, Aditya Ramamoorthy, Mani B. Srivastava, Gregory J. Pottie:
On sensor network lifetime and data distortion. ISIT 2005: 6-10 - 2004
- [c4]Aditya Ramamoorthy, Richard D. Wesel:
Construction of short block length irregular low-density parity-check codes. ICC 2004: 410-414 - [c3]Aditya Ramamoorthy, Richard D. Wesel:
Analysis of an algorithm for irregular LDPC code construction. ISIT 2004: 69 - [c2]Arun A. Somasundara, Aditya Ramamoorthy, Mani B. Srivastava:
Mobile Element Scheduling for Efficient Data Collection in Wireless Sensor Networks with Dynamic Deadlines. RTSS 2004: 296-305 - 2003
- [j1]Aditya Ramamoorthy, Namrata Vaswani, Santanu Chaudhury, Subhashis Banerjee:
Recognition of dynamic hand gestures. Pattern Recognit. 36(9): 2069-2081 (2003) - 2000
- [c1]Aditya Ramamoorthy, Sugata Ghosal:
An Integrated Segmentation Technique for Interactive Image Retrieval. ICIP 2000: 762-765
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-12-02 22:28 CET 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:
