Bøger af Anuradha Sharma

Computer assisted drug design, discovery and delivery system (CADDD) has influential impact on the pharmaceutical and biotechnology industries. Pharmacists and bio-informaticians should synchronize their work to speed up the drug development process. In this book, authors would like to cover all the aspects regarding the concepts of drug design, discovery and delivery system using in silico techniques and guidelines covering the same. This book is intended to encourage and familiarize students in the field of pharmaceuticals and related health sciences with the concept of CADDD. This book comprises of all the aspects of CADDD techniques, which are supposed to be necessary for designing any drugs and delivering any formulations. Each chapter includes a detailed outline to help students see the structure and organization of the material. Equations and concepts are accurately presented, with a logical drug design, development and delivery system toward increasingly complex phenomena, such as multiple oral dosing and nonlinear pharmacokinetics. Examples, tables, ¿gures, and problem numbers are pre¿xed with their chapter numbers, facilitating instructor references to them.

In this book, explicit expressions of all thegenerating idempotents of irreducible cyclic codes oflength p^n and 2p^n over GF(q) are obtained, where pis an oddprime, p does not divide (q^f-1)/p if n > 1 and f isthe multiplicative order of q modulo p. Also thegenerating idempotents of all theirreducible cyclic codes of length 2^n over GF(q),where q is any odd prime power, are determined.It is also proved that the generating idempotents ofirreducible cyclic codes can be effectivelyevaluated, once they are known for irreducible cycliccodes of length prime power length. The weightdistributions of all the irreducible cyclic codes oflength 2^n are also obtained directly from theirgenerating polynomials. The necessary and sufficientconditions for the existence of cyclic polyadic codesof prime powerlength and of arbitrary length are obtained. The results on the existence of polyadiccodes, obtained by us, will enable one to constructpolyadic codes of varying lengths and dimensions.Many interesting examples of good codes arise fromthe family of polyadic codes.