Search Results - "Rao, T N R"

Refine Results
  1. 1

    An SFS Berger check prediction ALU and its application to self-checking processor designs by Lo, J.-C., Thanawastien, S., Rao, T.R.N., Nicolaidis, M.

    “…A strongly fault secure (SFS) ALU design based on the Berger check prediction (BCP) technique is presented. The fault and error models of a large class of VLSI…”
    Get full text
    Journal Article
  2. 2

    Decoding algebraic-geometric codes up to the designed minimum distance by Feng, G.-L., Rao, T.R.N.

    Published in IEEE transactions on information theory (01-01-1993)
    “…A simple decoding procedure for algebraic-geometric codes C/sub Omega /(D,G) is presented. This decoding procedure is a generalization of Peterson's decoding…”
    Get full text
    Journal Article
  3. 3

    Construction of Improved Geometric Goppa Codes from Klein Curves and Klein-like Curves by Kolluru, Mahadev S., Feng, G. L., Rao, T. R. N.

    “…Linear error-correcting codes, especially Reed-Solomon codes, find applications in communication and computer memory systems, to enhance their reliability and…”
    Get full text
    Journal Article
  4. 4

    Private-key algebraic-code encryptions by Rao, T.R.N., Nam, K.-H.

    Published in IEEE transactions on information theory (01-07-1989)
    “…An approach to private-key cryptosystems is proposed which allows use of very simple codes of distance <or=6 and length of 250 bits or less. This scheme not…”
    Get full text
    Journal Article
  5. 5

    Efficient mapping of ANNs on hypercube massively parallel machines by Malluhi, Q.M., Bayoumi, M.A., Rao, T.R.N.

    Published in IEEE transactions on computers (01-06-1995)
    “…This paper presents a technique for mapping artificial neural networks (ANNs) on hypercube massively parallel machines. The paper starts by synthesizing a…”
    Get full text
    Journal Article
  6. 6

    Novel totally self-checking Berger code checker designs based on generalized Berger code partitioning by Rao, T.R.N., Feng, G.L., Kolluru, M.S., Lo, J.C.

    Published in IEEE transactions on computers (01-08-1993)
    “…Totally self-checking (TSC) Berger code checker designs are presented. The generalized Berger check partitioning is derived. It is proven that a TSC Berger…”
    Get full text
    Journal Article
  7. 7

    A generalization of the single b-Bit byte error correcting and double bit error detecting codes for high-speed memory systems by Sihai Xiao, Xiaofa Shi, Guiliang Feng, Rao, T.R.N.

    Published in IEEE transactions on computers (01-04-1996)
    “…In this paper, a general method using the subsets (generating sets) of GF(2/sup b/) for constructing the SbEC-DED codes will be presented. The constructions…”
    Get full text
    Journal Article
  8. 8

    Berger check prediction for array multipliers and array dividers by Lo, J.-C., Thanawastien, S., Rao, T.R.N.

    Published in IEEE transactions on computers (01-07-1993)
    “…The authors present closed-form check-predicting equations for deriving Berger checks (J.M. Berger, 1961) for array multipliers and array dividers,…”
    Get full text
    Journal Article
  9. 9

    Firewalling the Big Fish by Rao, T N R

    Published in Economic and political weekly (06-08-2016)
    Get full text
    Journal Article Magazine Article
  10. 10

    Improved geometric Goppa codes--Part I: Basic theory by Feng, Gui-Liang, Rao, T R N

    Published in IEEE transactions on information theory (01-11-1995)
    “…Feng and Rao present a construction of improved geometric Gopp codes which, for the case of r is less than 2 g, are often more efficient than the current…”
    Get full text
    Journal Article
  11. 11

    Aryabhata remainder theorem : Relevance to public-key crypto-algorithms by RAO, T. R. N, YANG, Chung-Huang

    Published in Circuits, systems, and signal processing (01-02-2006)
    “…Public-key crypto-algorithms are widely employed for authentication, signatures, secret-key generation and access control. The new range of public-key sizes…”
    Get full text
    Journal Article
  12. 12

    A simple approach for construction of algebraic-geometric codes from affine plane curves by Gui-Liang Feng, Rao, T.R.N.

    Published in IEEE transactions on information theory (01-07-1994)
    “…The current algebraic-geometric (AG) codes are based on the theory of algebraic-geometric curves. In this paper we present a simple approach for the…”
    Get full text
    Journal Article
  13. 13

    Pseudorandom bit generators in stream-cipher cryptography by Zeng, K., Yang, C.-H., Wei, D.-Y., Rao, T.R.N.

    Published in Computer (Long Beach, Calif.) (01-02-1991)
    “…Progress in the design and analysis of pseudorandom bit generators over the last decade is surveyed. Background information is provided, and the linear…”
    Get full text
    Journal Article
  14. 14

    New double-byte error-correcting codes for memory systems by Gui-Liang Feng, Xinwen Wu, Rao, T.R.N.

    Published in IEEE transactions on information theory (01-05-1998)
    “…Double-byte error-correcting codes over GF(q) were constructed by Dumer (1981, 1988, 1992, 1995), which have the parameters n=q/sup m-1/, r/spl les/2m+[m-1/3],…”
    Get full text
    Journal Article
  15. 15

    Simplified understanding and efficient decoding of a class of algebraic-geometric codes by Gui-Liang Feng, Wei, V.K., Rao, T.R.N., Tzeng, K.K.

    Published in IEEE transactions on information theory (01-07-1994)
    “…An efficient decoding algorithm for algebraic-geometric codes is presented. For codes from a large class of irreducible plane curves, including Hermitian…”
    Get full text
    Journal Article
  16. 16

    Improved geometric Goppa codes. I. Basic theory by Gui-Liang Feng, Rao, T.R.N.

    Published in IEEE transactions on information theory (01-11-1995)
    “…In this paper, we present a construction of improved geometric Goppa codes which, for the case of r<2g, are often more efficient than the current geometric…”
    Get full text
    Journal Article
  17. 17

    Generalized Bezout's theorem and its applications in coding theory by Gui-Liang Feng, Rao, T.R.N., Berg, G.A., Zhunmei Zhu

    Published in IEEE transactions on information theory (01-11-1997)
    “…This paper presents a generalized Bezout theorem which can be used to determine a tighter lower bound of the number of distinct points of intersection of two…”
    Get full text
    Journal Article
  18. 18

    Error correcting codes over Z/2(m/) for algorithm-based fault tolerance by Feng, G L, Rao, T R N, Kolluru, M S

    Published in IEEE transactions on computers (01-03-1994)
    “…Algorithm-based fault tolerance is a scheme of low-cost error protection in real-time digital signal processing environments and other computation-intensive…”
    Get full text
    Journal Article
  19. 19

    Error correction codes over Z sub(2m) for algorithms-based fault tolerance by Feng, G L, Rao, T R N, Kolluru, M S

    Published in IEEE transactions on computers (01-01-1994)
    “…Algorithm-based fault tolerance is a scheme of low-cost error protection in real-time digital signal processing environments and other computation-intensive…”
    Get full text
    Journal Article
  20. 20