Indra M. Chakravarti

        Education

          B.Sc. (1948), M.Sc. (1950), Ph.D. (1958), Calcutta University.

        Faculty Positions

          UNC-Chapel Hill (1959-60, 61-62, 1964 -); Case Institute of Technology (1960-61); University of Geneva, Switzerland (1961-1964); Indian Statistical Institute (1951-59).

        Honors

          Fellow, IMS; Member, ISI. Médaille des Sociétés de Statistique de Paris et de France.

        Research Interests

          The mainstream of Chakravarti's research is on combinatorial, statistical and computational problems that arise in design theory, structure and analysis of designed experiments with proper randomization, nearest neighbor models and other models of dependence and optimal designs, and on problems of error-free and secure communication in information and coding theory. Design theory and coding theory share much in common - many designs coexist with certain codes and often the mathematics (group theory, algebra, finite geometry, number theory and algebraic geometry) used in both theories are similar.

          There is a demand for innovative research in design theory because high-tech systems and industries require efficient designs for experiments for quality products at low cost and for empirical modeling of complex systems by simulation. This also applies to the needs of medical and pharmaceutical research for designs for clinical trials and procedures. In coding theory, for example: efficient codes and successful implementation of such coding and decoding procedures are needed for sophisticated complex multi-access communication systems.

          This shared interest in multiple disciplines is the key to a vast pool of exciting and challenging research problems which call for combinatorial, statistical and computational research skills for their solution.



        Selected Publications

          Block designs for first and second order neighbor correlations (with J.P. Morgan), Annals of Statistics, 16 (1988), 1206-1224.

          Geometric construction of some families of two-class and three-class association schemes and codes from nondegenerate and degenerate Hermitian varieties, Discrete Mathematics , 111 (1993), 95-103.

          Families of codes with few distinct weights from singular and nonsingular Hermitian varieties and quadrics in projective geometries and Hadamard difference sets and designs associated with two-weight codes, in Coding Theory and Design Theory, Part I Coding Theory (D. Ray-Chaudhuri, ed.), Institute of Mathematics and its Applications, Vol. 20 (1990), 35-50.

        Back to Faculty Directory

        To Stat Home Page