1998 |
13 | | Julia Abrahams:
Variable-Length Unequal Cost Parsing and Coding for Shaping.
IEEE Transactions on Information Theory 44(4): 1648-1650 (1998) |
1996 |
12 | | Julia Abrahams:
Generation of discrete distributions from biased coins.
IEEE Transactions on Information Theory 42(5): 1541-1546 (1996) |
1995 |
11 | | Marc J. Lipman,
Julia Abrahams:
Minimum average cost testing for partially ordered components.
IEEE Transactions on Information Theory 41(1): 287-291 (1995) |
1994 |
10 | | Julia Abrahams:
Parallelized Huffman and Hu-Tucker searching.
IEEE Transactions on Information Theory 40(2): 508- (1994) |
9 | | Julia Abrahams:
Codes with Monotonic Codeword Lengths.
Inf. Process. Manage. 30(6): 759-764 (1994) |
1993 |
8 | | Julia Abrahams,
Marc J. Lipman:
Relative uniformity of sources and the comparison of optimal code costs.
IEEE Transactions on Information Theory 39(5): 1695- (1993) |
1992 |
7 | | Julia Abrahams,
Marc J. Lipman:
Zero-redundancy coding for unequal code symbol costs.
IEEE Transactions on Information Theory 38(5): 1583- (1992) |
1987 |
6 | | Bruce L. Montgomery,
Julia Abrahams:
On the redundancy of optimal binary prefix-condition codes for finite and infinite sources.
IEEE Transactions on Information Theory 33(1): 156- (1987) |
1986 |
5 | | Bruce L. Montgomery,
Julia Abrahams:
Synchronization of binary source codes.
IEEE Transactions on Information Theory 32(6): 849- (1986) |
1984 |
4 | | Julia Abrahams:
Ramp crossings for Slepian's process.
IEEE Transactions on Information Theory 30(3): 574- (1984) |
1982 |
3 | | Julia Abrahams:
The zero-crossing problem for some nonstationary Gaussian processes.
IEEE Transactions on Information Theory 28(4): 677- (1982) |
2 | EE | Julia Abrahams:
On the selection of measures of distance between probability distributions.
Inf. Sci. 26(2): 109-113 (1982) |
1981 |
1 | | Julia Abrahams,
John B. Thomas:
Some comments on conditionally Markov and reciprocal Gaussian processes.
IEEE Transactions on Information Theory 27(4): 523- (1981) |