In this monograph, we develop a mathematical framework based on asymptotically good
random structured codes, ie, codes possessing algebraic properties, for network information …

Among the emerging trends in the wireless industry, the Internet of Things (IoT) and machine-
to-machine (M2M) communications are notable examples that prompt power efficient …

The problem of computing sum of sources over a multiple access channel (MAC) is
considered. Building on the technique of linear computation coding (LCC) proposed by …

We prove that the ensemble of the nested coset codes built on finite fields achieves the
capacity of arbitrary discrete memoryless point-to-point channels. Exploiting its algebraic …

Motivated by the growing application of wireless multi-access networks with stringent delay
constraints, we investigate the Gaussian multiple access channel (MAC) in the finite …

Recently there has been significant interest in the analysis of finite-blocklength performance
in different settings. Specifically, there is an effort to extend the performance bounds, as well …

We consider the problem of distributed binary hypothesis testing of two sequences that are
generated by an iid doubly-binary symmetric source. Each sequence is observed by a …

Upper bounds on the error probability in channel coding are considered, improving the RCU
bound by taking into account events, where the likelihood of the correct codeword is tied …

The problem of bounding the reliability function of a multiple access channel (MAC) is
studied. Two new upper bounds on the error exponent of a two-user discrete memoryless …

Exponential error bounds achievable by universal coding and decoding are derived for
frame-asynchronous discrete memoryless multiple access channels with two senders, via …