Meir Feder

IEEE Trans. Inf. Theory, August, 2024

Deep Individual Active Learning: Safeguarding against Out-of-Distribution Challenges in Neural Networks.

[BibT_eX]

[DOI]

Entropy, February, 2024

Universal Batch Learning Under The Misspecification Setting.

[BibT_eX]

[DOI]

Shlomi Vituri

Proceedings of the IEEE International Symposium on Information Theory, 2024

Error Exponent in Agnostic PAC Learning.

[BibT_eX]

[DOI]

Adi Hendel

Proceedings of the IEEE International Symposium on Information Theory, 2024

Combining Batch and Online Prediction.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

One Shot Joint Source Channel Coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Batches Stabilize the Minimum Norm Risk in High Dimensional Overparameterized Linear Regression.

[BibT_eX]

[DOI]

CoRR, 2023

Permutation Invariant Individual Batch Learning.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2023

2022

Editorial Modern Compression.

[BibT_eX]

[DOI]

Tsachy Weissman

IEEE J. Sel. Areas Inf. Theory, December, 2022

Beyond Ridge Regression for Distribution-Free Data.

[BibT_eX]

[DOI]

CoRR, 2022

On Information-Theoretic Determination of Misspecified Rates of Convergence.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

On Multiple and Hierarchical Universality.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Another Look at Universal Individual Learning.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Active Learning for Individual Data via Minimal Stochastic Complexity.

[BibT_eX]

[DOI]

Proceedings of the 58th Annual Allerton Conference on Communication, 2022

2021

Optimal Sampling of a Bandlimited Noisy Multiple Output Channel.

[BibT_eX]

[DOI]

Gaston Solodky

IEEE Trans. Signal Process., 2021

Universal Active Learning via Conditional Mutual Information Minimization.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2021

Robust Universal Inference.

[BibT_eX]

[DOI]

Entropy, 2021

Utilizing Adversarial Targeted Attacks to Boost Adversarial Robustness.

[BibT_eX]

[DOI]

Uriya Pesso

CoRR, 2021

The Predictive Normalized Maximum Likelihood for Over-parameterized Linear Regression with Norm Constraint: Regret and Double Descent.

[BibT_eX]

[DOI]

CoRR, 2021

Single Layer Predictive Normalized Maximum Likelihood for Out-of-Distribution Detection.

[BibT_eX]

[DOI]

Tal Hassner

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Sequential prediction under log-loss and misspecification.

[BibT_eX]

[DOI]

Yury Polyanskiy

Proceedings of the Conference on Learning Theory, 2021

2020

k-Vectors: An Alternating Minimization Algorithm for Learning Regression Functions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Innovation Representation of Stochastic Processes With Application to Causal Inference.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Nonlinear Canonical Correlation Analysis: A Compressed Representation Approach.

[BibT_eX]

[DOI]

Naftali Tishby

Entropy, 2020

Efficient Data-Dependent Learnability.

[BibT_eX]

[DOI]

Tal Shapira

CoRR, 2020

Can Implicit Bias Explain Generalization? Stochastic Convex Optimization as a Case Study.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

One shot approach to lossy source coding under average distortion constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Deep pNML: Predictive Normalized Maximum Likelihood for Deep Neural Networks.

[BibT_eX]

[DOI]

CoRR, 2019

Minimax Active Learning Via Minimal Model Capacity.

[BibT_eX]

[DOI]

Proceedings of the 29th IEEE International Workshop on Machine Learning for Signal Processing, 2019

Universal Learning of Individual Data.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

A New Look at an Old Problem: A Universal Learning Approach to Linear Regression.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Linear Independent Component Analysis Over Finite Fields: Algorithms and Bounds.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2018

Universal Supervised Learning for Individual Data.

[BibT_eX]

[DOI]

CoRR, 2018

An Information-Theoretic Framework for Non-linear Canonical Correlation Analysis.

