{"id":12998,"date":"2017-04-10T09:36:39","date_gmt":"2017-04-10T13:36:39","guid":{"rendered":"http:\/\/www.bu.edu\/csmet\/?post_type=profile&p=12998"},"modified":"2019-09-11T10:25:42","modified_gmt":"2019-09-11T14:25:42","slug":"madani-naidjate","status":"publish","type":"profile","link":"https:\/\/www.bu.edu\/csmet\/profile\/madani-naidjate\/","title":{"rendered":"Madani Naidjate"},"content":{"rendered":"

Madani Naidjate received his MS and Ph.D. in Applied Mathematics from Boston University and has been a lecturer at BU MET and School of Engineering since Fall 1988 teaching several Mathematics and Theoretical Computer Science courses. Since 2011, Madani has been a Full Professor of Mathematics and the director of the Berenson Center for Mathematics at Dean College. He taught a wide variety of courses, ranging from calculus, statistics, probability, linear algebra, multivariable calculus, Boolean algebra, discrete mathematics, algorithm analysis, theory of computation, etc. Madani has extensive teaching experience and an enthusiastic teacher. His style is based on direct interactions with students. His research focuses in the field of coding theory, developing efficient algorithms for telecommunication systems, namely minimum distance decoding and in computation theory.<\/p>\n

Dr. Naidjate research interests are in the fields of Coding Theory, Fault-Tolerant Computing and Algorithm Design and Analysis, and Mathematical Modeling for Communication Systems. His research focused on an improved version of the Zero-Neighbors algorithm.<\/p>\n

Dr. Naidjate was the Teaching Excellence Award recipient in 2015.<\/p>\n

Publications<\/h3>
\n
    \n
  • Naidjate, W. Allen \u201cCDF \u2013 Computational Power Enhancing Student Learning<\/em>\u201d Wolfram Technology Conference, 2015, Champagne Illinois<\/li>\n
  • S. Galadanci, M. Naidjate, “Test Generation Complexity for Sequential Circuits, Effect of Cycles”<\/em>, Doctorate Thesis, Boston University, Fall 1994.<\/li>\n
  • B. Levitin, M. Naidjate and C. R. Hartmann, “Generalized MDD Algorithm for Group Codes in Metric Spaces<\/em>” Proceedings of 1990 IEEE International Symposium on Information Theory, San Diego, CA. 1990.<\/li>\n
  • Naidjate, “Some Perfect Seeds for MDS Codes using Hadamard Matrices”<\/em>, International Workshop on Fault Detection and Spectral Techniques, Boston, MA. 1984.<\/li>\n
  • B. Levitin, M. Naidjate, “On Group Codes in Euclidean Spaces – A Decoding Procedure”<\/em>, submitted for publication to IEEE Transaction on Information Theory.<\/li>\n<\/ul>\n

    <\/div>\n<\/div>\n<\/span><\/p>\n

    Research Interests<\/h3>
    \n
      \n
    • Discrete Mathematics and Coding Theory<\/span><\/li>\n
    • Fault-Tolerant Computing and Algorithm Design and Analysis<\/span><\/li>\n
    • Mathematical Modeling for Communication Systems<\/span><\/li>\n
    • Investment Strategies <\/div>\n<\/div>\n<\/span><\/li>\n<\/ul>\n","protected":false},"author":13337,"template":"","_links":{"self":[{"href":"https:\/\/www.bu.edu\/csmet\/wp-json\/wp\/v2\/profile\/12998"}],"collection":[{"href":"https:\/\/www.bu.edu\/csmet\/wp-json\/wp\/v2\/profile"}],"about":[{"href":"https:\/\/www.bu.edu\/csmet\/wp-json\/wp\/v2\/types\/profile"}],"author":[{"embeddable":true,"href":"https:\/\/www.bu.edu\/csmet\/wp-json\/wp\/v2\/users\/13337"}],"version-history":[{"count":6,"href":"https:\/\/www.bu.edu\/csmet\/wp-json\/wp\/v2\/profile\/12998\/revisions"}],"predecessor-version":[{"id":22552,"href":"https:\/\/www.bu.edu\/csmet\/wp-json\/wp\/v2\/profile\/12998\/revisions\/22552"}],"wp:attachment":[{"href":"https:\/\/www.bu.edu\/csmet\/wp-json\/wp\/v2\/media?parent=12998"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}