Óíèâåðñàëüíûå àëãîðèòìû ñæàòèÿ äàííûõ:

Ìåòîäû Õàôôìàíà è Øåííîíà-Ôàíî

>> Ðóññêèå ìàòåðèàëû | Àíãëèéñêèå ìàòåðèàëû | Èñõîäíûå òåêñòû êîìïðåññîðîâ

Ñìîòðèòå òàêæå ìàòåðèàëû:
- Ìåòîäû Õàôôìàíà è Øåííîíà-Ôàíî
- Àðèôìåòè÷åñêîå ñæàòèå
- Êîäèðîâàíèå öåëûõ ÷èñåë
- Îáçîðû óíèâåðñàëüíûõ àëãîðèòìîâ ñæàòèÿ äàííûõ
- Êíèãà "Ìåòîäû ñæàòèÿ äàííûõ". Ðàçäåë 1 "Ìåòîäû ñæàòèÿ áåç ïîòåðü"

>> Ðóññêèå ìàòåðèàëû | Àíãëèéñêèå ìàòåðèàëû | Èñõîäíûå òåêñòû êîìïðåññîðîâ
Àâòîðû Íàçâàíèå Îïèñàíèå Ðåéòèíã
Jones G. Êîäèðîâàíèå ñ ìèíèìàëüíîé èçáûòî÷íîñòüþ ïî ìåòîäó Õàôôìýíà. Îïèñàíèå è ðåàëèçàöèÿ ñòàòè÷åñêîãî è àäàïòèâíîãî àëãîðèòìîâ êîäèðîâàíèÿ ïî Õàôôìàíó.
Èç êíèãè: Ã. Äæîóíç. Ïðîãðàììèðîâàíèå íà ÿçûêå îêêàì. - Ì.: Ìèð,1989.
TXT.RAR  15 êáàéò
5
Àëåêñàíäðîâ Î.Å., Ïîïêîâ Â.È. Êîìïðåññèÿ äàííûõ èëè èçìåðåíèå è èçáûòî÷íîñòü èíôîðìàöèè. Ìåòîä Õàôôìàíà Ìåòîäè÷êà ê ëàáîðàòîðíîé ðàáîòå. Êðàòêèé îáçîð ñïîñîáîâ ñæàòèÿ, èçó÷åíèå ìåòîäà Õàôôìàíà. Âðîäå êàê ñòàòè÷åñêèé àëãîðèòì ðàññìîòðåí õîðîøî.
Àâòîðñêàÿ ñòðàíèöà
Ìåòîäè÷åñêèå óêàçàíèÿ ê ëàáîðàòîðíîé ðàáîòå /Î. Å. Àëåêñàíäðîâ. Åêàòåðèíáóðã: ÓÃÒÓ, 2000. 52ñ.
PDF.RAR  458 êáàéò
Èñõîäíèêè íà Pascal, ïðèëàãàåìûå ê ìåòîäè÷êå:
ñêà÷àòü  54 êáàéò
5
Ñèìàêîâ À. Êîä Õàôôìàíà Õîðîøåå îïèñàíèå èäåè ìåòîäà Õàôôìàíà è àëãîðèòìà êîäèðîâàíèÿ-äåêîäèðîâàíèÿ ñòàòè÷åñêèõ êîäîâ. Ñì. òàêæå ðåàëèçàöèþ SHCODEC íèæå.
Ñûêòûâêàðñêèé Ãîñóäàðñòâåííûé Óíèâåðñèòåò, Êàôåäðà Ïðèêëàäíîé Ìàòåìàòèêè, îêòÿáðü 2002.
HTML  60 êáàéò
HTML.RAR  28 êáàéò
5
tiger Êîäèðîâàíèå Øåííîíà-Ôàíî Êðàòêîå îïèñàíèå ìåòîäà Øåííîíà-Ôàíî ñ äåìîíñòðàöèîííîì ïðèìåðîì ðåàëèçàöèè.
2002. Àâòîðñêàÿ ñòðàíèöà: http://aforge.ibd.lv/?8
HTML  15 êáàéò
HTML.RAR  3 êáàéò
Ïðèìåð ðåàëèçàöèè íà C++  26 êáàéò
?
Ñàìîéëîâ Ì.Þ., Ñàìîéëîâà Ò.À. Èñïîëüçîâàíèå ìàòðè÷íûõ îïåðàöèé ïðè ïîñòðîåíèè äåðåâà Õàôôìåíà Íà ïðèìåðå øèðîêî èçâåñòíîãî ìåòîäà êîäèðîâàíèÿ, îñíîâàííîãî íà ïîñòðîåíèè äåðåâà Õàôôìåíà, ðàññìîòðåíà âîçìîæíîñòü ïàðàëëåëüíûõ âû÷èñëåíèé ñ èñïîëüçîâàíèåì ìàòðè÷íîãî ïðåäñòàâëåíèÿ äàííûõ è ñïåöèàëüíî îïðåäåëÿåìîé îïåðàöèè ìàòðè÷íîãî óìíîæåíèÿ íàä íèìè. Ïîëó÷åíû âðåìåííûå îöåíêè íàèáîëåå òðóäîåìêèõ ïî âû÷èñëèòåëüíîé ñëîæíîñòè ýòàïîâ êîäèðîâàíèÿ ïðè èõ ðåàëèçàöèè íà ñóïåðêîìïüþòåðàõ.
Ìàòåìàòè÷åñêàÿ ìîðôîëîãèÿ. Ýëåêòðîííûé ìàòåìàòè÷åñêèé è ìåäèêî-áèîëîãè÷åñêèé æóðíàë. Ðóññêàÿ âåðñèÿ 2.0. -Òîì 2. -Âûï.2.-1997.-246 ñ.-Ñìîëåíñê:ÑÃÌÀ
HTML.RAR  42 êáàéò
?
Ìàñòðþêîâ Ä. Ñæàòèå ïî Õàôôìåíó Îïèñàíèå àäàïòèâíîãî àëãîðèòìà ñæàòèÿ ïî Õàôôìàíó.
Àëãîðèòìû ñæàòèÿ èíôîðìàöèè. ×àñòü 1. Ñæàòèå ïî Õàôôìåíó. //Ìîíèòîð, 1993. - N7-8.
PDF  190 êáàéò
DOC.RAR  40 êáàéò
×àñòü ñòàòüè:
HTML.RAR  27 êáàéò
Èñõîäíèê íà C ê ñòàòüå:
ñêà÷àòü  6 êáàéò
5
Íåâåñåíêî Í.Â. Õàôôìàí â ïëàíå ìèíèìèçàöèè ïðîãðàììû Äàåòñÿ ïðàêòè÷åñêîå îïèñàíèå êîäèðîâàíèÿ ïî Õàôôìàíó. Îïèñûâàþòñÿ àëãîðèòìû ñæàòèÿ è ðàñïàêîâêè, ïîçâîëÿþùèå ìèíèìèçèðîâàòü ðàçìåð êîäåðà è äåêîäåðà. Ïðèâîäÿòñÿ èëëþñòðàöèè ðåàëèçàöèè íà Àññåìáëåðå.
22.10.2002
Àâòîðñêàÿ ñòðàíèöà
Òåêñò â HTML
?
ßíêîâîé Ì. Äèíàìè÷åñêîå ñæàòèå ìåòîäîì Õàôôìàíà Íåôîðìàëüíîå îïèñàíèå äèíàìè÷åñêîãî (àäàïòèâíîãî) àëãîðèòìà. Ê òåêñòó ïðèëàãàþòñÿ èñõîäíèêè íà Visual Basic + Asm.
HTML
RTF.RAR  33 êáàéò
èñõîäíûé êîä ðåàëèçàöèè  29 êáàéò
4
Êîøêèí Ã.Ì. Ýíòðîïèÿ è èíôîðìàöèÿ Ñîäåðæèò êðàòêîå íåôîðìàëüíîå îïèñàíèå êîäèðîâàíèÿ Øåííîíà-Ôàíî íà êîíêðåòíîì ïðèìåðå. Òàêæå ðàññìîòðåíû îñíîâíûå ñâîéñòâà ýíòðîïèè è èíôîðìàöèè äëÿ äèñêðåòíûõ ñëó÷àéíûõ îáúåêòîâ.
Ñîðîñîâñêèé îáðàçîâàòåëüíûé æóðíàë, 2001, N 11, ñ. 122–127.
PDF.RAR  90 êáàéò
3