[BibT_eX]

[DOI]

Naftali Tishby

CoRR, 2018

Redundancy Capacity Theorem for On-Line Learning Under a Certain Form of Hypotheses Class.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

Universal Batch Learning with Log-Loss.

[BibT_eX]

[DOI]

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

Sampling a Noisy Multiple Output Channel to Maximize the Capacity.

[BibT_eX]

[DOI]

Gaston Solodky

Proceedings of the 26th European Signal Processing Conference, 2018

2017

Large Alphabet Source Coding Using Independent Component Analysis.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Equalization Methods for NLIN Mitigation.

[BibT_eX]

[DOI]

Ori Golani

CoRR, 2017

Kalman-MLSE equalization of nonlinear noise.

[BibT_eX]

[DOI]

Ori Golani

Proceedings of the Optical Fiber Communications Conference and Exhibition, 2017

Spatially coupled LDLC: New constructions.

[BibT_eX]

[DOI]

Svetlana Reznikov

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

On the problem of on-line learning with log-loss.

[BibT_eX]

[DOI]

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

On the calculation of the minimax-converse of the channel coding problem.

[BibT_eX]

[DOI]

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

2016

A Simple Proof for the Optimality of Randomized Posterior Matching.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Generalized Independent Component Analysis Over Finite Alphabets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Collaboration in Multiple Access Channels Requires Synchronization.

[BibT_eX]

[DOI]

Uri Mendlovic

IEEE Trans. Inf. Theory, 2016

The Random Coding Bound Is Tight for the Average Linear Code or Lattice.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Non-Random Coding Error Bounds for Lattices.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Variational formulas for the power of the binary hypothesis testing problem with applications.

[BibT_eX]

[DOI]

CoRR, 2016

Correlations and phase noise in NLIN-modelling and system implications.

[BibT_eX]

[DOI]

Proceedings of the Optical Fiber Communications Conference and Exhibition, 2016

Inter-channel nonlinear interference noise in fully loaded WDM systems.

[BibT_eX]

[DOI]

Proceedings of the Optical Fiber Communications Conference and Exhibition, 2016

Binary independent component analysis: Theory, bounds and algorithms.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Workshop on Machine Learning for Signal Processing, 2016

A Simple and Efficient Approach for Adaptive Entropy Coding over Large Alphabets.

[BibT_eX]

[DOI]

Proceedings of the 2016 Data Compression Conference, 2016

2015

On the Diversity-Multiplexing Tradeoff of Unconstrained Multiple-Access Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

On the calculation of the meta-converse.

[BibT_eX]

[DOI]

CoRR, 2015

The dynamics of inter-channel nonlinear distortions in fiber-transmission systems.

[BibT_eX]

[DOI]

Proceedings of the Optical Fiber Communications Conference and Exhibition, 2015

Achievable and converse bounds over a general channel and general decoding metric.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Nonlinear phase and polarization rotation noise in fully loaded WDM systems.

[BibT_eX]

[DOI]

Proceedings of the European Conference on Optical Communication, 2015

Universal Compression of Memoryless Sources over Large Alphabets via Independent Component Analysis.

[BibT_eX]

[DOI]

Proceedings of the 2015 Data Compression Conference, 2015

2014

Fundamental Limits of Infinite Constellations in MIMO Fading Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Delay and Redundancy in Lossless Source Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Universal Communication - Part II: Channels With Memory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Finite-Memory Prediction as Well as the Empirical Mean.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Time varying ISI model for nonlinear interference noise.

[BibT_eX]

[DOI]

Proceedings of the Optical Fiber Communications Conference and Exhibition, 2014

On the diversity-multiplexing tradeoff of unconstrained MIMO fading channels.

[BibT_eX]

[DOI]

Proceedings of the 2014 Information Theory and Applications Workshop, 2014

Generalized binary independent component analysis.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Collaboration gain in MAC is limited.

[BibT_eX]

[DOI]

Uri Mendlovic

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Source broadcasting to the masses: Separation has a bounded loss.

[BibT_eX]

[DOI]

Uri Mendlovic

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

A universal decoder relative to a given family of metrics.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Information spectrum approach to the source channel separation theorem.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On shaping gain in the nonlinear fiber-optic channel.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Nonlinear interference noise in fibre-optic communications.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Transparent Optical Networks, 2014

Nonlinear interference noise in WDM systems and approaches for its cancelation.

[BibT_eX]

[DOI]

Proceedings of the European Conference on Optical Communication, 2014

Mitigation of inter-channel nonlinear interference in WDM systems.

[BibT_eX]

[DOI]

Proceedings of the European Conference on Optical Communication, 2014

2013

Universal Communication - Part I: Modulo Additive Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Universal Communication Over Arbitrarily Varying Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Finite-Dimensional Infinite Constellations.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

The Jacobi MIMO Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

New Bounds on the Capacity of Fiber-Optics Communications

[BibT_eX]

[DOI]

CoRR, 2013

Properties of nonlinear noise in long, dispersion-uncompensated fiber links.

[BibT_eX]

[DOI]

CoRR, 2013

Memoryless representation of Markov processes.

[BibT_eX]

[DOI]

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

A universal probability assignment for prediction of individual sequences.

[BibT_eX]

[DOI]

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

Complex low density lattice codes for the 2×2 MIMO fading channel.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

Information rates in the optical nonlinear phase noise channel.

[BibT_eX]

[DOI]

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012

On the Achievable Communication Rates of Generalized Soliton Transmission Systems

[BibT_eX]

[DOI]

CoRR, 2012

A simpler derivation of the coding theorem

[BibT_eX]

[DOI]

CoRR, 2012

Communication over Individual Channels -- a general framework

[BibT_eX]

[DOI]

CoRR, 2012

A Distance Spectrum Based, Upper Error Bound for Lattices

[BibT_eX]

[DOI]

CoRR, 2012

Max-product algorithm for low density lattice codes.

[BibT_eX]

[DOI]

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

Universal communication over unknown vector channels.

[BibT_eX]

[DOI]

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

Non-random coding error exponent for lattices.

[BibT_eX]

[DOI]

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

Universal rateless coding with finite message set.

[BibT_eX]

[DOI]

Navot Blits

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

Dispersion of infinite constellations in fast fading channels.

[BibT_eX]

[DOI]

Shlomi Vituri

Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011

Optimal Feedback Communication Via Posterior Matching.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Signal Codes: Convolutional Lattice Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Communication Over Individual Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

The Optimal Density of Infinite Constellations for the Gaussian Channel

[BibT_eX]

[DOI]

CoRR, 2011

Finite-Memory Universal Prediction of Individual Continuous Sequences

[BibT_eX]

[DOI]

CoRR, 2011

Universal Prior Prediction for Communication

[BibT_eX]

[DOI]

CoRR, 2011

Universal decoding over Gaussian fading channels - metric calculation and performance evaluation.

[BibT_eX]

[DOI]

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

Universal communication over modulo-additive individual noise sequence channels.

[BibT_eX]

[DOI]

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

Prediction of priors for communication over arbitrarily varying channels.

[BibT_eX]

[DOI]

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

The dispersion of infinite constellations.

[BibT_eX]

[DOI]

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

Finite-memory least squares universal prediction of individual continuous sequences.

[BibT_eX]

[DOI]

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

2010

Efficient network code design for cyclic networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Universal Communication over Modulo-additive Channels with an Individual Noise Sequence

[BibT_eX]

[DOI]

CoRR, 2010

Universal portfolio algorithms in realistic-outcome markets.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

An achievable rate for the MIMO individual channel.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Complex low density lattice codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Parallel bit interleaved coded modulation.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009

Achieving the Empirical Capacity Using Feedback: Memoryless Additive Models.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Finding the Closest Lattice Point by Iterative Slicing.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

Improving the multicommodity flow rates with network codes for two sources.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2009

Efficient parametric decoder of low density lattice codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Power adaptive feedback communication over an additive individual noise sequence channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Feedback communication over individual channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Capacity and error exponent analysis of multilevel coding with multistage decoding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

The Posterior Matching Feedback Scheme for Joint Source-Channel Coding with Bandwidth Expansion.

[BibT_eX]

[DOI]

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

2008

Low-Density Lattice Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Achieving the Empirical Capacity Using Feedback Part I: Memoryless Additive Models

[BibT_eX]

[DOI]

CoRR, 2008

Universal decoding for linear Gaussian fading channels in the competitive minimax sense.

[BibT_eX]

[DOI]

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

Finite memory universal portfolios.

[BibT_eX]

[DOI]

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

The posterior matching feedback scheme: Capacity achieving and error analysis.

[BibT_eX]

[DOI]

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

Distortion lower bounds for finite dimensional joint source-channel coding.

[BibT_eX]

[DOI]

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

A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding.

[BibT_eX]

[DOI]

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

2007

Minimax Universal Decoding With an Erasure Option.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Communication with Feedback via Posterior Matching.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Universal Decoding With an Erasure Option.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Bounds on Redundancy in Constrained Delay Arithmetic Coding.

[BibT_eX]

[DOI]

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

Power Preserving 2: 1 Bandwidth Reduction Mappings.

[BibT_eX]

[DOI]

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

2006

Distortion Bounds for Broadcasting With Bandwidth Expansion.

[BibT_eX]

[DOI]

Zvi Reznic

IEEE Trans. Inf. Theory, 2006

Bounded Expected Delay in Arithmetic Coding.

[BibT_eX]

[DOI]

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

Shrink and Stretch Sequential Scalar (S4) Quantizers.

[BibT_eX]

[DOI]

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

Prediction of Individual Sequences using Universal Deterministic Finite State Machines.

[BibT_eX]

[DOI]

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

Multi-relay regeneration for long haul communications.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2006

Non-Asymptotic Design of Finite State Universal Predictors for Individual Sequences.

[BibT_eX]

[DOI]

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

2005

Universal decoding for frequency-selective fading channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Closest point search in lattices using sequential decoding.

[BibT_eX]

[DOI]

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

Communicating using feedback over a binary channel with arbitrary noise sequence.

[BibT_eX]

[DOI]

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

Efficient network codes for cyclic networks.

[BibT_eX]

[DOI]

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

A minimax optimal decoder for OFDM over unknown frequency-selective fading channels.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Conference on Acoustics, 2005

2004

Guest Editorial: Special Issue on Machine Learning Methods in Signal Processing.

[BibT_eX]

[DOI]

Mário A. T. Figueiredo

IEEE Trans. Signal Process., 2004

The Uniform Distribution as a Universal Prior.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Finite-memory universal prediction of individual sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Bounds on achievable rates of LDPC codes used over the binary erasure channel.

[BibT_eX]

[DOI]

Ohad Barak

David Burshtein

IEEE Trans. Inf. Theory, 2004

On a capacity achieving scheme for the colored Gaussian channel with feedback.

[BibT_eX]

[DOI]

Ayelet Shahar-Doron

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

Convolutional network codes.

[BibT_eX]

[DOI]

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

Multistage quantization via conditional hierarchical mapping.

[BibT_eX]

[DOI]

Amit Eshet

Proceedings of the 2004 11th IEEE International Conference on Electronics, 2004

Optimal Finite State Universal Coding of Individual Sequences.

[BibT_eX]

[DOI]

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

2003

Improving the generalized likelihood ratio test for unknown linear Gaussian channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Bounds on Linear Codes for Network Multicast

[BibT_eX]

[DOI]

Dana Ron

Electron. Colloquium Comput. Complex., 2003

