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 RM q (, m, n) of length n ≤ q m when ≤ q. A simple and easily accessible correctness proof is given which shows that this algorithm achieves a relative error-correction radius of τ ≤ 1 − q m−1 /n. This is an improvement over the proof using one-point(More)
— We consider a list decoding algorithm recently proposed by Pellikaan-Wu [4] for q-ary Reed-Muller codes RM q (, m, n) of length n ≤ q m when ≤ q. A simple and easily accessible correctness proof is given which shows that this algorithm achieves a relative error-correction radius of τ ≤ 1 − q m−1 /n. This is an improvement over the proof using one-point(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)
Cyber-infractions into a nation's strategic security envelope pose a constant and daunting challenge. We present the modular CyberSim tool which has been developed in response to the need to realistically simulate at a national level, software vulnerabilities and resulting malware propagation in online social networks. CyberSim suite (a) can generate(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)
We develop a general method for proving lower bounds on the complexity of branching programs. The proposed proof technique is based on a connection between branching programs and error-correcting codes and makes use of certain classical results in coding theory. Specifically, lower bounds on the complexity of branching programs computing certain important(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)