Gadiel Seroussi

Guillermo Dufort y Álvarez

IEEE Access, 2024

The Lattice-Input Discrete-Time Poisson Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

2021

RENANO: a REference-based compressor for NANOpore FASTQ files.

[BibT_eX]

[DOI]

Bioinform., 2021

2020

ENANO: Encoder for NANOpore FASTQ files.

[BibT_eX]

[DOI]

Guillermo Dufort y Álvarez

Bioinform., 2020

2019

Asymptotically Tight Bounds on the Depth of Estimated Context Trees.

[BibT_eX]

[DOI]

Guillermo Dufort y Álvarez

Luciana Vitale

IEEE Trans. Inf. Theory, 2019

Compression of Nanopore FASTQ Files.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics and Biomedical Engineering, 2019

2018

Wireless EEG System Achieving High Throughput and Reduced Energy Consumption Through Lossless and Near-Lossless Compression.

[BibT_eX]

[DOI]

IEEE Trans. Biomed. Circuits Syst., 2018

2017

Efficient Sequential Compression of Multichannel Biomedical Signals.

[BibT_eX]

[DOI]

IEEE J. Biomed. Health Informatics, 2017

2016

Efficient sequential compression of multi-channel biomedical signals.

[BibT_eX]

[DOI]

CoRR, 2016

Asymptotically tight bounds on the depth of estimated context trees.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Wearable EEG via lossless compression.

[BibT_eX]

[DOI]

Proceedings of the 38th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2016

2015

Optimal Algorithms for Universal Random Number Generation From Finite Memory Sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Space-efficient representation of truncated suffix trees, with applications to Markov order estimation.

[BibT_eX]

[DOI]

Luciana Vitale

Theor. Comput. Sci., 2015

EEG Signal Pre-Processing for the P300 Speller.

[BibT_eX]

[DOI]

Proceedings of the Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 2015

2014

Universal Enumerative Coding for Tree Models.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Low-complexity, multi-channel, lossless and near-lossless EEG compression.

[BibT_eX]

[DOI]

Proceedings of the 22nd European Signal Processing Conference, 2014

2013

Optimal Prefix Codes for Pairs of Geometrically Distributed Random Variables.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Universal variable to fixed-length random number generators for finite memory sources.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Twice-universal fixed to variable-length random number generators for finite memory sources.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Deinterleaving Finite Memory Processes Via Penalized Maximum Likelihood.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Type Classes of Context Trees.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Bounds on estimated Markov orders of individual sequences.

[BibT_eX]

[DOI]

Luciana Vitale

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

On q-ary antipodal matchings and applications.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

The iDUDE Framework for Grayscale Image Denoising.

[BibT_eX]

[DOI]

IEEE Trans. Image Process., 2011

Deinterleaving Markov processes: The finite-memory switch case.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

Twice-universal simulation of Markov sources and individual sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

2009

Deinterleaving Markov processes via penalized ML.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Universal Algorithms for Channel Decoding of Uncompressed Sources.

[BibT_eX]

[DOI]

Krishnamurthy Viswanathan

Sergio Verdú

IEEE Trans. Inf. Theory, 2008

Universal Delay-Limited Simulation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

On the entropy of a hidden Markov process.

[BibT_eX]

[DOI]

Philippe Jacquet

Theor. Comput. Sci., 2008

Enumerative coding for tree sources.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE Information Theory Workshop, 2008

2007

Bounds for Binary Codes With Narrow Distance Distributions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Type Classes of Tree Models.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Noisy Constrained Capacity.

[BibT_eX]

[DOI]

Philippe Jacquet

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

On universal types.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

On the Number of t-Ary Trees with a Given Path Length.

[BibT_eX]

[DOI]

Algorithmica, 2006

Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions.

[BibT_eX]

[DOI]

Proceedings of the 2006 Data Compression Conference (DCC 2006), 2006

2005

Universal discrete denoising: known channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Symbol-intersecting codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Is image steganography natural?

[BibT_eX]

[DOI]

IEEE Trans. Image Process., 2005

On Hats and other Covers

[BibT_eX]

[DOI]

Hendrik W. Lenstra Jr.

CoRR, 2005

On the second moment of the distance distribution of binary codes.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

The DUDE framework for continuous tone image denoising.

[BibT_eX]

[DOI]

Proceedings of the 2005 International Conference on Image Processing, 2005

2004

Linear time universal coding and time reversal of tree sources via FSM closure.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Universal Types and Simulation of Individual Sequences.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Cross-symbol codes.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Channel decoding of systematically encoded unknown redundant sources.

[BibT_eX]

[DOI]