Signal codes.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2002

Universal linear least squares prediction: Upper and lower bounds.

[BibT_eX]

[DOI]

Andrew C. Singer

Suleyman Serdar Kozat

IEEE Trans. Inf. Theory, 2002

Joint source-channel coding of a Gaussian mixture source over the Gaussian broadcast channel.

[BibT_eX]

[DOI]

Zvi Reznic

IEEE Trans. Inf. Theory, 2002

Universal composite hypothesis testing: A competitive minimax approach.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

A Novel Decoder for Unknown Diversity Channels Employing Space-Time Codes.

[BibT_eX]

[DOI]

EURASIP J. Adv. Signal Process., 2002

Deletion-codes overhead for varying settings.

[BibT_eX]

[DOI]

Proceedings of the 2002 IEEE Information Theory Workshop, 2002

Source broadcasting with unknown amount of receiver side information.

[BibT_eX]

[DOI]

Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2001

The Multicast Bandwidth Advantage in Serving a Web Site.

[BibT_eX]

[DOI]

Proceedings of the Networked Group Communication, 2001

2000

Vector sampling expansion.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2000

Correction to "noise amplification of periodic nonuniform sampling".

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2000

Noise amplification of periodic nonuniform sampling.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 2000

Improved error exponent for time-invariant and periodically time-variant convolutional codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Universal Finite Memory Machines for Coding Binary Sequences.

[BibT_eX]

[DOI]

Doron Rajwan

Proceedings of the Data Compression Conference, 2000

1999

Universal linear prediction by model order weighting.

[BibT_eX]

[DOI]

Andrew C. Singer

IEEE Trans. Signal Process., 1999

Recursive expectation-maximization (EM) algorithms for time-varying parameters with applications to multiple target tracking.

[BibT_eX]

[DOI]

Liron Frenkel

IEEE Trans. Signal Process., 1999

Random coding techniques for nonrandom codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Optimal generalized sampling expansion.

[BibT_eX]

[DOI]

Proceedings of the 1999 IEEE International Conference on Acoustics, 1999

SICLIC: A Simple Inter-Color Lossless Image Coder.

[BibT_eX]

[DOI]

Raz Barequet

Proceedings of the Data Compression Conference, 1999

1998

Analysis and synthesis of 1/f processes via Shannon wavelets.

[BibT_eX]

[DOI]

Eli Shusterman

IEEE Trans. Signal Process., 1998

On the Volume of the Minkowski Sum of Line Sets and the Entropy-Power Inequality.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

Universal Prediction.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

Universal Decoding for Channels with Memory.

[BibT_eX]

[DOI]

Amos Lapidoth

IEEE Trans. Inf. Theory, 1998

Introduction to vector sampling expansion.

[BibT_eX]

[DOI]

IEEE Signal Process. Lett., 1998

Branch Prediction Based on Universal Data Compression Algorithms.

[BibT_eX]

[DOI]

Eitan Federovsky

Shlomo Weiss

Proceedings of the 25th Annual International Symposium on Computer Architecture, 1998

Universal Data Compression and Linear Prediction.

[BibT_eX]

[DOI]

Andrew C. Singer

Proceedings of the Data Compression Conference, 1998