>> Ðóññêèå ìàòåðèàëû | Àíãëèéñêèå ìàòåðèàëû | Èñõîäíûå òåêñòû êîìïðåññîðîâ
Huffman D. A Method for the Construction of Minimum-Redundancy Codes
Îðèãèíàëüíàÿ ñòàòüÿ Õàôôìàíà
An optimum method of coding an ensemble of messages consisting of a finite number of members is developed. A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.
Proceedings of IRE, vol.40, N9, pp.1098-1101, September 1952.
PDF  332 êáàéò
5
Gallager R. Variations on a Theme by Huffman Õîðîøåå îïèñàíèå êàíîíè÷åñêèõ êîäîâ Õàôôìàíà. Îðèãèíàëüíîå îïèñàíèå àëãîðèòìà ïîñòðîåíèÿ àäàïòèâíûõ êîäîâ.
IEEE Transactions on Information Theory, Vol. IT-24, No. 6, Nov. 1978. pp. 668-674.
PDF.RAR  133 êáàéò
5
Hirschberg D., Lelewer D. Efficient decoding of prefix codes Õîðîøåå îïèñàíèå íåñêîëüêèõ ñïîñîáîâ äåêîäèðîâàíèÿ êîäîâ Õàôôìàíà.
Communications of the ACM, vol.33, No.4, 1990, pp.449-459.
PDF.RAR  108 êáàéò
PS.RAR  47 êáàéò
5
Abrahams J. Huffman Code Trees and Variants Êðàòêèé îáçîð ëèòåðàòóðû, ïîñâÿùåííîé êîäàì Õàôôìàíà.
DIMACS, Rutgers University.
PDF.RAR  44 êáàéò
5
De Prisco R., De Santis R. On the Data Expansion of the Huffman Compression Algorithm Äîêàçàíî, ÷òî âåðõíÿÿ ãðàíèöà (õóäøèé ñëó÷àé) óâåëè÷åíèÿ äëèíû çàêîäèðîâàííîé ïî àëãîðèòìó Õàôôìàíà ïîñëåäîâàòåëüíîñòè ðàâíà 1.256 áèòàì íà êàæäûé èñõîäíûé ñèìâîë.
The Computer Journal, Volume 41, No. 3, 1998, pp. 137-144.
PDF.RAR  77 êáàéò
PS.RAR    56 êáàéò
3
Schindler M. Practical Huffman coding Îïèñàíèå îñíîâíûõ ïðèåìîâ äëÿ ýôôåêòèâíîé ðåàëèçàöèè êîäèðîâàíèÿ ïî Õàôôìàíó.
Ñàéò "Data Compression Consulting", Aug., Oct. 1998.
HTML.RAR  11 êáàéò
5
Moffat A., Turpin A. On the Implementation of Minimum Redundancy Prefix Codes Îïèñàíèå ïðèåìîâ ýôôåêòèâíîãî êîäèðîâàíèÿ è äåêîäèðîâàíèÿ êîäîâ Õàôôìàíà.
IEEE Transactions on Communications, Vol. 45, No. 10, pp.1200-1207, Oct. 1997.
PDF.RAR  175 êáàéò
5
Milidiu R., Pessoa A., Laber E. Three Space-Economical Algorithms for Calculating Minimum-Redundancy Prefix Codes ...we present the Fast LazyHuff (F-LazyHuff), the Economical LazyHuff (E-LazyHuff), and the Best LazyHuff (B-LazyHuff) algorithms. F-LazyHuff runs in O(n) time but requires O(min{H^2, n}) additional space (H is the length of the greatest codeword). On the other hand, E-LazyHuff runs in O(n + n log(n/H)) time, requiring only O(H) additional space. Finally, B-LazyHuff asymptotically overcomes the previous algorithms, requiring only O(n) time and O(H) additional space...
IEEE Transactions on Information Theory, Vol. 47, No. 6, pp.2185-2198, Sep. 2001.
PDF.RAR  322 êáàéò
?
Long D., Jia W. Optimal Maximal Prefix Coding and Huffman Coding ...Novel maximal prefix coding different from the Huffman coding is introduced. Relationships between the Huffman coding and optimal maximal prefix coding are discussed... Comparing with the Huffman coding, maximal prefix coding is a more flexible compression method.
Proceedings of The Seventh International Conference on Distributed Multimedia Systems, Taipei, Taiwan, Sept. 26-28, 2001, pp. 101-107.
PDF.RAR  246 êáàéò
PS.RAR    187 êáàéò
?
Chowdhury R.A., Kaykobad M. An Efficient Decoding Technique for Huffman Codes We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular leaf nodes (nodes with two adjacent external nodes), the number of which is always bounded above by half the number of symbols...
Information Processing Letter, Vol. 81, N. 6, pp.305--308, March 2002
PDF.RAR  99 êáàéò
PS.RAR    80 êáàéò
?
Fraenkel A.S., Klein Sh.T. Bidirectional Huffman Coding Under what conditions can Huffman codes be efficiently decoded in both directions? The usual decoding procedure works also for backward decoding only if the code has the affix property, i.e., both preffix and suffix properties. Some affix Huffman codes are exhibited, and necessary conditions for the existence of such codes are given. An algorithm is presented which, for a given set of codeword lengths, constructs an affix code, if there exists one. Since for many distributions there is no affix code giving the same compression as the Huffman code, a new algorithm for backward decoding of non-affix Huffman codes is presented...
August 1989
PDF.RAR  262 êáàéò
PS.RAR    114 êáàéò
?
Bookstein A., Klein Sh.T. Is Huffman Coding Dead? In recent publications about data compression, arithmetic codes are often suggested as the state of the art, rather than the more popular Huffman codes. While it is true that Huffman codes are not optimal in all situations, we show that the advantage of arithmetic codes in compression performance is often negligible. Referring also to other criteria, we conclude that for many applications, Huffman codes should still remain a competitive choice.
1998
PDF.RAR  231 êáàéò
PS.RAR    103 êáàéò
?


