Source coding algorithms for fast data compression
By Richard C. Pasco. 1976
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
Citations in the corpus
- High Fidelity Neural Audio Compression (2022, methodology): “We use a range based arithmetic coder (Pasco, 1976; Rissanen & Langdon, 1981) in order to leverage the estimated probabilities given by the language model.”
- Wavenet Based Low Rate Speech Coding (2017, methodology): “Using techniques such as arithmetic coding [24, 25] can provide near-optimal coding for an entire sequence of indices.”
- Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform - Part one: Without context models (2000, methodology): “So far, the most widely used universal lossless compression algorithms are arithmetic coding algorithms [1], [20], [22], [23], [29], Lempel–Ziv algorithms [16], [35], [36], and their variants.”
- Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform .2. With context models (2000, methodology): “So far, the most widely used universal lossless compression algorithms are arithmetic coding algorithms [1], [20], [22], [23], [29], Lempel–Ziv algorithms [16], [35], [36], and their variants.”
- Arithmetic coding for data compression (1987, methodology): “Practical techniques were first introduced by Rissanen [16] and Pasco [ 15 ], and developed further by Rissanen [17].”
- The zero-frequency problem: Estimating the probabilities of novel events in adaptive text compression (1991, methodology): “The coding problem is solved by the method of “arithmetic coding,” discovered in 1976 by Pasco [ 2 ] and Rissanen [31 and developed further in [4]-[6].”
- Introduction to Data Compression (2005, background): “Modern arithmetic coding owes its birth to the independent discoveries in 1976 of Pasco [41] and Rissanen [42] that the problem of finite precision could be resolved.”