Relevant bibliographies by topics / Differential and Huffman coding

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Differential and Huffman coding'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Differential and Huffman coding.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Differential and Huffman coding"

1

Sripal Reddy, K., and B. Leelaram Prakash. "HSV, Edge Preserved and Huffman Coding based Intra Frame High Efficient video Compression for Multimedia Communication." International Journal of Engineering & Technology 7, no. 3.12 (July 20, 2018): 1090. http://dx.doi.org/10.14419/ijet.v7i3.12.17767.

Full text
Abstract:
High Efficiency Video Coding (HEVC) is another pressure standard for high resolution video content, which just needs 50% of the bit rate of H.264/Advanced Video Coding (AVC) at the same perceptual quality. Be that as it may, the computational intricacy is increments dramatically to adopt quad-tree organized Coding Unit (CU). In this document a new Hue Saturation Lightness (HSV), Edge Preserving and Huffman coding (HC) based intra frame high efficient video compression algorithm is introduced which is named as HSV-EPHC-IFHEVC. To increase the compression ratio of the video frames Huffman and Differential Pulse Code Modulation (DPCM) encodings are used. To improve the de-compressed frame quality in compression Sharpening filter based Edge preserving technique is used. This HSV-EPHC-IFHEVC algorithm provides much better performance compared to existing systems. The performance measurement is in the terms of MSE, PSNR, RMSE and Execution time.
APA, Harvard, Vancouver, ISO, and other styles
2

Hakim, P. R., and R. Permala. "Analysis of LAPAN-IPB image lossless compression using differential pulse code modulation and huffman coding." IOP Conference Series: Earth and Environmental Science 54 (January 2017): 012096. http://dx.doi.org/10.1088/1755-1315/54/1/012096.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pang, Liaojun, Deyu Miao, Huixian Li, and Qiong Wang. "Improved Secret Image Sharing Scheme in Embedding Capacity without Underflow and Overflow." Scientific World Journal 2015 (2015): 1–16. http://dx.doi.org/10.1155/2015/861546.

Full text
Abstract:
Computational secret image sharing (CSIS) is an effective way to protect a secret image during its transmission and storage, and thus it has attracted lots of attentions since its appearance. Nowadays, it has become a hot topic for researchers to improve the embedding capacity and eliminate the underflow and overflow situations, which is embarrassing and difficult to deal with. The scheme, which has the highest embedding capacity among the existing schemes, has the underflow and overflow problems. Although the underflow and overflow situations have been well dealt with by different methods, the embedding capacities of these methods are reduced more or less. Motivated by these concerns, we propose a novel scheme, in which we take the differential coding, Huffman coding, and data converting to compress the secret image before embedding it to further improve the embedding capacity, and the pixel mapping matrix embedding method with a newly designed matrix is used to embed secret image data into the cover image to avoid the underflow and overflow situations. Experiment results show that our scheme can improve the embedding capacity further and eliminate the underflow and overflow situations at the same time.
APA, Harvard, Vancouver, ISO, and other styles
4

Sang, Jun, Muhammad Azeem Akbar, Bin Cai, Hong Xiang, and Haibo Hu. "Joint Image Compression and Encryption Using IWT with SPIHT, Kd-Tree and Chaotic Maps." Applied Sciences 8, no. 10 (October 17, 2018): 1963. http://dx.doi.org/10.3390/app8101963.

Full text
Abstract:
Confidentiality and efficient bandwidth utilization require a combination of compression and encryption of digital images. In this paper, a new method for joint image compression and encryption based on set partitioning in hierarchical trees (SPIHT) with optimized Kd-tree and multiple chaotic maps was proposed. First, the lossless compression and encryption of the original images were performed based on integer wavelet transform (IWT) with SPIHT. Wavelet coefficients undergo diffusions and permutations before encoded through SPIHT. Second, maximum confusion, diffusion and compression of the SPIHT output were performed via the modified Kd-tree, wavelet tree and Huffman coding. Finally, the compressed output was further encrypted with varying parameter logistic maps and modified quadratic chaotic maps. The performance of the proposed technique was evaluated through compression ratio (CR) and peak-signal-to-noise ratio (PSNR), key space and histogram analyses. Moreover, this scheme passes several security tests, such as sensitivity, entropy and differential analysis tests. According to the theoretical analysis and experimental results, the proposed method is more secure and decreases the redundant information of the image more than the existing techniques for hybrid compression and encryption.
APA, Harvard, Vancouver, ISO, and other styles
5