>> Ðóññêèå ìàòåðèàëû | Àíãëèéñêèå ìàòåðèàëû | Èñõîäíûå òåêñòû êîìïðåññîðîâ >> C/C++ | Pascal/Delphi | Assembler | Ïðî÷èå ÿçûêè

>> Èñõîäíûå òåêñòû êîìïðåññîðîâ >> C/C++ | Pascal/Delphi | Assembler | Ïðî÷èå ÿçûêè
Ïàâëîâ È. ARG Àðõèâàòîð, èñïîëüçóþùèé ñòàòè÷åñêèé àëãîðèòì Õàôôìàíà.
ßçûê: C
âåðñèÿ 1.00.001 BETA  16 êáàéò
?
Ìàñòðþêîâ Ä. Huffman Êîìïðåññîð, èñïîëüçóþùèé àäàïòèâíûé àëãîðèòì Õàôôìàíà.
ßçûê: C
Èç ñòàòüè "Àëãîðèòìû ñæàòèÿ èíôîðìàöèè. ×àñòü 1. Ñæàòèå ïî Õàôôìåíó"// Ìîíèòîð, N7-8, 1993.
ñêà÷àòü  6 êáàéò
4
MacDonald J. Dynamic Huffman Coding Ðåàëèçàöèÿ àäàïòèâíîãî àëãîðèòìà Õàôôìàíà â ñîîòâåòñòâèè ñî ñòàòüåé Êíóòà "Dynamic Huffman Coding" â J. of ACM, vol.6. Ñàì àëãîðèòì ðåàëèçîâàí â âèäå áèáëèîòåêè.
ßçûê: C
ñêà÷àòü  16 êáàéò
5
Vinokur A. n-ary Huffman Template Algorithm Øàáëîí äëÿ ðåàëèçàöèè êîäèðîâàíèÿ ïî Õàôôìàíó. Êîäîâûå ñëîâà ìîãóò áûòü n-àðíûìè. Âåñà ìîãóò áûòü, ñòðîãî ãîâîðÿ, íå÷èñëîâûìè. Åñòü ïðèìåðû èñïîëüçîâàíèÿ.
ßçûê: C++
Ñàéòû ïðîåêòà: íà SourceForge è ñòðàíèöà ñ äåòàëüíûì îïèñàíèåì
âåðñèÿ 2.3  90 êáàéò
?
Ñèìàêîâ À. SHCODEC è êîìïàíèÿ Ðåàëèçàöèÿ ñòàòè÷åñêîãî êîäèðîâàíèÿ ïî Õàôôìàíó. Èñïîëüçóåòñÿ òàê íàçûâàåìîå êàíîíè÷åñêîå äåêîäèðîâàíèå.
ßçûê: C
Ñòðàíèöà ïðîåêòà
SHCODEC, âåðñèÿ 1.0.1:
    ZIP  45 êáàéò
    TAR.GZ  15 êáàéò
