On the universality of the LZ-based decoding algorithm

On the universality of the LZ-based decoding algorithm

Cover title.

Bibliographic Details
Other Authors:	Lapidoth, Amos.
Language:	eng
Published:	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems 2003
Subjects:	TK7855.M41 E3845 no.2401
Online Access:	http://hdl.handle.net/1721.1/3460

Similar Items

Universal decoding for noisy channels
Published: (2003)

Universal decoders for channels with memory
Published: (2003)

Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
Published: (2003)

Topology broadcast algorithms
Published: (2003)

The Lions-Mercier splitting algorithm and the alternating direction method are instances of the proximal point algorithm
Published: (2003)

Convergence of the simulated annealing algorithm
Published: (2003)

The nonlinear proximal point algorithm
Published: (2003)

Rollout algorithms for combinatorial optimization
Published: (2003)

Optimal communication algorithms for hypercubes
Published: (2003)

The auction algorithm for the transportation problem
Published: (2003)

An auction algorithm for shortest paths
Published: (2003)

On the convergence of the affine-scaling algorithm
Published: (2003)

The Schur algorithm and its applications
Published: (2002)

On sampling methods and annealing algorithms
Published: (2002)

Rollout algorithms for stochastic scheduling problems
Published: (2003)

A new parallel smoothing algorithm
Published: (2003)

An auction algorithm for the max-flow problem
Published: (2003)

Efficient algorithms for globally optimal trajectories
Published: (2003)

Polynomial auction algorithms for shortest paths
Published: (2003)

Parallel shortest path auction algorithms
Published: (2003)

Finite termination of asynchronous iterative algorithms
Published: (2003)

Modified auction algorithms for shortest paths
Published: (2003)

A hierarchical algorithm for limited-angle reconstruction
Published: (2003)

Partial proximal minimization algorithms for convex programming
Published: (2003)

On the average communication complexity of asynchronous distributed algorithms
Published: (2003)

Simulated annealing type algorithms for multivariate optimization
Published: (2003)

An adaptive distributed Dijkstra shortest path algorithm
Published: (2003)

The nonlinear poximal point algorithm and multiplier methods
Published: (2003)

Simulated annealing type algorithms for multivariate optimization
Published: (2003)

A new algorithm for multiplication in finite fields
Published: (2003)

Convergence rate and termination of asynchronous iterative algorithms
Published: (2003)

Communication complexity of distributed shortest path algorithms
Published: (2003)

A decomposition algorithm for convex differentiable minimization
Published: (2003)

A diagnostics algorithm for impact printer actuator
Published: (2003)

A geometric projection-space reconstruction algorithm
Published: (2003)

A hierarchicial algorithm for neural training and control
Published: (2003)

An efficient algorithm for multiple simultaneous broadcasts in the hypercube
Published: (2002)

On the average communication complexity of asynchronous distributed algorithms
Published: (2002)

Parallel smoothing algorithms for causal and acausal systems
Published: (2002)

Efficient algorithms for continuous-space shortest path problems
Published: (2003)