Optimum quantizer performance for a class of non-Gaussian memoryless sourcesFARVARDIN, N; MODESTINO, J. W.IEEE transactions on information theory. 1984, Vol 30, Num 3, pp 485-497, issn 0018-9448Article

Source coding bounds using quantizer reproduction levelsPEARLMAN, W. A; CHEKIMA, A.IEEE transactions on information theory. 1984, Vol 30, Num 3, pp 559-567, issn 0018-9448Article

Fixed-rate universal lossy source coding and rates of convergence for memoryless sourcesLINDER, T; LUGOSI, G; ZEGER, K et al.IEEE transactions on information theory. 1995, Vol 41, Num 3, pp 665-676, issn 0018-9448Article

Minimum breakdown degradation in binary source encodingBERGER, T; ZHEN ZHANG.IEEE transactions on information theory. 1983, Vol 29, Num 6, pp 807-814, issn 0018-9448Article

Some notes on varn codingSAVARI, S. A.IEEE transactions on information theory. 1994, Vol 40, Num 1, pp 181-186, issn 0018-9448Article

Uniform and piecewise uniform lattice vector quantization for memoryless Gaussian and Laplacian sourcesDAE GWON JEONG; GIBSON, J. D.IEEE transactions on information theory. 1993, Vol 39, Num 3, pp 786-804, issn 0018-9448Article

An upper bound on the key equivocation for pure ciphersBLOM, R. J.IEEE transactions on information theory. 1984, Vol 30, Num 1, pp 82-84, issn 0018-9448Article

An algorithm for source coding subject to a fidelity criterion, based on string matchingSTEINBERG, Y; GUTMAN, M.IEEE transactions on information theory. 1993, Vol 39, Num 3, pp 877-886, issn 0018-9448Article

On secret sharing communications systems with two or three channelsYAMAMOTO, H.IEEE transactions on information theory. 1986, Vol 32, Num 3, pp 387-393, issn 0018-9448Article

TRELLIS ENCODING OF CONTINUOUS-AMPLITUDE MEMORYLESS SOURCES.WILSON SG; LYTLE DW.1977; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1977; VOL. 23; NO 3; PP. 404-409; BIBL. 12 REF.Article

A NEW UNIVERSAL CODING SCHEMA FOR THE BINARY MEMORYLESS SOURCE.LAWRENCE JC.1977; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1977; VOL. 23; NO 4; PP. 466-472; BIBL. 7 REF.Article

TO GET A BIT OF INFORMATION MAY BE AS HARD AS TO GET FULL INFORMATIONAHLSWEDE R; CSISZAR I.1981; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1981; VOL. 27; NO 4; PP. 398-408; BIBL. 10 REF.Article

A VARIABLE-LENGTH SOURCE CODING THEOREM FOR CORRELATED INFORMATION SOURCES.SHYUE CHING LU.1977; PROC. I.E.E.E.; U.S.A.; DA. 1977; VOL. 65; NO 7; PP. 1078-1079; BIBL. 3 REF.Article

ON BOUNDS OF GEOMETRIC RATE DISTORSION.MITTER J; MATHUR D.1976; STATISTICA; ITAL.; DA. 1976; VOL. 36; NO 1; PP. 159-168; ABS. ITAL. FR.; BIBL. 7 REF.Article

LINEAR CODES FOR SOURCES AND SOURCE NETWORKS: ERROR EXPONENTS, UNIVERSAL CODINGCSISZAR I.1982; IEEE TRANSACTIONS ON INFORMATION THEORY; ISSN 0018-9448; USA; DA. 1982; VOL. 28; NO 4; PP. 585-592; BIBL. 23 REF.Article

AN EASILY IMPLEMENTABLE UNIVERSAL CODE FOR THE BINARY SOURCEMACKENTHUN KM JR.1982; IEEE TRANSACTIONS ON INFORMATION THEORY; ISSN 0018-9448; USA; DA. 1982; VOL. 28; NO 4; PP. 646-648; BIBL. 6 REF.Article

ON A SOURCE-CODING PROBLEM WITH TWO CHANNELS AND THREE RECEIVERSOZAROW L.1980; BELL SYST. TECH. J.; ISSN 0005-8580; USA; DA. 1980; VOL. 59; NO 10; PP. 1909-1921; BIBL. 5 REF.Article

ASYMPTOTIC PERFORMANCE OF BLOCK QUANTIZERS WITH DIFFERENCE DISTORTION MEASURESYAMADA Y; TAZAKI S; GRAY RM et al.1980; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1980; VOL. 26; NO 1; PP. 6-14; BIBL. 12 REF.Article

HOW TO ENCODE THE MODULO-TWO SUM OF BINARY SOURCESKORNER J; MARTON K.1979; IEEE TRANS. INFORM. THEORY; USA; DA. 1979; VOL. 25; NO 2; PP. 219-221; BIBL. 7 REF.Article

ENCODING OF UNIFILAR RENEWAL SOURCES.BUDIHARDJO PS; MARK JW.1977; INFORM. AND CONTROL; U.S.A.; DA. 1977; VOL. 34; NO 1; PP. 38-49; BIBL. 7 REF.Article

ON THE RATE DISTORTION FUNCTION OF A MEMORYLESS GAUSSIAN VECTOR SOURCE WHOSE COMPONENTS HAVE FIXED VARIANCES.LEUNG HM; CAMBANIS S.1977; INFORM. AND CONTROL; U.S.A.; DA. 1977; VOL. 34; NO 3; PP. 198-209; BIBL. 4 REF.Article

SOURCE CODE ERROR BOUND IN THE EXCESS RATE REGION.SAMAR SINGH; KAMBO NS.1977; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1977; VOL. 23; NO 1; PP. 65-70; BIBL. 8 REF.Article

MINIMIZING THE WORST-CASE DISTORTION IN CHANNEL SPLITTINGWITSENHAUSEN HS.1981; BELL SYST. TECH. J.; ISSN 0005-8580; USA; DA. 1981; VOL. 60; NO 8; PP. 1979-1983; BIBL. 4 REF.Article

A SOURCE MATCHING APPROACH TO FINDING MINIMAX CODESDAIVSSON LD; LEON GARCIA A.1980; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1980; VOL. 26; NO 2; PP. 166-174; BIBL. 14 REF.Article

RANDOM CODING STRATEGIES FOR MINIMUM ENTROPY.POSNER EC.1975; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1975; VOL. 21; NO 4; PP. 388-391; BIBL. 8 REF.Article