[an error occurred while processing this directive] [an error occurred while processing this directive][an error occurred while processing this directive] [an error occurred while processing this directive] [an error occurred while processing this directive] [an error occurred while processing this directive] (none) [an error occurred while processing this directive] [an error occurred while processing this directive] [an error occurred while processing this directive] [an error occurred while processing this directive] [an error occurred while processing this directive][an error occurred while processing this directive] [an error occurred while processing this directive][an error occurred while processing this directive] [an error occurred while processing this directive][an error occurred while processing this directive] [an error occurred while processing this directive] [an error occurred while processing this directive] [an error occurred while processing this directive] (none) [an error occurred while processing this directive] [an error occurred while processing this directive] [an error occurred while processing this directive][an error occurred while processing this directive]
 
[an error occurred while processing this directive] [an error occurred while processing this directive]
Skåne Sjælland Linux User Group - http://www.sslug.dk Home   Subscribe   Mail Archive   Forum   Calendar   Search
MhonArc Date: [Date Prev] [Date Index] [Date Next]   Thread: [Date Prev] [Thread Index] [Date Next]   MhonArc
 

[PROGRAMMERING] Huffman code impl, storage mv.



Hej

Jeg har researched på Huffman coding og er i denne forbindelse kommet i tvivl om en række spørgsmål, som jeg håber nogle af jer kan besvare.....

Jeg har blandt andet hentet info fra følgende sites:

http://www.cs.duke.edu/csed/poop/huff/info/

http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Greedy/huffman.htm

Det angives som eksempel at bogstaverne a til f kan Huffman codes til følgende Variable-length Codes som er karakteriteret ved at de er non-prefix.

a   b     c     d     e        f
0 101 100 111 1101 1100

Nu vil jeg gerne høre om nogen kan besvare følgende - gerne kort - jeg har ikke tålmodighed til at læse flere hundrede liners kode igennem for at få en afklaring.

1) Hvordan og i hvilke(n) data type(r) stores og accesses Variable-length Codes som jo normalt implemeteres i et B-tree. Jeg stiller dette spørgsmål da det jo drejer sig om compression og jeg derfor vil finde det aldeles uhensigtmæssigt at anvende en data type som f.eks. optager en byte i memory og/eller fil til at store en eller tre bit.

2) Hvordan implementerer man typisk convertingen mellem compressed Variable-length Codes eller Fixed Length codes og uncompressed bit patterns f.eks. characters ? Jeg ser en del muligheder såsom tabel, array mv. Men igen det drejer som om compression og derfor om at anvende mindst mulig plads i compressed fil....

I må ha det derude ved tasterne

Thomas



 
Home   Subscribe   Mail Archive   Index   Calendar   Search

 
 
Questions about the web-pages to <www_admin>. Last modified 2007-04-01, 02:01 CEST [an error occurred while processing this directive]
This page is maintained by [an error occurred while processing this directive]MHonArc [an error occurred while processing this directive] # [an error occurred while processing this directive] *