Julia Abrahams - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 15 from 15

2001

Code and parse tree for lossless source encodingJulia Abrahams. cominfsys, 1(2):113-146, 2001. [doi]

1998

Variable-Length Unequal Cost Parsing and Coding for ShapingJulia Abrahams. TIT, 44(4):1648-1650, 1998.

1997

Code and parse trees for lossless source encodingJulia Abrahams. sequences 1997: 145-171 [doi]

1996

Generation of discrete distributions from biased coinsJulia Abrahams. TIT, 42(5):1541-1546, 1996.

1995

Minimum average cost testing for partially ordered componentsMarc J. Lipman, Julia Abrahams. TIT, 41(1):287-291, 1995.

1994

Parallelized Huffman and Hu-Tucker searchingJulia Abrahams. TIT, 40(2):508, 1994.

Codes with Monotonic Codeword LengthsJulia Abrahams. ipm, 30(6):759-764, 1994.

1993

Relative uniformity of sources and the comparison of optimal code costsJulia Abrahams, Marc J. Lipman. TIT, 39(5):1695, 1993.

1992

Zero-redundancy coding for unequal code symbol costsJulia Abrahams, Marc J. Lipman. TIT, 38(5):1583, 1992.

1987

On the redundancy of optimal binary prefix-condition codes for finite and infinite sourcesBruce L. Montgomery, Julia Abrahams. TIT, 33(1):156, 1987.

1986

Synchronization of binary source codesBruce L. Montgomery, Julia Abrahams. TIT, 32(6):849, 1986.

1984

Ramp crossings for Slepian s processJulia Abrahams. TIT, 30(3):574, 1984.

1982

The zero-crossing problem for some nonstationary Gaussian processesJulia Abrahams. TIT, 28(4):677, 1982.

On the selection of measures of distance between probability distributionsJulia Abrahams. isci, 26(2):109-113, 1982. [doi]

1981

Some comments on conditionally Markov and reciprocal Gaussian processesJulia Abrahams, John B. Thomas. TIT, 27(4):523, 1981.

Sign in or sign up to see more results.

runs on WebDSL