Andrew Thangaraj

According to our database1, Andrew Thangaraj authored at least 77 papers between 2001 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Dual Capacity Upper Bounds for Binary-Input Single-Tap ISI Channels.
IEEE Trans. Communications, 2019

Subpacketization in Coded Caching with Demand Privacy.
CoRR, 2019

Conditions for Optimality of Superposition Coding in Discrete Memoryless Broadcast Channels.
Proceedings of the National Conference on Communications, 2019

Improved Tail Bounds for Missing Mass and Confidence Intervals for Good-Turing Estimator.
Proceedings of the National Conference on Communications, 2019

Convergence of Chao Unseen Species Estimator.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Concentration and Tail Bounds for Missing Mass.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Protograph LDPC Codes With Block Thresholds: Extension to Degree-One and Generalized Nodes.
IEEE Trans. Communications, 2018

Block-error Threshold Analysis of Protographs in 5G-Standard.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Wiretap Polar Codes in Encryption Schemes Based on Learning with Errors Problem.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Dual Capacity Upper Bounds for Binary-input ISI and Constrained BIBO Channels.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Capacity Bounds for Discrete-Time, Amplitude-Constrained, Additive White Gaussian Noise Channels.
IEEE Trans. Information Theory, 2017

Dual Capacity Upper Bounds for Noisy Runlength Constrained Channels.
IEEE Trans. Information Theory, 2017

High SNR Error Analysis for Bidirectional Relaying With Physical Layer Network Coding.
IEEE Trans. Communications, 2017

Protograph LDPC Codes with Block Thresholds: Extension to Degree-1 and Generalized Nodes.
CoRR, 2017

Irregular Recovery and Unequal Locality for Locally Recoverable Codes with Availability.
CoRR, 2017

Unequal locality and recovery for Locally Recoverable Codes with availability.
Proceedings of the Twenty-third National Conference on Communications, 2017

Minimax risk for missing mass estimation.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Combinatorial Resource Allocation Using Submodularity of Waterfilling.
IEEE Trans. Wireless Communications, 2016

Construction of Near-Capacity Protograph LDPC Code Sequences With Block-Error Thresholds.
IEEE Trans. Communications, 2016

Lower bounds and optimal protocols for three-party secure computation.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Near-capacity protograph doubly-generalized LDPC codes with block thresholds.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Dirty paper coding versus beamforming in multi-user MIMO under OFDM.
Proceedings of the 50th Asilomar Conference on Signals, Systems and Computers, 2016

2015
Secure Compute-and-Forward in a Bidirectional Relay.
IEEE Trans. Information Theory, 2015

LDPC Codes for Network-Coded Bidirectional Relaying With Higher Order Modulation.
IEEE Trans. Communications, 2015

Error-Control Coding for Physical-Layer Secrecy.
Proceedings of the IEEE, 2015

Equalization in amplify-forward full-duplex relay with direct link.
Proceedings of the Twenty First National Conference on Communications, 2015

Threshold upper bounds and optimized design of protograph LDPC codes for the Binary Erasure Channel.
Proceedings of the Seventh International Workshop on Signal Design and its Applications in Communications, 2015

Capacity upper bounds for discrete-time amplitude-constrained AWGN channels.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Approximation of capacity for ISI channels with one-bit output quantization.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Online Algorithms for Basestation Allocation.
IEEE Trans. Wireless Communications, 2014

Robustness of Physical Layer Security Primitives Against Attacks on Pseudorandom Generators.
IEEE Trans. Communications, 2014

Sub-Modularity of Waterfilling with Applications to Online Basestation Allocation.
CoRR, 2014

Node-splitting constructions for large girth irregular and protograph LDPC codes.
Proceedings of the Twentieth National Conference on Communications, 2014

Optimized codes for bidirectional relaying.
Proceedings of the Twentieth National Conference on Communications, 2014

Coding for wiretap channels: Channel resolvability and semantic security.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

2013
Quasi-cyclic regenerating codes for distributed storage: Existence and near-MSR examples.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Deterministic constructions for large girth protograph LDPC codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

The Gaussian two-way diamond channel.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
The Treewidth of MDS and Reed-Muller Codes.
IEEE Trans. Information Theory, 2012

A Decode and Forward Protocol for Two-Stage Gaussian Relay Networks.
IEEE Trans. Communications, 2012

Block Modulation for Interference Management in Heterogeneous Wireless Networks.
J. Sel. Topics Signal Processing, 2012

Special issue on physical-layer security.
Journal of Communications and Networks, 2012

Secure Compute-and-Forward in a Bidirectional Relay
CoRR, 2012

Codes on planar Tanner graphs.
Adv. in Math. of Comm., 2012

Secure computation in a bidirectional relay.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Outer bounds for the capacity region of a Gaussian two-way relay channel.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth LDPC Codes.
IEEE Trans. Information Forensics and Security, 2011

Quasicyclic MDS codes for distributed storage with efficient exact repair.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Known plaintext attack on the binary symmetric wiretap channel.
Proceedings of the Workshops Proceedings of the Global Communications Conference, 2011

Processing interference at the physical layer to enhance information flow in wireless networks.
Proceedings of the Third International Conference on Communication Systems and Networks, 2011

2010
Path gain algebraic formulation for the scalar linear network coding problem.
IEEE Trans. Information Theory, 2010

Multistage Relaying Using Interference Networks
CoRR, 2010

Strong secrecy for erasure wiretap channels.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Dirty paper coding using sign-bit shaping and LDPC codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

NLHB: A non-linear Hopper-Blum protocol.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Codes on Planar Graphs
CoRR, 2009

Algebraic network coding: A new perspective.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Reed-Solomon Subcodes with Nontrivial Traces: Distance Properties and Soft-Decision Decoding
CoRR, 2008

A Simple Algebraic Formulation for the Scalar Linear Network Coding Problem
CoRR, 2008

Confidential messages to a cooperative relay.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

Optimizing burst erasure correction of LDPC codes by interleaving.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Computation of secrecy capacity for more-capable channel pairs.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Thresholds for LDPC codes over OFDM.
Proceedings of the Third International Conference on COMmunication System softWAre and MiddlewaRE (COMSWARE 2008), 2008

2007
Applications of LDPC Codes to the Wiretap Channel.
IEEE Trans. Information Theory, 2007

Self-Orthogonality of q-Ary Images of qm-Ary Codes and Quantum Code Construction.
IEEE Trans. Information Theory, 2007

Rate-Compatible Punctured Systematic Repeat-Accumulate Codes.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2007

Constellation Shaping using LDPC Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Self-orthogonality of Images and Traces of Codes with Applications to Quantum Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Subcodes of Reed-Solomon Codes Suitable for Soft Decoding.
Proceedings of the Applied Algebra, 2007

2006
LDPC-based Gaussian key reconciliation.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Simple MAP Decoding of Binary Cyclic Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

LDPC-based secret key agreement over the Gaussian wiretap channel.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Efficient Reconciliation of Correlated Continuous Random Variables using LDPC Codes
CoRR, 2005

A low-complexity soft-decision decoder for extended BCH and RS-like codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

On achieving capacity on the wire tap channel using LDPC codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
Capacity Achieving Codes for the Wire Tap Channel with Applications to Quantum Key Distribution
CoRR, 2004

2001
Quantum codes from cyclic codes over GF(4m).
IEEE Trans. Information Theory, 2001


  Loading...