Moffat, Alistair. "Huffman Coding." ACM Computing Surveys 52, no. 4 (September 18, 2019): 1–35. http://dx.doi.org/10.1145/3342555.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Abdul Mannan, M., and M. Kaykobad. "Block huffman coding." Computers & Mathematics with Applications 46, no. 10-11 (November 2003): 1581–87. http://dx.doi.org/10.1016/s0898-1221(03)90193-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Fraenkel, A. S. "Bidirectional Huffman Coding." Computer Journal 33, no. 4 (April 1, 1990): 296–307. http://dx.doi.org/10.1093/comjnl/33.4.296.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Knuth, Donald E. "Dynamic huffman coding." Journal of Algorithms 6, no. 2 (June 1985): 163–80. http://dx.doi.org/10.1016/0196-6774(85)90036-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Dr. Atul Suryavanshi. "Optimized Adaptive Huffmann Coding For Paper Reduction in OFDM Systems." International Journal of New Practices in Management and Engineering 2, no. 04 (December 31, 2013): 13–18. http://dx.doi.org/10.17762/ijnpme.v2i04.23.

Full text
Abstract:
The main defect of OFDM systems is its high peak-to-average power ratio (PAPR). To decrease PAPR, Adaptive Huffman coding is essential. Encoding is transferred by two encoding techniques Huffman coding and Adaptive Huffman coding at the transmitter side. Mapping is done by QAM 16 and PSK 16.The PAPR results of Huffman and adaptive Huffman coding with QAM 16 and PSK 16 is compared. Simulation results shows that the Adaptive Huffman coding along with QAM 16 produces fruitful results in comparison with Huffman coding and adaptive Huffman coding with PSK 16.
APA, Harvard, Vancouver, ISO, and other styles
10

Amarunnishad, T. M., V. K. Govindan, and Abraham T. Mathew. "Block Truncation Coding with Huffman Coding." Journal of Medical Imaging and Health Informatics 1, no. 2 (June 1, 2011): 170–76. http://dx.doi.org/10.1166/jmihi.2011.1021.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Differential and Huffman coding"

1

Románek, Karel. "Nezávislý datalogger s USB připojením." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-219113.

Full text
Abstract:
This thesis treats concept of autonomous temperature, relative humidity and pressure USB datalogger. Also there is explained datalogger function, hardware design with respect on device consumption and design of chassis. Furthermore, there is described communication protocol for control and reading out data by the PC. Furthermore, there are described firmware drivers for some used components and modules for USB communication, RTC and data compression. Lastly there is described software which is used for datalogger configuration and data read out.
APA, Harvard, Vancouver, ISO, and other styles
2

Kilic, Suha. "Modification of Huffman Coding." Thesis, Monterey, California. Naval Postgraduate School, 1985. http://hdl.handle.net/10945/21449.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zou, Xin. "Compression and Decompression of Color MRI Image by Huffman Coding." Thesis, Blekinge Tekniska Högskola, Institutionen för tillämpad signalbehandling, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-17029.

Full text
Abstract:
MRI image (Magnetic Resonance Imaging) as a universal body checkup method in modern medicine. It can help doctors to analyze the condition of patients as soon as possible. As the medical images, the MRI images have high quality and a large amount of data, which requires more transmission time and larger storage capacity. To reduce transmission time and storage capacity, the compression and decompression technology is applied. Now most MRI images are colour, but most theses still use gray MRI images to research. Compressed color MRI images is a new research area. In this thesis, some basic theories of the compression technoloy and medical technology were firstly introduced, then basic strcture and kernel algorithm of Huffman coding were explained in detail. Finally, Huffman coding was implemented in MATLAB to compress and decompress the colour MRI images.The result of the experiment shows that the Huffman coding in colour MRI image compression can get high compression ratio and coding efficient.
APA, Harvard, Vancouver, ISO, and other styles
4

Griffin, Anthony. "Coding CPFSK for differential demodulation." Thesis, University of Canterbury. Electrical and Electronic Engineering, 2000. http://hdl.handle.net/10092/6031.

Full text
Abstract:
A differential encoder is developed that preserves the phase trellis of continuous phase frequency shift keying (CPFSK) through differential demodulation. This differential encoder interfaces well with the decomposed model of CPFSK, creating a decomposed model of differentially-encoded and differentially-demodulated CPFSK (DCPFSK). The normalised minimum squared Euclidean distance d2min of uncoded DCPFSK is calculated. A code search model is developed, allowing codes over rings to be specifically designed for DCPFSK. The results of code searches show that there is very little loss in d2min when comparing coded DCPFSK systems with coherently-demodulated coded CPFSK systems. The performance of uncoded and coded DCPFSK systems in both additive white Gaussian noise (AWGN) and Rayleigh flat fading is analysed and simulated. DCPFSK is shown to be relatively robust to medium to slowly-varying fading, without the use of any additional techniques. Rate-1/2 encoded quaternary DCPFSK with modulation index h = 1/4 is compared with coherently-demodulated uncoded MSK and differentially-encoded and differentially- demodulated minimum shift keying (DMSK) without error-control coding, in AWGN and Rayleigh flat fading. The coded system shows that significant performance improvement can be obtained through simple coding, particularly in Rayleigh flat fading.
APA, Harvard, Vancouver, ISO, and other styles
5

Song, Lingyang. "Differential space-time coding techniques and MIMO." Thesis, University of York, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.434157.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Nelson, Tom. "ALAMOUTI SPACE-TIME CODING FOR QPSK WITH DELAY DIFFERENTIAL." International Foundation for Telemetering, 2003. http://hdl.handle.net/10150/607483.

Full text
Abstract:
International Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevada
Space-time coding (STC) for QPSK where the transmitted signals are received with the same delay is well known. This paper examines the case where the transmitted signals are received with a nonnegligible delay differential when the Alamouti 2x1 STC is used. Such a differential can be caused by a large spacing of the transmit antennas. In this paper, an expression for the received signal with a delay differential is derived and a decoding algorithm for that signal is developed. In addition, the performance of this new algorithm is compared to the standard Alamouti decoding algorithm for various delay differentials.
APA, Harvard, Vancouver, ISO, and other styles
7

Wong, K. H. J. "Adaptive differential pulse code modulation and sub-band coding of speech signals." Thesis, University of Southampton, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.380170.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Yoshida, K. "Speech coding by adaptive differential pulse code modulation with adaptive bit allocation." Thesis, Imperial College London, 1985. http://hdl.handle.net/10044/1/37905.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Karlsson, Joakim. "Differential and co-expression of long non-coding RNAs in abdominal aortic aneurysm." Thesis, Uppsala universitet, Institutionen för biologisk grundutbildning, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-236141.

Full text
Abstract:
This project concerns an exploration of the presence and interactions of long non-coding RNA transcripts in an experimental atherosclerosis mouse model with relevance for human abdominal aortic aneurysm development. 187 long noncoding RNAs, two of them entirely novel, were found to be differentially expressed between angiotensin II treated (developing abdominal aortic aneurysms) and non-treated apolipoprotein E deficient mice (not developing aneurysms) harvested after the same period of time. These transcripts were also studied with regards to co-expression network connections. Eleven previously annotated and two novel long non-coding RNAs were present in two significantly disease correlated co-expression groups that were further profiled with respect to network properties, Gene Ontology terms and MetaCore© connections.
APA, Harvard, Vancouver, ISO, and other styles
10

Machado, Lennon de Almeida. "Busca indexada de padrões em textos comprimidos." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-09062010-222653/.

