Julia Abrahams

According to our database, Julia Abrahams authored at least 15 papers between 1981 and 2001.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2001

Code and parse tree for lossless source encoding.

Julia Abrahams

Commun. Inf. Syst., 2001

1998

Variable-Length Unequal Cost Parsing and Coding for Shaping.

Julia Abrahams

IEEE Trans. Inf. Theory, 1998

1997

Code and parse trees for lossless source encoding.

Julia Abrahams

Proceedings of the Compression and Complexity of SEQUENCES 1997, 1997

1996

Generation of discrete distributions from biased coins.

Julia Abrahams

IEEE Trans. Inf. Theory, 1996

1995

Minimum average cost testing for partially ordered components.

Marc J. Lipman, Julia Abrahams

IEEE Trans. Inf. Theory, 1995

1994

Parallelized Huffman and Hu-Tucker searching.

Julia Abrahams

IEEE Trans. Inf. Theory, 1994

Codes with Monotonic Codeword Lengths.

Julia Abrahams

Inf. Process. Manag., 1994

1993

Relative uniformity of sources and the comparison of optimal code costs.

Julia Abrahams, Marc J. Lipman

IEEE Trans. Inf. Theory, 1993

1992

Zero-redundancy coding for unequal code symbol costs.

Julia Abrahams, Marc J. Lipman

IEEE Trans. Inf. Theory, 1992

1987

On the redundancy of optimal binary prefix-condition codes for finite and infinite sources.

Bruce L. Montgomery, Julia Abrahams

IEEE Trans. Inf. Theory, 1987

1986

Synchronization of binary source codes.

Bruce L. Montgomery, Julia Abrahams

IEEE Trans. Inf. Theory, 1986

1984

Ramp crossings for Slepian's process.

Julia Abrahams

IEEE Trans. Inf. Theory, 1984

1982

The zero-crossing problem for some nonstationary Gaussian processes.

Julia Abrahams

IEEE Trans. Inf. Theory, 1982

On the selection of measures of distance between probability distributions.

Julia Abrahams

Inf. Sci., 1982

1981

Some comments on conditionally Markov and reciprocal Gaussian processes.

Julia Abrahams, John B. Thomas

IEEE Trans. Inf. Theory, 1981