Skip to main content

26 Result(s)

within Priti Shankar Remove this filter

previous disabled Page of 2
and

  1. No Access

    Article

    Error correcting codes

    Linear algebraic codes are an elegant illustration of the power of Algebra. We introduce linear codes, and try to explain how the structure present in these codes permits easy implementation of encoding and de...

    Priti Shankar in Resonance (1996)

  2. No Access

    Article

    Error correcting codes

    In the first article of this series we showed how redundancy introduced into a message transmitted over a noisy channel could improve the reliability of transmission. In this article we describe one of the ear...

    Priti Shankar in Resonance (1997)

  3. No Access

    Article

    Error correcting codes

    Reed Solomon codes began as mathematical curiosities; today they are perhaps the most practical and widely used codes. This article describes the ingenious application of these codes to error correction in Com...

    Priti Shankar in Resonance (1997)

  4. No Access

    Article

    Book review

    K. Parthasarathy, Priti Shankar in Resonance (1997)

  5. No Access

    Chapter and Conference Paper

    Optimal Regular Tree Pattern Matching Using Pushdown Automata

    We propose a construction that augments the precomputation step of a regular tree pattern matching algorithm to include cost analysis. The matching device generated is a pushdown automaton in contrast with the...

    Maya Madhavan, Priti Shankar in Foundations of Software Technology and The… (1998)

  6. No Access

    Chapter and Conference Paper

    On the Many Faces of Block Codes

    Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder complexity. Necessary and sufficient c...

    Kaustubh Deshmukh, Priti Shankar, Amitava Dasgupta, B. Sundar Rajan in STACS 2000 (2000)

  7. No Access

    Chapter and Conference Paper

    Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct

    We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which the combinatorial representat...

    Priti Shankar, P.N.A. Kumar, Harmeet Singh… in Automata, Languages and Programming (2001)

  8. No Access

    Chapter and Conference Paper

    A Package for the Implementation of Block Codes as Finite Automata

    We have implemented a package that transforms concise algebraic descriptions of linear block codes into finite automata representations, and also generates decoders from such representations. The transformatio...

    Priti Shankar, K. Sasidharan, Vikas Aggarwal… in Implementation and Application of Automata (2001)

  9. No Access

    Article

    Claude Elwood Shannon

    Priti Shankar in Resonance (2002)

  10. No Access

    Article

    Madhu Sudan receives Nevanlinna Prize

    Meena Mahajan, Priti Shankar in Resonance (2002)

  11. No Access

    Article

    Florence Jessie Mac Williams (1917-1990)

    Priti Shankar in Resonance (2005)

  12. No Access

    Article

    Expander codes

    Expander graphs are graphs in which every set of vertices has an unusually large number of neighbours. It is a remarkable fact that graphs of this kind exist. Even more remarkable is the spectrum of applicatio...

    Priti Shankar in Resonance (2005)

  13. No Access

    Chapter and Conference Paper

    Integrating a New Cluster Assignment and Scheduling Algorithm into an Experimental Retargetable Code Generation Framework

    This paper presents a new unified algorithm for cluster assignment and region scheduling, and its integration into an experimental retargetable code generation framework. The components of the framework are an...

    K. Vasanta Lakshmi, Deepak Sreedhar… in High Performance Computing – HiPC 2005 (2005)

  14. No Access

    Article

    Robert W Floyd (1936–2001)

    Priti Shankar in Resonance (2005)

  15. No Access

    Article

    Editorial

    Priti Shankar in Resonance (2005)

  16. No Access

    Article

    Editorial

    Priti Shankar in Resonance (2005)

  17. No Access

    Article

    Editorial

    Priti Shankar in Resonance (2005)

  18. No Access

    Article

    Editorial

    Priti Shankar in Resonance (2005)

  19. No Access

    Chapter and Conference Paper

    Compressing XML Documents Using Recursive Finite State Automata

    We propose a scheme for automatically generating compressors for XML documents from Document Type Definition(DTD) specifications. Our algorithm is a lossless adaptive algorithm where the model used for compres...

    Hariharan Subramanian, Priti Shankar in Implementation and Application of Automata (2006)

  20. No Access

    Article

    David Huffman

    Priti Shankar in Resonance (2006)

previous disabled Page of 2