Publications

We analyze the performance of top-down algorithms for decision tree learning, such as those employed by the widely used C4.5 and CART software packages.

Sufficient conditions are presented for the boundedness of the solutions of a vector nonlinear Volterra integral equation of the second kind that frequently arises in the study of automatic control

Spatially-Coupled LDPC (SC-LDPC) ensembles achieve the capacity of binary memoryless channels, asymptotically, under belief-propagation decoding.

The capacity of multiple input, multiple output (MIMO) wireless channels is computed for Ricean channels.

Cables are usually analyzed as if all of the components had a particular set of parameters (for example, nominal, worst case, and so on).

We take a capacity view of a number of different space-time coding (STC) schemes.

Communication systems transmitting over frequency-selective channels generally employ an equalizer to recover the transmitted sequence corrupted by intersymbol interference (ISI).

In this paper, we deal with the capacity behavior of a new scheme, information-guided channel-hopping, which is proposed for high information rate communication over Rayleigh fading channel using m

Outer and inner bounds are established on the capacity region of two-sender, two-receiver interference channels where one transmitter knows both messages.

An achievable region, outer bounds and a capacity result are established for two-sender two-receiver interference channels with one cognitive transmitter.