| 2008 |
|---|
| 50 | EE | Neri Merhav,
Gadiel Seroussi,
Marcelo J. Weinberger:
Universal Delay-Limited Simulation.
IEEE Transactions on Information Theory 54(12): 5525-5533 (2008) |
| 49 | EE | 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) |
| 48 | EE | Philippe Jacquet,
Gadiel Seroussi,
Wojciech Szpankowski:
On the entropy of a hidden Markov process.
Theor. Comput. Sci. 395(2-3): 203-219 (2008) |
| 2007 |
|---|
| 47 | EE | Ron M. Roth,
Gadiel Seroussi:
Bounds for Binary Codes With Narrow Distance Distributions.
IEEE Transactions on Information Theory 53(8): 2760-2768 (2007) |
| 2006 |
|---|
| 46 | EE | 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 |
| 45 | EE | Gadiel Seroussi:
On the Number of t-Ary Trees with a Given Path Length.
Algorithmica 46(3-4): 557-565 (2006) |
| 44 | EE | Gadiel Seroussi:
On universal types.
IEEE Transactions on Information Theory 52(1): 171-189 (2006) |
| 2005 |
|---|
| 43 | EE | Gadiel Seroussi,
Giovanni Motta,
Erik Ordentlich,
Ignacio Ramirez,
Marcelo J. Weinberger:
The DUDE framework for continuous tone image denoising.
ICIP (3) 2005: 345-348 |
| 42 | EE | Hendrik W. Lenstra Jr.,
Gadiel Seroussi:
On Hats and other Covers
CoRR abs/cs/0509045: (2005) |
| 41 | EE | Gadiel Seroussi:
On the number of t-ary trees with a given path length
CoRR abs/cs/0509046: (2005) |
| 40 | EE | Alvaro Martín,
Guillermo Sapiro,
Gadiel Seroussi:
Is image steganography natural?
IEEE Transactions on Image Processing 14(12): 2040-2050 (2005) |
| 39 | EE | 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) |
| 38 | EE | Ron M. Roth,
Gadiel Seroussi:
Symbol-intersecting codes.
IEEE Transactions on Information Theory 51(7): 2266-2281 (2005) |
| 2004 |
|---|
| 37 | EE | Philippe Jacquet,
Gadiel Seroussi,
Wojciech Szpankowski:
On the Entropy of a Hidden Markov Process.
Data Compression Conference 2004: 362-371 |
| 36 | EE | Alvaro Martín,
Gadiel Seroussi,
Marcelo J. Weinberger:
Linear Time Universal Coding of Tree Sources via FSM Closure.
Data Compression Conference 2004: 372-381 |
| 35 | EE | Gadiel Seroussi:
Universal Types and Simulation of Individual Sequences.
LATIN 2004: 312-321 |
| 34 | | 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) |
| 2003 |
|---|
| 33 | | 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 |
|---|
| 32 | | 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 |
|---|
| 31 | EE | Florian Hess,
Gadiel Seroussi,
Nigel P. Smart:
Two Topics in Hyperelliptic Cryptography.
Selected Areas in Cryptography 2001: 181-189 |
| 2000 |
|---|
| 30 | | Marcelo J. Weinberger,
Gadiel Seroussi,
Ikuro Ueno,
Fumitaka Ono:
Embedded Block Coding in JPEG 2000.
ICIP 2000 |
| 29 | EE | 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) |
| 28 | | 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) |
| 27 | | 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) |
| 1999 |
|---|
| 26 | EE | 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 |
| 25 | | Marcelo J. Weinberger,
Gadiel Seroussi,
Guillermo Sapiro:
From LOCO-I to the JPEG-LS Standard.
ICIP (4) 1999: 68-72 |
| 1998 |
|---|
| 24 | EE | Erik Ordentlich,
Marcelo J. Weinberger,
Gadiel Seroussi:
A Low-Complexity Modeling Approach for Embedded Coding of Wavelet Coefficients.
Data Compression Conference 1998: 408-417 |
| 23 | | Ron M. Roth,
Gadiel Seroussi:
Reduced-Redundancy Product Codes for Burst Error Correction.
IEEE Transactions on Information Theory 44(4): 1395-1406 (1998) |
| 1997 |
|---|
| 22 | | Gadiel Seroussi,
Marcelo J. Weinberger:
On Adaptive Strategies for an Extended Family of Golomb-type Codes.
Data Compression Conference 1997: 131-140 |
| 21 | | 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) |
| 1996 |
|---|
| 20 | | Marcelo J. Weinberger,
Gadiel Seroussi,
Guillermo Sapiro:
Loco-I: A Low Complexity, Context-Based, Lossless Image Compression Algorithm.
Data Compression Conference 1996: 140-149 |
| 19 | | Ron M. Roth,
Gadiel Seroussi:
Location-correcting codes.
IEEE Transactions on Information Theory 42(2): 554-565 (1996) |
| 1993 |
|---|
| 18 | | Abraham Lempel,
Gadiel Seroussi:
Application of Finte Fields to Memory Interleaving.
AAECC 1993: 244-256 |
| 1992 |
|---|
| 17 | EE | Abraham Lempel,
Gadiel Seroussi:
Systematic derivation of spline bases.
Computer Aided Geometric Design 9(5): 349-363 (1992) |
| 1991 |
|---|
| 16 | | Gadiel Seroussi:
A systolic Reed-Solomon encoder.
IEEE Transactions on Information Theory 37(4): 1217- (1991) |
| 15 | | Abraham Lempel,
Gadiel Seroussi:
Explicit formulas for self-complementary normal bases in certain finite fields.
IEEE Transactions on Information Theory 37(4): 1220- (1991) |
| 14 | | Joachim von zur Gathen,
Gadiel Seroussi:
Boolean Circuits Versus Arithmetic Circuits
Inf. Comput. 91(1): 142-154 (1991) |
| 1990 |
|---|
| 13 | | Nader H. Bshouty,
Gadiel Seroussi:
Generalizations of the Normal Basis Theorem of Finite Fields.
SIAM J. Discrete Math. 3(3): 330-337 (1990) |
| 1988 |
|---|
| 12 | | Gadiel Seroussi,
Nader H. Bshouty:
Vector sets for exhaustive testing of logic circuits.
IEEE Transactions on Information Theory 34(3): 513-522 (1988) |
| 11 | | Ron M. Roth,
Gadiel Seroussi:
Encoding and decoding of BCH codes using light and short codewords.
IEEE Transactions on Information Theory 34(3): 593- (1988) |
| 1986 |
|---|
| 10 | | Ron M. Roth,
Gadiel Seroussi:
On cyclic MDS codes of length q over GF(q).
IEEE Transactions on Information Theory 32(2): 284- (1986) |
| 9 | | Gadiel Seroussi,
Ron M. Roth:
On MDS extensions of generalized Reed-Solomon codes.
IEEE Transactions on Information Theory 32(3): 349-354 (1986) |
| 1985 |
|---|
| 8 | | Ron M. Roth,
Gadiel Seroussi:
On generator matrices of MDS codes.
IEEE Transactions on Information Theory 31(6): 826- (1985) |
| 1984 |
|---|
| 7 | | Don Coppersmith,
Gadiel Seroussi:
On the minimum distance of some quadratic residue codes.
IEEE Transactions on Information Theory 30(2): 407- (1984) |
| 6 | | Gadiel Seroussi,
Abraham Lempel:
On Symmetric Algorithms for Bilinear Forms over Finite Fields.
J. Algorithms 5(3): 327-344 (1984) |
| 1983 |
|---|
| 5 | | Gadiel Seroussi,
Abraham Lempel:
Maximum likelihood decoding of certain Reed - Muller codes.
IEEE Transactions on Information Theory 29(3): 448- (1983) |
| 4 | | Gadiel Seroussi,
Fai Ma:
On the Arithmetic Complexity of Matrix Kronecker Powers.
Inf. Process. Lett. 17(3): 145-148 (1983) |
| 3 | | Abraham Lempel,
Gadiel Seroussi,
Shmuel Winograd:
On the Complexity of Multiplication in Finite Fields.
Theor. Comput. Sci. 22: 285-296 (1983) |
| 1982 |
|---|
| 2 | | 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 |
|---|
| 1 | | Gadiel Seroussi,
Abraham Lempel:
Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields.
SIAM J. Comput. 9(4): 758-767 (1980) |