Learning to Communicate via Unknown Channel (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual Conference on Computational Learning Theory, 1998

1997

Vector sampling expansion: deterministic and stochastic signals.

[BibT_eX]

[DOI]

Proceedings of the 1997 IEEE International Conference on Acoustics, 1997

An Iterative Technique for Universal Lossy Compression of Individual Sequences.

[BibT_eX]

[DOI]

Daniel Manor

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

1996

Information rates of pre/post-filtered dithered quantizers.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

On lattice quantization noise.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

Hierarchical universal coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

1995

Rate-distortion performance in coding bandlimited sources by sampling and dithered quantization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

A universal finite memory source.

[BibT_eX]

[DOI]

Marcelo J. Weinberger

Jorma Rissanen

IEEE Trans. Inf. Theory, 1995

A strong version of the redundancy-capacity theorem of universal coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Recursive estimate-maximize (EM) algorithms for time varying parameters with applications to multiple target tracking.

[BibT_eX]

[DOI]

Liron Frenkel

Proceedings of the 1995 International Conference on Acoustics, 1995

Universal Coding for Arbitrarily Varying Sources and for Hierarchies of Model Classes.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1995

1994

Iterative and sequential algorithms for multisensor signal enhancement.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 1994

Optimal sequential probability assignment for individual sequences.

[BibT_eX]

[DOI]

Marcelo J. Weinberger

IEEE Trans. Inf. Theory, 1994

Correction to 'Universal prediction of individual sequences' (Jul 92 1258-1270).

[BibT_eX]

Michael Gutman

IEEE Trans. Inf. Theory, 1994

Relations between entropy and error probability.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

Image compression via improved quadtree decomposition algorithms.

[BibT_eX]

[DOI]

Eli Shusterman

IEEE Trans. Image Process., 1994

Single-sensor active noise cancellation.

[BibT_eX]

[DOI]

IEEE Trans. Speech Audio Process., 1994

The Minimax Redundancy is a Lower Bound for Most Sources.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1994

1993

Parameter Estimation and Extraction of Helicopter Signals Observed with a Wide-Band Interference.

[BibT_eX]

[DOI]

IEEE Trans. Signal Process., 1993

A generalization of the entropy power inequality with applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

Some properties of sequential predictors for binary Markov sources.

[BibT_eX]

[DOI]

Michael Gutman

IEEE Trans. Inf. Theory, 1993

Universal schemes for sequential decision from individual data sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

Multi-channel signal separation by decorrelation.

[BibT_eX]

[DOI]

IEEE Trans. Speech Audio Process., 1993

1992

On universal quantization by randomized uniform/lattice quantizers.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1992

Universal prediction of individual sequences.

[BibT_eX]

[DOI]

Michael Gutman

IEEE Trans. Inf. Theory, 1992

A note on the competitive optimality of the Huffman code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1992

Single sensor active noise cancellation based on the EM algorithm.

[BibT_eX]

[DOI]

Proceedings of the 1992 IEEE International Conference on Acoustics, 1992

Universal Coding of Band-Limited Sources by Sampling and Dithered Quantization.

[BibT_eX]

[DOI]

Proceedings of the IEEE Data Compression Conference, 1992

Universal Sequential Learning and Decision from Individual Data Sequences.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM Conference on Computational Learning Theory, 1992

1991

Gambling using a finite state machine.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

1990

Sequential algorithms for parameter estimation based on the Kullback-Leibler information measure.

[BibT_eX]

[DOI]

IEEE Trans. Acoust. Speech Signal Process., 1990

1989

Maximum likelihood noise cancellation using the EM algorithm.

[BibT_eX]

[DOI]

IEEE Trans. Acoust. Speech Signal Process., 1989

Sequential algorithms based on Kullback-Liebler information measure and their application to FIR system identification.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 1989

Limited-angle reconstruction from noisy data using clustering of the solution space.

[BibT_eX]

[DOI]

Jules S. Jaffe

Proceedings of the IEEE International Conference on Acoustics, 1989

1988

Parameter estimation of superimposed signals using the EM algorithm.

[BibT_eX]

[DOI]

IEEE Trans. Acoust. Speech Signal Process., 1988

A new class of sequential and adaptive algorithms with application to noise cancellation.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 1988

1987

Methods for noise cancellation based on the EM algorithm.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 1987

1986

Maximum entropy as a special case of the minimum description length criterion.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1986

Multipath and multiple source array processing via the EM algorithm.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 1986

1985

Optimal multiple source location estimation via the EM algorithm.

[BibT_eX]

[DOI]