Áèáëèîòåêà SHCLIB, ïðîèçâîäÿùàÿ ñæàòèå è ðàñïàêîâêó äàííûõ â ïàìÿòè:
    TAR.GZ áåç DLL  6 êáàéò
    ZIP ñ DLL  47 êáàéò
Óòèëèòà SHSFX ïðåâðàùàåò ôàéëû, çàêîäèðîâàííûå SHCODEC, â ñàìîðàñïàêîâûâàþùèåñÿ àðõèâû (sfx):
    ñêà÷àòü  29 êáàéò
?


>> Èñõîäíûå òåêñòû êîìïðåññîðîâ >> C/C++ | Pascal/Delphi | Assembler | Ïðî÷èå ÿçûêè
VVS Soft Group ArcHaf "Ëîáîâàÿ" ðåàëèçàöèÿ ñòàòè÷åñêîãî ìåòîäà Õàôôìàíà áåç âñÿêèõ çàòåé.
1992
ßçûê: Pascal
âåðñèÿ 1.0  4 êáàéò
2


>> Èñõîäíûå òåêñòû êîìïðåññîðîâ >> C/C++ | Pascal/Delphi | Assembler | Ïðî÷èå ÿçûêè
Ìèõååâ À. Huffman Êîìïðåññîð, èñïîëüçóþùèé ñòàòè÷åñêèé àëãîðèòì Õàôôìàíà.
ßçûê: Asm
âåðñèÿ 1.00  6 êáàéò
4


>> Èñõîäíûå òåêñòû êîìïðåññîðîâ >> C/C++ | Pascal/Delphi | Assembler | Ïðî÷èå ÿçûêè
ßíêîâîé Ì. DynamicHuffman Êîìïðåññîð, ðåàëèçóþùèé äèíàìè÷åñêèé àëãîðèòì ñæàòèÿ ïî Õàôôìàíó. Èìååòñÿ îïèñàíèå àëãîðèòìà.
ßçûê: Visual Basic, Asm
èñõîäíûé êîä  29 êáàéò
Îïèñàíèå:
HTML
RTF.RAR  33 êáàéò
?

Ñìîòðèòå òàêæå ìàòåðèàëû:
- Ìåòîäû Õàôôìàíà è Øåííîíà-Ôàíî
- Àðèôìåòè÷åñêîå ñæàòèå
- Êîäèðîâàíèå öåëûõ ÷èñåë
- Îáçîðû óíèâåðñàëüíûõ àëãîðèòìîâ ñæàòèÿ äàííûõ
- Êíèãà "Ìåòîäû ñæàòèÿ äàííûõ". Ðàçäåë 1 "Ìåòîäû ñæàòèÿ áåç ïîòåðü"

íàâåðõ