The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gadiel Seroussi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Abraham Lempel, Gadiel Seroussi
    Application of Finte Fields to Memory Interleaving. [Citation Graph (0, 0)][DBLP]
    AAECC, 1993, pp:244-256 [Conf]
  2. Frédérique Bassino, Julien Clément, Gadiel Seroussi, Alfredo Viola
    Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions. [Citation Graph (0, 0)][DBLP]
    DCC, 2006, pp:113-122 [Conf]
  3. Philippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski
    On the Entropy of a Hidden Markov Process. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2004, pp:362-371 [Conf]
  4. Alvaro Martín, Gadiel Seroussi, Marcelo J. Weinberger
    Linear Time Universal Coding of Tree Sources via FSM Closure. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2004, pp:372-381 [Conf]
  5. Erik Ordentlich, David Taubman, Marcelo J. Weinberger, Gadiel Seroussi, Michael W. Marcellin
    Memory Efficient Scalable Line-based Image Coding. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1999, pp:218-227 [Conf]
  6. Erik Ordentlich, Marcelo J. Weinberger, Gadiel Seroussi
    A Low-Complexity Modeling Approach for Embedded Coding of Wavelet Coefficients. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1998, pp:408-417 [Conf]
  7. Gadiel Seroussi, Marcelo J. Weinberger
    On Adaptive Strategies for an Extended Family of Golomb-type Codes. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1997, pp:131-140 [Conf]
  8. Marcelo J. Weinberger, Gadiel Seroussi, Guillermo Sapiro
    Loco-I: A Low Complexity, Context-Based, Lossless Image Compression Algorithm. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1996, pp:140-149 [Conf]
  9. Erik Ordentlich, Gadiel Seroussi, Sergio Verdú, Marcelo J. Weinberger, Tsachy Weissman
    A discrete universal denoiser and its application to binary images. [Citation Graph (0, 0)][DBLP]
    ICIP (1), 2003, pp:117-120 [Conf]
  10. Marcelo J. Weinberger, Gadiel Seroussi, Guillermo Sapiro
    From LOCO-I to the JPEG-LS Standard. [Citation Graph (0, 0)][DBLP]
    ICIP (4), 1999, pp:68-72 [Conf]
  11. Marcelo J. Weinberger, Gadiel Seroussi, Ikuro Ueno, Fumitaka Ono
    Embedded Block Coding in JPEG 2000. [Citation Graph (0, 0)][DBLP]
    ICIP, 2000, pp:- [Conf]
  12. Gadiel Seroussi, Giovanni Motta, Erik Ordentlich, Ignacio Ramirez, Marcelo J. Weinberger
    The DUDE framework for continuous tone image denoising. [Citation Graph (0, 0)][DBLP]
    ICIP (3), 2005, pp:345-348 [Conf]
  13. Gadiel Seroussi
    Universal Types and Simulation of Individual Sequences. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:312-321 [Conf]
  14. Florian Hess, Gadiel Seroussi, Nigel P. Smart
    Two Topics in Hyperelliptic Cryptography. [Citation Graph (0, 0)][DBLP]
    Selected Areas in Cryptography, 2001, pp:181-189 [Conf]
  15. Abraham Lempel, Gadiel Seroussi
    Systematic derivation of spline bases. [Citation Graph (0, 0)][DBLP]
    Computer Aided Geometric Design, 1992, v:9, n:5, pp:349-363 [Journal]
  16. Joachim von zur Gathen, Gadiel Seroussi
    Boolean Circuits Versus Arithmetic Circuits [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:91, n:1, pp:142-154 [Journal]
  17. Gadiel Seroussi, Fai Ma
    On the Arithmetic Complexity of Matrix Kronecker Powers. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1983, v:17, n:3, pp:145-148 [Journal]
  18. Gadiel Seroussi, Abraham Lempel
    On Symmetric Algorithms for Bilinear Forms over Finite Fields. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:3, pp:327-344 [Journal]
  19. Gadiel Seroussi, Abraham Lempel
    Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:4, pp:758-767 [Journal]
  20. Nader H. Bshouty, Gadiel Seroussi
    Generalizations of the Normal Basis Theorem of Finite Fields. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:3, pp:330-337 [Journal]
  21. Abraham Lempel, Gadiel Seroussi, Shmuel Winograd
    On the Complexity of Multiplication in Finite Fields. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:22, n:, pp:285-296 [Journal]
  22. Alvaro Martín, Guillermo Sapiro, Gadiel Seroussi
    Is image steganography natural? [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Image Processing, 2005, v:14, n:12, pp:2040-2050 [Journal]
  23. Marcelo J. Weinberger, Gadiel Seroussi, Guillermo Sapiro
    The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Image Processing, 2000, v:9, n:8, pp:1309-1324 [Journal]
  24. Don Coppersmith, Gadiel Seroussi
    On the minimum distance of some quadratic residue codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:2, pp:407-0 [Journal]
  25. Abraham Lempel, Gadiel Seroussi
    Explicit formulas for self-complementary normal bases in certain finite fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:4, pp:1220-0 [Journal]
  26. Abraham Lempel, Gadiel Seroussi, Jacob Ziv
    On the power of straight- line computations in finite fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1982, v:28, n:6, pp:875-879 [Journal]
  27. Alvaro Martín, Gadiel Seroussi, Marcelo J. Weinberger
    Linear time universal coding and time reversal of tree sources via FSM closure. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:7, pp:1442-1468 [Journal]
  28. Neri Merhav, Erik Ordentlich, Gadiel Seroussi, Marcelo J. Weinberger
    On sequential strategies for loss functions with memory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:7, pp:1947-1958 [Journal]
  29. Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger
    Optimal prefix codes for sources with two-sided geometric distributions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:1, pp:121-135 [Journal]
  30. Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger
    Coding of sources with two-sided geometric distributions and unknown parameters. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:1, pp:229-236 [Journal]
  31. Ron M. Roth, Gadiel Seroussi
    Symbol-intersecting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:7, pp:2266-2281 [Journal]
  32. Ron M. Roth, Gadiel Seroussi
    On generator matrices of MDS codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:6, pp:826-0 [Journal]
  33. Ron M. Roth, Gadiel Seroussi
    On cyclic MDS codes of length q over GF(q). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:2, pp:284-0 [Journal]
  34. Ron M. Roth, Gadiel Seroussi
    Encoding and decoding of BCH codes using light and short codewords. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:3, pp:593-0 [Journal]
  35. Ron M. Roth, Gadiel Seroussi
    Location-correcting codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:2, pp:554-565 [Journal]
  36. Ron M. Roth, Gadiel Seroussi
    Reduced-Redundancy Product Codes for Burst Error Correction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:4, pp:1395-1406 [Journal]
  37. Gadiel Seroussi
    On universal types. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:1, pp:171-189 [Journal]
  38. Gadiel Seroussi
    A systolic Reed-Solomon encoder. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:4, pp:1217-0 [Journal]
  39. Gadiel Seroussi, Nader H. Bshouty
    Vector sets for exhaustive testing of logic circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:3, pp:513-522 [Journal]
  40. Gadiel Seroussi, Abraham Lempel
    Maximum likelihood decoding of certain Reed - Muller codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:448-0 [Journal]
  41. Gadiel Seroussi, Ron M. Roth
    On MDS extensions of generalized Reed-Solomon codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:3, pp:349-354 [Journal]
  42. Marcelo J. Weinberger, Gadiel Seroussi
    Sequential prediction and ranking in universal context modeling and data compression. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:5, pp:1697-1706 [Journal]
  43. Tsachy Weissman, Erik Ordentlich, Gadiel Seroussi, Sergio Verdú, Marcelo J. Weinberger
    Universal discrete denoising: known channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:5-28 [Journal]
  44. Gadiel Seroussi
    On the Number of t-Ary Trees with a Given Path Length. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:3-4, pp:557-565 [Journal]

  45. On Hats and other Covers [Citation Graph (, )][DBLP]


  46. On the number of t-ary trees with a given path length [Citation Graph (, )][DBLP]


Search in 0.060secs, Finished in 0.061secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002