Full text
Abstract:
A busca de palavras em uma grande coleção de documentos é um problema muito recorrente nos dias de hoje, como a própria utilização dos conhecidos \"motores de busca\" revela. Para que as buscas sejam realizadas em tempo que independa do tamanho da coleção, é necessário que a coleção seja indexada uma única vez. O tamanho destes índices é tipicamente linear no tamanho da coleção de documentos. A compressão de dados é outro recurso bastante utilizado para lidar com o tamanho sempre crescente da coleção de documentos. A intenção deste estudo é aliar a indexação utilizada nas buscas à compressão de dados, verificando alternativas às soluções já propostas e visando melhorias no tempo de resposta das buscas e no consumo de memória utilizada nos índices. A análise das estruturas de índice com os algoritmos de compressão mostra que arquivo invertido por blocos em conjuntos com compressão Huffman por palavras é uma ótima opção para sistemas com restrição de consumo de memória, pois proporciona acesso aleatório e busca comprimida. Neste trabalho também são propostas novas codificações livres de prefixo a fim de melhorar a compressão obtida e capaz de gerar códigos auto-sincronizados, ou seja, com acesso aleatório realmente viável. A vantagem destas novas codificações é que elas eliminam a necessidade de gerar a árvore de codificação Huffman através dos mapeamentos propostos, o que se traduz em economia de memória, codificação mais compacta e menor tempo de processamento. Os resultados obtidos mostram redução de 7% e 9% do tamanho dos arquivos comprimidos com tempos de compressão e descompressão melhores e menor consumo de memória.
Pattern matching over a big document collection is a very recurrent problem nowadays, as the growing use of the search engines reveal. In order to accomplish the search in a period of time independent from the collection size, it is necessary to index the collecion only one time. The index size is typically linear in the size of document collection. Data compression is another powerful resource to manage the ever growing size of the document collection. The objective in this assignment is to ally the indexed search to data compression, verifying alternatives to the current solutions, seeking improvement in search time and memory usage. The analysis on the index structures and compression algorithms indicates that joining the block inverted les with Huffman word-based compression is an interesting solution because it provides random access and compressed search. New prefix free codes are proposed in this assignment in order to enhance the compression and facilitate the generation of self-sinchronized codes, furthermore, with a truly viable random access. The advantage in this new codes is that they eliminate the need of generating the Huffman-code tree through the proposed mappings, which stands for economy of memory, compact encoding and shorter processing time. The results demonstrate gains of 7% and 9% in the compressed le size, with better compression and decompression times and lower memory consumption.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Differential and Huffman coding"

1

Kilic, Suha. Modification of Huffman Coding. Monterey, California: Naval Postgraduate School, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Manstetten, Dietrich. Schranken für die Redundanz des Huffman-Codes. Heidelberg: A. Hüthig, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hogendoorn, R. A. Data compression in computational fluid dynamics. Amsterdam: National Aerospace Laboratory, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Kambiz, Salari, ed. Verification of computer codes in computational science and engineering. Boca Raton, Fla: Chapman & Hall/CRC Press, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Handbook of Coding Theory. Amsterdam: Elsevier, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Corapcioglu, Ahmet. Reduction in bandwidth and buffer size by using modified Huffman coding after dropping the less frequent source symbols. 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

