Nandakishore Santhi

Learn More
— We consider the problem of estimating the probability of error in multi-hypothesis testing when MAP criterion is used. This probability, which is also known as the Bayes risk is an important measure in many communication and information theory problems. In general, the exact Bayes risk can be difficult to obtain. Many upper and lower bounds are known in(More)
We consider a list decoding algorithm recently proposed by Pellikaan-Wu [8] for q-ary Reed-Muller codes R M q(l, m, n) of length n les q<sup>m</sup> when I les q. A simple and easily accessible correctness proof is given which shows that this algorithm achieves a relative error-correction radius of taules (1 - radiclq<sup>m-1</sup> /n). This is an(More)
There are many examples of channels for which a combined coding and modulation scheme is needed to approach capacity. In some cases, it is desirable to employ codes which result in a graceful degradation of information rate with decreasing SNR[2, 3, 4]. It is also known that in some applications like Broadcast channels[1], it is impossible to achieve(More)
We introduce Simian, a family of open-source Parallel Discrete Event Simulation (PDES) engines written using Lua and Python. Simian reaps the benefits of interpreted languages-ease of use, fast development time, enhanced readability and a high degree of portability on different platforms-and, through the optional use of Just-In-Time (JIT) compilation,(More)
Interconnection network is a critical component of high-performance computing architecture and application co-design. For many scientific applications, the increasing communication complexity poses a serious concern as it may hinder the scaling properties of these applications on novel architectures. It is apparent that a scalable, efficient, and accurate(More)
We introduce La-pdes, a parameterized benchmark application for measuring parallel and serial discrete event simulation (PDES) performance. Applying a holistic view of PDES system performance, La-pdes tests the performance factors of (i) the (P)DES engine in terms of event queue efficiency, synchronization mechanism, and load-balancing schemes; (ii)(More)
The branching program is a fundamental model of (nonuniform) computation, which conveniently captures both time and space restrictions. Recently, an interesting connection between the minimum distance of a code and the branching program complexity of its encoder was established by Bazzi and Mitter. Here, we establish a relationship between the minimum(More)
Shape decomposition and reconstruction are vital factors in image processing and analysis applications. A generalized skeleton transform allows a shape to be represented as a collection of modestly overlapped octagonal shape parts. One of the main problems with the existing algorithms is that they generate noise after decomposition. For ordinary images the(More)