نتایج جستجو برای: huffman coding
تعداد نتایج: 126815 فیلتر نتایج به سال:
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
Article history: Received 26 February 2009 Revised 21 September 2009 Available online 2 February 2010 Communicated by W. Cary Huffman
It has been recently proved that the redundancy r of any discrete memoryless source satisses r 1?H(p N), where p N is the least likely source letter probability. We prove that this bound is achieved only by sources consisting of two letters and that a sharper bound holds if the number of source letters is greater than two. Also provided is a new upper bound on r, as function of the two least li...
Article history: Received 9 January 2016 Received in revised form 15 June 2016 Accepted 25 August 2016 Available online xxxx Communicated by W. Cary Huffman
An n symbol source which has a Huffman code with codelength vector Ln = (1, 2, 3, · · · , n − 2, n − 1, n − 1) is called an anti-uniform source. In this paper, it is shown that for this class of sources, the optimal fix-free code and symmetric fix-free code is C∗ n = (0, 11, 101, 1001, · · · , 1 n−2 { }} { 0 · · · 0 1).
This report presents the results of applying different compression algorithms to the network protocol of an online game. The algorithm implementations compared are zlib, liblzma and my own implementation based on LZ77 and a variation of adaptive Huffman coding. The comparison data was collected from the game TomeNET. The results show that adaptive coding is especially useful for compressing lar...
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 ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید