Log in

Relevant bibliographies by topics / Huffman algorithm / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Huffman algorithm.

Dissertations / Theses on the topic 'Huffman algorithm'

Author: Grafiati

Published: 3 June 2025

Last updated: 1 August 2025

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

Select a source type:

Consult the top 18 dissertations / theses for your research on the topic 'Huffman algorithm.'

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.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Devulapalli, Venkata Lakshmi Narasimha. "Application of Huffman Data Compression Algorithm in Hashing Computation." TopSCHOLAR®, 2018. https://digitalcommons.wku.edu/theses/2614.

Full text

Abstract:

Cryptography is the art of protecting information by encrypting the original message into an unreadable format. A cryptographic hash function is a hash function which takes an arbitrary length of the text message as input and converts that text into a fixed length of encrypted characters which is infeasible to invert. The values returned by the hash function are called as the message digest or simply hash values. Because of its versatility, hash functions are used in many applications such as message authentication, digital signatures, and password hashing [Thomsen and Knudsen, 2005]. The purp

APA, Harvard, Vancouver, ISO, and other styles

2

Le, Thu Anh. "An Exploration of the Word2vec Algorithm: Creating a Vector Representation of a Language Vocabulary that Encodes Meaning and Usage Patterns in the Vector Space Structure." Thesis, University of North Texas, 2016. https://digital.library.unt.edu/ark:/67531/metadc849728/.

Full text

Abstract:

This thesis is an exloration and exposition of a highly efficient shallow neural network algorithm called word2vec, which was developed by T. Mikolov et al. in order to create vector representations of a language vocabulary such that information about the meaning and usage of the vocabulary words is encoded in the vector space structure. Chapter 1 introduces natural language processing, vector representations of language vocabularies, and the word2vec algorithm. Chapter 2 reviews the basic mathematical theory of deterministic convex optimization. Chapter 3 provides background on some concepts

APA, Harvard, Vancouver, ISO, and other styles

3

Maciel, Marcos Costa. "Compressão de dados ambientais em redes de sensores sem fio usando código de Huffman." Universidade Tecnológica Federal do Paraná, 2013. http://repositorio.utfpr.edu.br/jspui/handle/1/506.

Full text

Abstract:

Fundação do Amparo à Pesquisa do Estado do Amazonas (FAPEAM)<br>Nesta dissertação de mestrado é apresentada uma proposta de um método simples de compressão de dados sem perda para Redes de Sensores sem Fio (RSSF). Este método é baseado numa codificação Huffman convencional aplicada a um conjunto de amostras de parâmetros monitorados que possuam uma forte correlação temporal, fazendo com que seja gerado um dicionário Huffman a partir dessas probabilidades e que possam ser utilizadas em outros conjuntos de parâmetros de mesma característica. Os resultados de simulação usando temperatura e umidad

APA, Harvard, Vancouver, ISO, and other styles

4

Хованська, Т. А. "Проблеми створення і стиснення великих інформаційних сховищ і складів даних". Master's thesis, Сумський державний університет, 2019. http://essuir.sumdu.edu.ua/handle/123456789/76429.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Friedrich, Tomáš. "Komprese DNA sekvencí." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2010. http://www.nusl.cz/ntk/nusl-237222.

Full text

Abstract:

The increasing volume of biological data requires finding new ways to save these data in genetic banks. The target of this work is design and implementation of a novel algorithm for compression of DNA sequences. The algorithm is based on aligning DNA sequences agains a reference sequence and storing only diferencies between sequence and reference model. The work contains basic prerequisities from molecular biology which are needed for understanding of algorithm details. Next aligment algorithms and common compress schemes suitable for storing of diferencies agains reference sequence are descri

APA, Harvard, Vancouver, ISO, and other styles

6

Dvořák, Martin. "Výukový video kodek." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2012. http://www.nusl.cz/ntk/nusl-219882.

Full text

Abstract:

The first goal of diploma thesis is to study the basic principles of video signal compression. Introduction to techniques used to reduce irrelevancy and redundancy in the video signal. The second goal is, on the basis of information about compression tools, implement the individual compression tools in the programming environment of Matlab and assemble simple model of the video codec. Diploma thesis contains a description of the three basic blocks, namely - interframe coding, intraframe coding and coding with variable length word - according the standard MPEG-2.

APA, Harvard, Vancouver, ISO, and other styles

7

陳宏綜. "A Memory-Efficient and Fast Huffman Decoding Algorithm." Thesis, 1999. http://ndltd.ncl.edu.tw/handle/64740387702559843977.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>管理研究所資訊管理學程<br>87<br>To reduce the memory size and speed up the process of searching for a symbol in a Huffman tree, we propose a memory-efficient array data structure to represent the Huffman tree. Then, we present a fast Huffman decoding algorithm, which takes O(mlog n) time and uses 3n/2 + n/2logn + 1 memory space, where n is the number of symbols in a Huffman tree.

APA, Harvard, Vancouver, ISO, and other styles

8

Lin, Yi-Kai, and 林義凱. "A Space-Efficient Huffman Decoding Algorithm and its Parallelism." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/51208485736616000258.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Lin, Yih-Kai, and 林義凱. "A Space-Efficient Huffman Decoding Algorithm and its Parallelism." Thesis, 1997. http://ndltd.ncl.edu.tw/handle/72819908164921559975.

Full text

Abstract:

碩士<br>國立台灣工業技術學院<br>管理技術研究所<br>85<br>This paper first transforms the Huffman treeinto a single--side growing Huffman tree, then presents a memory--efficientdata structure to represent the single--side growing Huffman tree, whichrequires $O((n+d)\lceil \log_{2} n \rceil)$--bits memory space, where $n$ isthenumber of source symbols and $d$ is the depth of the Huffman tree.Based on the proposed data structure, we present an$O(d)$--timeHuffman decoding algorithm.Using the sameexample, thememory

APA, Harvard, Vancouver, ISO, and other styles

10

ho, Han-chang, and 何函璋. "A Fast Huffman Decoding Algorithm by Multiple Bit Length Search Scheme for the MPEG-4 AAC." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/04149818862470676859.

Full text

Abstract:

碩士<br>國立成功大學<br>電機工程學系碩博士班<br>97<br>Huffman coding is an important part in MPEG-4 Advanced Audio Coding（AAC）standard. The function of Huffman coding is to encode the input data stream with shorter length of bit string so that the audio samples can be compressed into smaller size. The compressed data can be recovered by Huffman decoding in decoder side. The process of Huffman decoding requires long delay because long computational time is consumed by the excessive number of searches for the decoded symbols. In this paper, a fast Huffman decoding algorithm is proposed to reduce the number of se

APA, Harvard, Vancouver, ISO, and other styles

11

Patra, Nilkesh, and Sila Siba Sankar. "Data Reduction by Huffman Coding and Encryption by Insertion of Shuffled Cyclic Redundancy Code." Thesis, 2007. http://ethesis.nitrkl.ac.in/49/1/10307034.pdf.

Full text

Abstract:

Cryptography today is assumed as the study of techniques and applications of securing the integrity and authenticity of transfer of information under difficult circumstances. It uses mathematical techniques related to aspects of information security such as confidentiality, data integrity, entity authentication, and data origin authentication. The encryption here mainly of two types. They are private and public key cryptography.

APA, Harvard, Vancouver, ISO, and other styles

12

林垂慶. "Huffman Codec Design Based H.263+ Video Encryption Algorithms." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/56514332526578049996.

Full text

Abstract:

碩士<br>國立暨南國際大學<br>資訊工程學系<br>92<br>With the advancement of science and technology, the transmission of digital video data becomes more and more popular. Such as video conference system and online pay-TV which may be grabbed by a hacker. Hence, in order to prevent data piracy and plagiarism, the encryption of multimedia data becomes an extremely important issue. In this paper, we propose an efficient encryption framework which wouldn’t influence seriously the coding speed and compression efficiency of the original codec system. Since, no matter while employing bit-scrambling technique

APA, Harvard, Vancouver, ISO, and other styles

13

Wu, Wei-I., and 吳威怡. "Bit- and Trellis- Based Joint Huffman and Convolutional Sequential Decoding Algorithms." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/05464860396541934297.

Full text

Abstract:

碩士<br>國立暨南國際大學<br>資訊工程學系<br>96<br>According to the Shannon’s separation theory, the performance of the overall system is optimal while the source coding and the channel coding are separately optimized. However, due to the constraints on complexity and delay, the performance of separate decoding is usually not optimal. In the past, in order to further improve the performance of separate decoding, the residual redundancy left after compression, the source priori information, and the channel statictical information are exploited and fully utilized for presenting a so-called joint source-channel d

APA, Harvard, Vancouver, ISO, and other styles

14

Hussain, Fatima Omman. "Indirect text entry interfaces based on Huffman coding with unequal letter costs /." 2008. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR45965.

Full text

Abstract:

Thesis (M.Sc.)--York University, 2008. Graduate Programme in Science.<br>Typescript. Includes bibliographical references (leaves 223-232). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR45965

APA, Harvard, Vancouver, ISO, and other styles

15

Shih, Jing-Wun, and 施景文. "FPGA implementations of IP routing-lookup and Huffman decoder algorithms based on Binary Decision Diagrams." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/31059390867997949287.

Full text

Abstract:

碩士<br>龍華科技大學<br>電子系碩士班<br>95<br>Since Binary Decision Diagram technique has the function of node sharing, it can eliminate redundant nodes and reduce the cost of combination circuit efficiently. In this paper, we have implemented an IP routing lookup and Huffman decoder with Binary Decision Diagram in FPGA. The Internet traffic is rapidly growing because of the increase of users and the multimedia applications. With the increased traffic, fast link speed and routers are required. Currently, since gigabit links are available, the chief bottleneck of the traffic has been moved from the links to

APA, Harvard, Vancouver, ISO, and other styles

16

Cruz, Kouichi Julián Andrés. "Desarrollo de un algoritmo de compresión de datos optimizado para imágenes satelitales." Bachelor's thesis, 2017. http://hdl.handle.net/11086/5863.

Full text

Abstract:

Tesis (Lic. en Ciencias de la Computación)--Universidad Nacional de Córdoba, Facultad de Matemática, Astronomía, Física y Computación, 2017.<br>Las imágenes satelitales son cada vez de mayor tamaño, de tal manera que hoy en dı́a hablar en términos de gigabytes ya es normal. A la hora de generar productos que formen un mosaico también nos encontramos con grandes volúmenes lo cual no solo dificulta el procesamiento sino también la transferencia o distribución de los mismos hacia los usuarios. Finalmente, también tenemos el problema del manejo de los datos tanto a bordo de la plataforma del satél

APA, Harvard, Vancouver, ISO, and other styles

17

Saradha, R. "Malware Analysis using Profile Hidden Markov Models and Intrusion Detection in a Stream Learning Setting." Thesis, 2014. http://etd.iisc.ac.in/handle/2005/3129.

Full text

Abstract:

In the last decade, a lot of machine learning and data mining based approaches have been used in the areas of intrusion detection, malware detection and classification and also traffic analysis. In the area of malware analysis, static binary analysis techniques have become increasingly difficult with the code obfuscation methods and code packing employed when writing the malware. The behavior-based analysis techniques are being used in large malware analysis systems because of this reason. In prior art, a number of clustering and classification techniques have been used to classify the malware

APA, Harvard, Vancouver, ISO, and other styles

18

Saradha, R. "Malware Analysis using Profile Hidden Markov Models and Intrusion Detection in a Stream Learning Setting." Thesis, 2014. http://hdl.handle.net/2005/3129.

Full text

Abstract:

In the last decade, a lot of machine learning and data mining based approaches have been used in the areas of intrusion detection, malware detection and classification and also traffic analysis. In the area of malware analysis, static binary analysis techniques have become increasingly difficult with the code obfuscation methods and code packing employed when writing the malware. The behavior-based analysis techniques are being used in large malware analysis systems because of this reason. In prior art, a number of clustering and classification techniques have been used to classify the malware

APA, Harvard, Vancouver, ISO, and other styles

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!