United States. National Aeronautics and Space Administration., ed. Oblique hypervelocity impact simulation for multi-layer orbital debris shielding (NAG 9-744): Final report. [Washington, DC: National Aeronautics and Space Administration, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

United States. National Aeronautics and Space Administration., ed. Oblique hypervelocity impact simulation for multi-layer orbital debris shielding (NAG 9-744): Final report. [Washington, DC: National Aeronautics and Space Administration, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Knupp, Patrick, and Kambiz Salari. Verification of Computer Codes in Computational Science and Engineering. Chapman & Hall/CRC, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Knupp, Patrick, and Kambiz Salari. Verification of Computer Codes in Computational Science and Engineering. Taylor & Francis Group, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Differential and Huffman coding"

1

Singh, Arjan, Baljit Singh Khehra, and Gursheen Kaur Kohli. "Differential Huffman Coding Approach for Lossless Compression of Medical Images." In Intelligent Computing and Communication, 579–89. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-1084-7_56.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Weik, Martin H. "Huffman coding." In Computer Science and Communications Dictionary, 738. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_8512.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

You, Yuli. "Huffman Coding." In Audio Coding, 161–70. Boston, MA: Springer US, 2010. http://dx.doi.org/10.1007/978-1-4419-1754-6_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Moffat, Alistair. "Huffman Coding." In Encyclopedia of Algorithms, 938–42. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_633.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Moffat, Alistair. "Huffman Coding." In Encyclopedia of Algorithms, 1–6. Boston, MA: Springer US, 2014. http://dx.doi.org/10.1007/978-3-642-27848-8_633-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Klein, Shmuel Tomi, Shoham Saadia, and Dana Shapira. "Forward Looking Huffman Coding." In Computer Science – Theory and Applications, 203–14. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-19955-5_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Battiato, S., C. Bosco, A. Bruna, G. Di Blasi, and G. Gallo. "Statistical Modeling of Huffman Tables Coding." In Image Analysis and Processing – ICIAP 2005, 711–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11553595_87.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Maurya, Indu, and S. K. Gupta. "Understandable Huffman Coding: A Case Study." In Advances in Intelligent Systems and Computing, 147–58. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-13-0589-4_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lee, Chin-Feng, Chin-Chen Chang, and Qun-Feng Zeng. "VQ Compression Enhancer with Huffman Coding." In Advances in Intelligent Systems and Computing, 101–8. Singapore: Springer Singapore, 2017. http://dx.doi.org/10.1007/978-981-10-6487-6_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kekre, H. B., Sanjay R. Sange, Gauri S. Sawant, and Ankit A. Lahoty. "Image Compression Using Halftoning and Huffman Coding." In Communications in Computer and Information Science, 221–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20209-4_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Differential and Huffman coding"

1

Young Han Lee, Deok Su Kim, and Hong Kook Kim. "Class-dependent and differential Huffman coding of compressed feature parameters for distributed speech recognition." In ICASSP 2009 - 2009 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 2009. http://dx.doi.org/10.1109/icassp.2009.4960546.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Arshad, Rabia, Adeel Saleem, and Danista Khan. "Performance comparison of Huffman Coding and Double Huffman Coding." In 2016 Sixth International Conference on Innovative Computing Technology (INTECH). IEEE, 2016. http://dx.doi.org/10.1109/intech.2016.7845058.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Fruchtman, Aharon, Yoav Gross, Shmuel T. Klein, and Dana Shapira. "Weighted Adaptive Huffman Coding." In 2020 Data Compression Conference (DCC). IEEE, 2020. http://dx.doi.org/10.1109/dcc47342.2020.00059.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Brzuchalski, Grzegorz. "Huffman coding in advanced audio coding standard." In Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2012, edited by Ryszard S. Romaniuk. SPIE, 2012. http://dx.doi.org/10.1117/12.2000138.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Klein, Shmuel T., Shoham Saadia, and Dana Shapira. "Better Than Optimal Huffman Coding?" In 2019 Data Compression Conference (DCC). IEEE, 2019. http://dx.doi.org/10.1109/dcc.2019.00094.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bookstein, Abraham, Shmuel T. Klein, and Timo Raita. "Is Huffman coding dead? (extended abstract)." In the 16th annual international ACM SIGIR conference. New York, New York, USA: ACM Press, 1993. http://dx.doi.org/10.1145/160688.160697.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Klein, Shmuel T., and Dana Shapira. "Huffman Coding with Non-sorted Frequencies." In 2008 Data Compression Conference DCC. IEEE, 2008. http://dx.doi.org/10.1109/dcc.2008.73.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Wang, Wei, and Wei Zhang. "Adaptive Spatial Modulation Using Huffman Coding." In GLOBECOM 2016 - 2016 IEEE Global Communications Conference. IEEE, 2016. http://dx.doi.org/10.1109/glocom.2016.7841569.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Golin, Mordecai J., Claire Kenyon, and Neal E. Young. "Huffman coding with unequal letter costs." In the thiry-fourth annual ACM symposium. New York, New York, USA: ACM Press, 2002. http://dx.doi.org/10.1145/509907.510020.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Baer, Michael B. "D-ary Bounded-Length Huffman Coding." In 2007 IEEE International Symposium on Information Theory. IEEE, 2007. http://dx.doi.org/10.1109/isit.2007.4557338.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Differential and Huffman coding"

1

DELTA INFORMATION SYSTEMS INC HORSHAM PA. Transform Coding and Differential Pulse Code Modulation for Group 4 Facsimile. Fort Belvoir, VA: Defense Technical Information Center, August 1987. http://dx.doi.org/10.21236/ada223954.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Differential and Huffman coding' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography