A MODIFICATION OF HUFFMAN'S IMPULSE-EQUIVALENT PULSE TRAINS TO INCREASE SIGNAL ENERGY UTILIZATION.HUFFMAN DL.1974; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1974; VOL. 20; NO 4; PP. 559-561; BIBL. 2 REF.Article

BEST HUFFMAN TREESMARKOWSKY G.1981; ACTA INF.; ISSN 0001-5903; DEU; DA. 1981; VOL. 16; NO 3; PP. 363-370; BIBL. 5 REF.Article

ON THE REDUNDANCY OF BINARY HUFFMAN CODESJOHNSEN O.1980; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1980; VOL. 26; NO 2; PP. 220-222; BIBL. 4 REF.Article

MODIFIED BARKER AND HUFFMAN SEQUENCES IN COMBINATION CODES.HUFFMAN DL.1977; I.E.E.E. TRANS. AEROSPACE ELECTRON. SYST.; U.S.A.; DA. 1977; VOL. 13; NO 4; PP. 408-413; BIBL. 5 REF.Article

HUFFMAN CODES AND SELF-INFORMATION.KATONA GOH; NEMETZ TOH.1976; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1976; VOL. 22; NO 3; PP. 337-340; BIBL. 2 REF.Article

COMMENTS ON A PAPER BY T.C. CHEN AND I.T. HO.SMITH AJ.1975; COMMUNIC. A.C.M.; U.S.A.; DA. 1975; VOL. 18; NO 3; PP. 463; BIBL. 6 REF.Article

The Longo-Galasso criterion for Huffman codes: an extended versionFABRIS, F.Alta frequenza. 1989, Vol 58, Num 1, pp 35-38, issn 0002-6557, 4 p.Article

FILE ARCHIVAL TECHNIQUES USING DATA COMPRESSIONPECHURA M.1982; COMMUN. ACM; ISSN 0001-0782; USA; DA. 1982; VOL. 25; NO 9; PP. 605-609; BIBL. 11 REF.Article

EXPERIMENTS IN TEXT FILE COMPRESSION.RUBIN F.1976; COMMUNIC. A.C.M.; U.S.A.; DA. 1976; VOL. 19; NO 11; PP. 617-623; BIBL. 7 REF.Article

On the data expansion of the Huffman compression algorithmDE PRISCO, R; DE SANTIS, A.Computer journal (Print). 1998, Vol 41, Num 3, pp 137-144, issn 0010-4620Article

Is every compact code Huffman ?WOOD, J. H.Discrete mathematics. 1992, Vol 110, Num 1-3, pp 297-299, issn 0012-365XArticle

Algorithms for adaptive Huffman codesCORMACK, G. V; MORSPOOL, R. N.Information processing letters. 1984, Vol 18, Num 3, pp 159-165, issn 0020-0190Article

Dynamic mixed huffman codesULACHA, Grzegorz; STASINSKI, Ryszard.International conference on signals and electronic systems. 2005, pp 537-540, isbn 83-906074-7-6, 1Vol, 4 p.Conference Paper

Bounds on the redudancy of Huffman codesCAPOCELLI, R. M; GIANCARLO, R; TANEJA, I. J et al.IEEE transactions on information theory. 1986, Vol 32, Num 6, pp 854-857, issn 0018-9448Article

SOURCES WHICH MAXIMIZE THE CHOICE OF A HUFFMAN CODING TREEGOLOMB SW.1980; INFORM. CONTROL.; ISSN 0019-9958; USA; DA. 1980; VOL. 45; NO 3; PP. 263-272; BIBL. 7 REF.Article

VARIATIONS ON A THEME BY HUFFMANGALLAGER RG.1978; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1978; VOL. 24; NO 6; PP. 668-674; BIBL. 2 REF.Article

PRACTICAL APPLICATION OF IRREDUCIBLE CODINGS: VIRTUAL EXTENSION OF STORAGE CAPACITY.HANTOS P.1977; PERIOD. POLY TECH., ELECTR. ENGNG; HUN; DA. 1977; VOL. 21; NO 4; PP. 309-324; BIBL. 11 REF.Article

MINIMUM VARIANCE HUFFMAN CODESKOU LT.1982; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 1; PP. 138-148; BIBL. 9 REF.Article

CONDITIONS FOR OPTIMALITY OF THE HUFFMAN ALGORITHMPARKER DS JR.1980; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1980; VOL. 9; NO 3; PP. 470-489; BIBL. 31 REF.Article

ANALOGUE DE LA METHODE DE HUFFMAN POUR LA SOMMATION OPTIMALE DES NOMBRES EN VIRGULE FLOTTANTEPYABKO B YA.1977; DISKRETN. ANAL.; SUN; DA. 1977; NO 30; PP. 38-45; BIBL. 11 REF.Article

ON THE OPTIMALITY OF HUFFMAN TREES.GLASSEY CR; KARP RM.1976; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1976; VOL. 31; NO 2; PP. 368-378; BIBL. 4 REF.Article

AN APPLICATION OF INFORMATIONAL DIVERGENCE TO HUFFMAN CODESLONGO G; GALASSO G.1982; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1982; VOL. 28; NO 1; PP. 36-43; BIBL. 9 REF.Article

A COMPARISON OF TWO SOURCE ENCODING SCHEMESKUMAR KB.1978; I.E.E.E. TRANS. COMMUNIC.; USA; DA. 1978; VOL. 26; NO 6; PP. 887-892; BIBL. 6 REF.Article

Markov-Huffman coding of LPC parametersPAPAMICHALIS, P. E.IEEE transactions on acoustics, speech, and signal processing. 1985, Vol 33, Num 2, pp 451-453, issn 0096-3518Article

Page / 11