Krishnamurthy Viswanathan

Sergio Verdú

Tsachy Weissman

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Linear Time Universal Coding of Tree Sources via FSM Closure.

[BibT_eX]

[DOI]

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003

A discrete universal denoiser and its application to binary images.

[BibT_eX]

[DOI]

Sergio Verdú

Tsachy Weissman

Proceedings of the 2003 International Conference on Image Processing, 2003

2002

On sequential strategies for loss functions with memory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Embedded block coding in JPEG 2000.

[BibT_eX]

[DOI]

David Taubman

Signal Process. Image Commun., 2002

Universal discrete denoising.

[BibT_eX]

[DOI]

Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2001

Two Topics in Hyperelliptic Cryptography.

[BibT_eX]

[DOI]

Florian Hess

Nigel P. Smart

Proceedings of the Selected Areas in Cryptography, 8th Annual International Workshop, 2001

2000

Coding of sources with two-sided geometric distributions and unknown parameters.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Optimal prefix codes for sources with two-sided geometric distributions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

The LOCO-I lossless image compression algorithm: principles and standardization into JPEG-LS.

[BibT_eX]

[DOI]

IEEE Trans. Image Process., 2000

Lossless compression of continuous-tone images.

[BibT_eX]

[DOI]

Bruno Carpentieri

Proc. IEEE, 2000

Embedded Block Coding in JPEG 2000.

[BibT_eX]

[DOI]

Ikuro Ueno

Fumitaka Ono

Proceedings of the 2000 International Conference on Image Processing, 2000

1999

From LOCO-I to the JPEG-LS Standard.

[BibT_eX]

[DOI]

Proceedings of the 1999 International Conference on Image Processing, 1999

Memory Efficient Scalable Line-based Image Coding.

[BibT_eX]

[DOI]

David Taubman

Michael W. Marcellin

Proceedings of the Data Compression Conference, 1999

1998

Reduced-Redundancy Product Codes for Burst Error Correction.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

A Low-Complexity Modeling Approach for Embedded Coding of Wavelet Coefficients.

[BibT_eX]

[DOI]

Proceedings of the Data Compression Conference, 1998

1997

Sequential prediction and ranking in universal context modeling and data compression.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

On Adaptive Strategies for an Extended Family of Golomb-type Codes.

[BibT_eX]

[DOI]

Proceedings of the 7th Data Compression Conference (DCC '97), 1997

1996

Location-correcting codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

Modeling and low-complexity adaptive coding for image prediction residuals.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 1996 International Conference on Image Processing, 1996

Loco-I: A Low Complexity, Context-Based, Lossless Image Compression Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996

1993

Application of Finte Fields to Memory Interleaving.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1993

1992

Systematic derivation of spline bases.

[BibT_eX]

[DOI]

Comput. Aided Geom. Des., 1992

1991

Boolean Circuits Versus Arithmetic Circuits

[BibT_eX]

[DOI]

Joachim von zur Gathen

Inf. Comput., March, 1991

A systolic Reed-Solomon encoder.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

Explicit formulas for self-complementary normal bases in certain finite fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

1990

Generalizations of the Normal Basis Theorem of Finite Fields.

[BibT_eX]

[DOI]

Nader H. Bshouty

SIAM J. Discret. Math., 1990

1988

Vector sets for exhaustive testing of logic circuits.

[BibT_eX]

[DOI]

Nader H. Bshouty

IEEE Trans. Inf. Theory, 1988

Encoding and decoding of BCH codes using light and short codewords.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1988

1986

On MDS extensions of generalized Reed-Solomon codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1986

On cyclic MDS codes of length q over GF(q).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1986

1985

On generator matrices of MDS codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1985

1984

On the minimum distance of some quadratic residue codes.

[BibT_eX]

[DOI]

Don Coppersmith

IEEE Trans. Inf. Theory, 1984

On Symmetric Algorithms for Bilinear Forms over Finite Fields.

[BibT_eX]

[DOI]

J. Algorithms, 1984

1983

Maximum likelihood decoding of certain Reed - Muller codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1983

On the Complexity of Multiplication in Finite Fields.

[BibT_eX]

[DOI]

Shmuel Winograd

Theor. Comput. Sci., 1983

On the Arithmetic Complexity of Matrix Kronecker Powers.

[BibT_eX]

[DOI]

Fai Ma

Inf. Process. Lett., 1983

1982

On the power of straight- line computations in finite fields.

[BibT_eX]

[DOI]

Jacob Ziv

IEEE Trans. Inf. Theory, 1982

1980

Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields.

[BibT_eX]

[DOI]