نتایج جستجو برای: huffman
تعداد نتایج: 1461 فیلتر نتایج به سال:
The class of k-bit delay decodable codes, source codes allowing decoding at most k bits for ≥ 0, can attain a shorter average codeword length than Huffman codes. This paper discusses the general properties with finite number code tables and proves two theorems which enable us to limit scope be considered when discussing optimal
D. Bonham, G. Garzoglio, R. Herber, J. Kowalkowski, D. Litvintsev, L. Lueking, M. Paterno, D. Petravick, L. Piccoli, R. Pordes, N. Stanfield, I. Terekhov, J. Trumbo, J. Tseng, S. Veseli, M. Votava, V. White FNAL, Batavia, IL 60510, USA T. Huffman, S. Stonjek, K. Waltkins Oxford University, Oxford OX1 2JD, UK P. Crosby, D. Waters University College London, London WC1E 6BT, UK R. St.Denis Glasgow...
Article history: Received 20 February 2013 Received in revised form 26 August 2013 Accepted 29 August 2013 Available online 18 September 2013 Communicated by W. Cary Huffman
We investigate the utility of linguistic features for automatically differentiating between children with varying combinations of two potentially comorbid neurodevelopmental disorders: autism spectrum disorder and specific language impairment. We find that certain manual codes for linguistic errors are useful for distinguishing between diagnostic groups. We investigate the relationship between ...
This document is disseminated under the sponsorship of the Department of Transportation in the interest of information exchange. The United States Government assumes no liability for its contents or use thereof. Providing an accurate picture of the weather conditions in the pilot's area ofinterest is a highly useful application for ground-ta-air datalinks. The problem with using data links to t...
Abstract The contribution of soot aerosols to radiative forcing and climate change depends on their optical properties. Since these are agglomerates composed quasi-spherical primary particles (usually small with respect the radiation wavelength), properties can be calculated following Rayleigh-Debye-Gans approximation, which considers as independent absorbers scatterers, corrections made accoun...
We study the redundancy of Huffman code (which, incidentally, is as old as the author of this paper). It has been known from the inception of this code that in the worst case Huffman code redundancy defined as the excess of the code length over the optimal (ideal) code length is not more than onc. Over more than forty years, insightful, elegant and useful constructions have been set up to deter...
This paper discusses the problem of using data compression for encryption. We first propose an algorithm for breaking a prefix-coded file by enumeration. Based on the algorithm, we respectively analyze the complexity of breaking Huffman codes and Shannon-Fano-Elias codes under the assumption that the cryptanalyst knows the code construction rule and the probability mass function of the source. ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید