Buscar
Mostrando ítems 1-10 de 57
New bounds on D-ary optimal codes
(ELSEVIER, 2005-12-16)
We propose a simple method that, given a symbol distribution, yields upper and lower bounds on the average code length of a D-ary optimal code over that distribution. Thanks to its simplicity, the method permits deriving ...
Comparação entre os algoritmos de codificação Huffman e Lempel-Ziv para compressão de sinais de áudio após a filtragem
(Universidade Federal de UberlândiaBrasilEngenharia de Eletrônica e Telecomunicações, 2018)
Exact and experimental algorithms for a Huffman-based error detecting code
(BrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais, 2017)
Optimal prefix free codes with partial sorting
(MDPI, 2020)
We describe an algorithm computing an optimal prefix free code for n unsorted positive weights in time within O(n(1+lg alpha))subset of O(nlgn), where the alternation alpha is an element of[1..n-1] approximates the minimal ...
Optimal prefix free codes with partial sorting dagger
(MDPI, 2020)
We describe an algorithm computing an optimal prefix free code for n unsorted positive weights in time within O(n(1+lg alpha))subset of O(nlgn), where the alternation alpha is an element of[1..n-1] approximates the minimal ...
Compressão de dados ambientais em redes de sensores sem fio usando código de Huffman
(Universidade Tecnológica Federal do ParanáCuritibaPrograma de Pós-Graduação em Engenharia Elétrica e Informática Industrial, 2013-02-21)
In this masters thesis we present a lightweight lossless data compression method for wireless sensor networks(WSN). This method is based on a conventional Huffman coding applied to a sample set of monitored parameters that ...
New adaptive compressors for natural language text
(JOHN WILEY, 2008-11-10)
Semistatic byte-oriented word-based compression codes have been shown to be an attractive alternative to compress natural language text databases, because of the combination of speed, effectiveness, and direct searchability ...
Parity codes
(BrasilInstituto Tércio Pacitti de Aplicações e Pesquisas Computacionais, 2017)