- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j40 |      | Frédérique Bassino, Julien Clément, Gadiel Seroussi, Alfredo Viola: Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables. IEEE Transactions on Information Theory 59(4): 2375-2395 (2013) |
| 2012 | ||
| j39 | | Alvaro Martín, Gadiel Seroussi, Marcelo J. Weinberger: Type Classes of Context Trees. IEEE Transactions on Information Theory 58(7): 4077-4093 (2012) |
| j38 | | Gadiel Seroussi, Wojciech Szpankowski, Marcelo J. Weinberger: Deinterleaving Finite Memory Processes Via Penalized Maximum Likelihood. IEEE Transactions on Information Theory 58(12): 7094-7109 (2012) |
| c20 | | Erik Ordentlich, Ron M. Roth, Gadiel Seroussi: On q-ary antipodal matchings and applications. ISIT 2012: 111-115 |
| c19 | | Luciana Vitale, Alvaro Martín, Gadiel Seroussi: Bounds on estimated Markov orders of individual sequences. ISIT 2012: 1102-1106 |
| 2011 | ||
| j37 | | Giovanni Motta, Erik Ordentlich, Ignacio Ramírez, Gadiel Seroussi, Marcelo J. Weinberger: The iDUDE Framework for Grayscale Image Denoising. IEEE Transactions on Image Processing 20(1): 1-21 (2011) |
| c18 | | Gadiel Seroussi, Wojciech Szpankowski, Marcelo J. Weinberger: Deinterleaving Markov processes: The finite-memory switch case. ISIT 2011: 298-302 |
| i4 | | Frédérique Bassino, Julien Clément, Gadiel Seroussi, Alfredo Viola: Optimal prefix codes for pairs of geometrically-distributed random variables. CoRR abs/1102.2413 (2011) |
| i3 | | Gadiel Seroussi, Wojciech Szpankowski, Marcelo J. Weinberger: Deinterleaving Finite Memory Processes via Penalized Maximum Likelihood. CoRR abs/1108.5212 (2011) |
| 2010 | ||
| j36 | | Alvaro Martín, Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger: Twice-universal simulation of Markov sources and individual sequences. IEEE Transactions on Information Theory 56(9): 4245-4255 (2010) |
| 2009 | ||
| c17 | | Gadiel Seroussi, Marcelo J. Weinberger, Wojciech Szpankowski: Deinterleaving Markov processes via penalized ML. ISIT 2009: 1739-1743 |
| 2008 | ||
| j35 | | Philippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski: On the entropy of a hidden Markov process. Theor. Comput. Sci. 395(2-3): 203-219 (2008) |
| j34 | | Erik Ordentlich, Gadiel Seroussi, Sergio Verdú, Krishnamurthy Viswanathan: Universal Algorithms for Channel Decoding of Uncompressed Sources. IEEE Transactions on Information Theory 54(5): 2243-2262 (2008) |
| j33 | | Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger: Universal Delay-Limited Simulation. IEEE Transactions on Information Theory 54(12): 5525-5533 (2008) |
| c16 | | Alvaro Martín, Gadiel Seroussi, Marcelo J. Weinberger: Enumerative coding for tree sources. ISIT 2008: 2459-2463 |
| 2007 | ||
| j32 | | Ron M. Roth, Gadiel Seroussi: Bounds for Binary Codes With Narrow Distance Distributions. IEEE Transactions on Information Theory 53(8): 2760-2768 (2007) |
| 2006 | ||
| j31 | | Gadiel Seroussi: On the Number of t-Ary Trees with a Given Path Length. Algorithmica 46(3-4): 557-565 (2006) |
| j30 | | |
| c15 | | Frédérique Bassino, Julien Clément, Gadiel Seroussi, Alfredo Viola: Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions. DCC 2006: 113-122 |
| 2005 | ||
| j29 | | Alvaro Martín, Guillermo Sapiro, Gadiel Seroussi: Is image steganography natural? IEEE Transactions on Image Processing 14(12): 2040-2050 (2005) |
| j28 | | Tsachy Weissman, Erik Ordentlich, Gadiel Seroussi, Sergio Verdú, Marcelo J. Weinberger: Universal discrete denoising: known channel. IEEE Transactions on Information Theory 51(1): 5-28 (2005) |
| j27 | | Ron M. Roth, Gadiel Seroussi: Symbol-intersecting codes. IEEE Transactions on Information Theory 51(7): 2266-2281 (2005) |
| c14 | | Gadiel Seroussi, Giovanni Motta, Erik Ordentlich, Ignacio Ramírez, Marcelo J. Weinberger: The DUDE framework for continuous tone image denoising. ICIP (3) 2005: 345-348 |
| i2 | | |
| i1 | | |
| 2004 | ||
| j26 | | Alvaro Martín, Gadiel Seroussi, Marcelo J. Weinberger: Linear time universal coding and time reversal of tree sources via FSM closure. IEEE Transactions on Information Theory 50(7): 1442-1468 (2004) |
| c13 | | Philippe Jacquet, Gadiel Seroussi, Wojciech Szpankowski: On the Entropy of a Hidden Markov Process. Data Compression Conference 2004: 362-371 |
| c12 | | Alvaro Martín, Gadiel Seroussi, Marcelo J. Weinberger: Linear Time Universal Coding of Tree Sources via FSM Closure. Data Compression Conference 2004: 372-381 |
| c11 | | |
| 2003 | ||
| c10 | | Erik Ordentlich, Gadiel Seroussi, Sergio Verdú, Marcelo J. Weinberger, Tsachy Weissman: A discrete universal denoiser and its application to binary images. ICIP (1) 2003: 117-120 |
| 2002 | ||
| j25 | | David Taubman, Erik Ordentlich, Marcelo J. Weinberger, Gadiel Seroussi: Embedded block coding in JPEG 2000. Sig. Proc.: Image Comm. 17(1): 49-72 (2002) |
| j24 | | Neri Merhav, Erik Ordentlich, Gadiel Seroussi, Marcelo J. Weinberger: On sequential strategies for loss functions with memory. IEEE Transactions on Information Theory 48(7): 1947-1958 (2002) |
| 2001 | ||
| c9 | | Florian Hess, Gadiel Seroussi, Nigel P. Smart: Two Topics in Hyperelliptic Cryptography. Selected Areas in Cryptography 2001: 181-189 |
| 2000 | ||
| j23 | | Marcelo J. Weinberger, Gadiel Seroussi, Guillermo Sapiro: The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS. IEEE Transactions on Image Processing 9(8): 1309-1324 (2000) |
| j22 | | Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger: Optimal prefix codes for sources with two-sided geometric distributions. IEEE Transactions on Information Theory 46(1): 121-135 (2000) |
| j21 | | Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger: Coding of sources with two-sided geometric distributions and unknown parameters. IEEE Transactions on Information Theory 46(1): 229-236 (2000) |
| c8 | | Marcelo J. Weinberger, Gadiel Seroussi, Ikuro Ueno, Fumitaka Ono: Embedded Block Coding in JPEG 2000. ICIP 2000: 33-36 |
| 1999 | ||
| c7 | | Erik Ordentlich, David Taubman, Marcelo J. Weinberger, Gadiel Seroussi, Michael W. Marcellin: Memory Efficient Scalable Line-based Image Coding. Data Compression Conference 1999: 218-227 |
| c6 | | Marcelo J. Weinberger, Gadiel Seroussi, Guillermo Sapiro: From LOCO-I to the JPEG-LS Standard. ICIP (4) 1999: 68-72 |
| 1998 | ||
| j20 | | Ron M. Roth, Gadiel Seroussi: Reduced-Redundancy Product Codes for Burst Error Correction. IEEE Transactions on Information Theory 44(4): 1395-1406 (1998) |
| c5 | | Erik Ordentlich, Marcelo J. Weinberger, Gadiel Seroussi: A Low-Complexity Modeling Approach for Embedded Coding of Wavelet Coefficients. Data Compression Conference 1998: 408-417 |
| 1997 | ||
| j19 | | Marcelo J. Weinberger, Gadiel Seroussi: Sequential prediction and ranking in universal context modeling and data compression. IEEE Transactions on Information Theory 43(5): 1697-1706 (1997) |
| c4 | | Gadiel Seroussi, Marcelo J. Weinberger: On Adaptive Strategies for an Extended Family of Golomb-type Codes. Data Compression Conference 1997: 131-140 |
| 1996 | ||
| j18 | | Ron M. Roth, Gadiel Seroussi: Location-correcting codes. IEEE Transactions on Information Theory 42(2): 554-565 (1996) |
| c3 | | Marcelo J. Weinberger, Gadiel Seroussi, Guillermo Sapiro: Loco-I: A Low Complexity, Context-Based, Lossless Image Compression Algorithm. Data Compression Conference 1996: 140-149 |
| c2 | | Neri Merhav, Gadiel Seroussi, Marcelo J. Weinberger: Modeling and low-complexity adaptive coding for image prediction residuals. ICIP (2) 1996: 353-356 |
| 1993 | ||
| c1 | | Abraham Lempel, Gadiel Seroussi: Application of Finte Fields to Memory Interleaving. AAECC 1993: 244-256 |
| 1992 | ||
| j17 | | Abraham Lempel, Gadiel Seroussi: Systematic derivation of spline bases. Computer Aided Geometric Design 9(5): 349-363 (1992) |
| 1991 | ||
| j16 | | Joachim von zur Gathen, Gadiel Seroussi: Boolean Circuits Versus Arithmetic Circuits. Inf. Comput. 91(1): 142-154 (1991) |
| j15 | | Gadiel Seroussi: A systolic Reed-Solomon encoder. IEEE Transactions on Information Theory 37(4): 1217-1220 (1991) |
| j14 | | Abraham Lempel, Gadiel Seroussi: Explicit formulas for self-complementary normal bases in certain finite fields. IEEE Transactions on Information Theory 37(4): 1220-1222 (1991) |
| 1990 | ||
| j13 | | Nader H. Bshouty, Gadiel Seroussi: Generalizations of the Normal Basis Theorem of Finite Fields. SIAM J. Discrete Math. 3(3): 330-337 (1990) |
| 1988 | ||
| j12 | | Gadiel Seroussi, Nader H. Bshouty: Vector sets for exhaustive testing of logic circuits. IEEE Transactions on Information Theory 34(3): 513-522 (1988) |
| j11 | | Ron M. Roth, Gadiel Seroussi: Encoding and decoding of BCH codes using light and short codewords. IEEE Transactions on Information Theory 34(3): 593-596 (1988) |
| 1986 | ||
| j10 | | Ron M. Roth, Gadiel Seroussi: On cyclic MDS codes of length q over GF(q). IEEE Transactions on Information Theory 32(2): 284-285 (1986) |
| j9 | | Gadiel Seroussi, Ron M. Roth: On MDS extensions of generalized Reed-Solomon codes. IEEE Transactions on Information Theory 32(3): 349-354 (1986) |
| 1985 | ||
| j8 | | Ron M. Roth, Gadiel Seroussi: On generator matrices of MDS codes. IEEE Transactions on Information Theory 31(6): 826-830 (1985) |
| 1984 | ||
| j7 | | Gadiel Seroussi, Abraham Lempel: On Symmetric Algorithms for Bilinear Forms over Finite Fields. J. Algorithms 5(3): 327-344 (1984) |
| j6 | | Don Coppersmith, Gadiel Seroussi: On the minimum distance of some quadratic residue codes. IEEE Transactions on Information Theory 30(2): 407-411 (1984) |
| 1983 | ||
| j5 | | Gadiel Seroussi, Fai Ma: On the Arithmetic Complexity of Matrix Kronecker Powers. Inf. Process. Lett. 17(3): 145-148 (1983) |
| j4 | | Abraham Lempel, Gadiel Seroussi, Shmuel Winograd: On the Complexity of Multiplication in Finite Fields. Theor. Comput. Sci. 22: 285-296 (1983) |
| j3 | | Gadiel Seroussi, Abraham Lempel: Maximum likelihood decoding of certain Reed - Muller codes. IEEE Transactions on Information Theory 29(3): 448-450 (1983) |
| 1982 | ||
| j2 | | Abraham Lempel, Gadiel Seroussi, Jacob Ziv: On the power of straight- line computations in finite fields. IEEE Transactions on Information Theory 28(6): 875-879 (1982) |
| 1980 | ||
| j1 | | Gadiel Seroussi, Abraham Lempel: Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields. SIAM J. Comput. 9(4): 758-767 (1980) |
Colors in the list of coauthors
Last update Thu May 23 11:31:55 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page