Pre-prints

Capacity-achieving codes for noisy channels

• J.H. Bae and A. Anastasopoulos, "Capacity-Achieving codes for channels with memory with maximum-likelihood decoding,'' ISIT, July 2009.
• J.H. Bae and A. Anastasopoulos, "Capacity-Achieving Codes for Finite-State Markov Channels with Maximum-Likelihood Decoding,'' IEEE JSAC, Aug. 2009.
• C-H. Hsu and A. Anastasopoulos, "Capacity-Achieving Codes for Noisy Channels with Bounded Graphical Complexity and Maximum Likelihood Decoding,'' IEEE Trans. Information Theory, aug. 2009 (accepted).
• C-H. Hsu and A. Anastasopoulos, "Capacity-Achieving LDPC Codes through Puncturing,'' IEEE Trans. Information Theory, Oct. 2008.

Error-exponents for multi-user channels

• A. Nazari, S. Pradhan, and A. Anastasopoulos "New Bounds on the Maximal Error Exponent for Multiple-Access Channels,'' ISIT, July 2009 (student paper award).
• A. Nazari, A. Anastasopoulos, and S. Pradhan "A New Universal Random-Coding Bound for Average Probability Error Exponent for Multiple-Access Channels,'' CISS, March 2009.
• A. Nazari, S. Pradhan, and A. Anastasopoulos "A new lower bound on the maximal error probability for discrete memoryless multiple-access channels,'' ISIT, Jul. 2008.
• L. Weng, S. Pradhan, and A. Anastasopoulos "Error Exponent Regions for Gaussian Broadcast and Multiple Access Channels,'' IEEE Transactions on Information Theory, Jul., 2008.

Communications and Control

• A. Anastasopoulos, "A sequential transmission sceme for the multiple access channel with noiseless feedback,'' Allerton, Septemeber 2009.
• A. Anastasopoulos, "Energy-delay tradeoff in multiple access channels,'' ISIT, July 2009 (rejected).
• A. Anastasopoulos, "Delay-optimal hybrid ARQ protocol design for channels and receivers with memory as a stochastic control problem,'' ICC, May 2008.
• S.-Y. Chang, W. E. Stark and A. Anastasopoulos, "Energy-Delay Analysis of MAC Protocols in Wireless Networks,'' IEEE Trans. Wireless Communications, Aug. 2008.

Analysis and design of LDPC codes

• K. Fu and A. Anastasopoulos "Stopping Set Enumerator Approximations for Finite-Length Protograph LDPC Codes,'' ISIT, Jul. 2007.

Polynomial-complexity optimal receivers

• I. Motedayen, A. Krishnamoorthy and A. Anastasopoulos, "Optimal Joint Detection/Estimation in Fading Channels with Polynomial Complexity,'' IEEE Trans. Information Theory, vol. 53, no. 1, pp. 209 - 223, Jan. 2007.