Channels with block interferenceMCELIECE, R. J; STARK, W. E.IEEE transactions on information theory. 1984, Vol 30, Num 1, pp 44-53, issn 0018-9448Article

The capacity region of a class of deterministic interference channelsEL GAMAL, A. A; COSTA, M. H. M.IEEE transactions on information theory. 1983, Vol 28, Num 2, pp 343-346, issn 0018-9448Article

On the capacity of computer memory with defectsHEEGARD, C; EL GAMAL, A. A.IEEE transactions on information theory. 1983, Vol 29, Num 5, pp 731-739, issn 0018-9448Article

Secret sharing model : GS³LIN, P.-L; DUNHAM, J. G.Electronics Letters. 1994, Vol 30, Num 25, pp 2116-2118, issn 0013-5194Article

Information channels composed of memoryless componentsWINKELBAUER, K.Kybernetika. 1985, Vol 21, Num 3, pp 169-177, issn 0023-5954Article

A general coding scheme for the two-way channelTE SUN HAN.IEEE transactions on information theory. 1984, Vol 30, Num 1, pp 35-44, issn 0018-9448Article

Iteration procedure for the capacity of discrete memoryless channelWATANABE, Y.Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E. 1984, Vol 67, Num 8, pp 440-444, issn 0387-236XArticle

On multiple access channels with FeedbackWILLEMS, F. M. J.IEEE transactions on information theory. 1984, Vol 30, Num 6, pp 842-845, issn 0018-9448Article

ERROR EXPONENT FOR SOURCE CODING WITH A FIDELITY CRITERION.MARTON K.1974; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1974; VOL. 20; NO 2; PP. 197-199; BIBL. 10 REF.Article

Dependence balance bounds for single-output two-way channelsHEKSTRA, A. P; WILLEMS, F. M. J.IEEE transactions on information theory. 1989, Vol 35, Num 1, pp 44-53, issn 0018-9448, 10 p.Conference Paper

On the distance properties of Paaske's class of rates 2/3 and 3/4 convolutional codesCONAN, J.IEEE transactions on information theory. 1984, Vol 30, Num 1, pp 100-104, issn 0018-9448Article

On a coding theorem connected with useful entropy of order α and type βPRITI JAIN; TUTEJA, R. K.Kybernetika. 1987, Vol 23, Num 5, pp 420-427, issn 0023-5954Article

A branching process analysis of the average number of computations of the stack algorithmHACCOUN, D.IEEE transactions on information theory. 1984, Vol 30, Num 3, pp 497-508, issn 0018-9448Article

A note on the Arimoto-Blahut algorithm for computing the capacity of discrete memoryless channelsJURGENSEN, H.IEEE transactions on information theory. 1984, Vol 30, Num 2, pp 376-377, issn 0018-9448Article

Capacity per unit cost of a discrete memoryless channelABDEL-GHAFFAR, K. A. S.Electronics Letters. 1993, Vol 29, Num 2, pp 142-144, issn 0013-5194Article

On the Equivalence of Two Achievable Regions for the Broadcast ChannelYINGBIN LIANG; KRAMER, Gerhard; VINCENT POOR, H et al.IEEE transactions on information theory. 2011, Vol 57, Num 1, pp 95-100, issn 0018-9448, 6 p.Article

A note upon another error detecting code that is not properSOMMER, R. C.IEEE transactions on communications. 1985, Vol 33, Num 7, pp 719-720, issn 0090-6778Article

OPEC or a basis problem in source networkKÖRNER, J.IEEE transactions on information theory. 1984, Vol 30, Num 1, pp 68-77, issn 0018-9448Article

A HIERARCHY OF CODES FOR MEMORYLESS CHANNELSHASHIMOTO T; ARIMOTO S.1981; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1981; VOL. 27; NO 3; PP. 348-350; BIBL. 8 REF.Article

ON THE CAPACITY OF NOISY CHANNELS WITH ARBITRARY SIGNAL COSTS.CSISZAR I.1973; PROBL. CONTROL INFORM. THEORY; HUNGARY; DA. 1973; VOL. 2; NO 3-4; PP. 283-304; ABS. RUSSE; BIBL. 6 REF.Article

METHODE DE TRANSMISSION PAR BLOC D'UN SIGNAL A TRAVERS UN CANAL SANS MEMOIREBURNASHEV MV.1973; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1973; VOL. 9; NO 1; PP. 11-21; BIBL. 10 REF.Serial Issue

TREE ENCODING OF GAUSSIAN SOURCES.DICK RJ; BERGER T; JELINEK F et al.1974; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1974; VOL. 20; NO 3; PP. 332-336; BIBL. 11 REF.Article

RECONNAISSANCE DE DEUX SOURCES DE SIGNAUX DANS LE CAS GENERAL D'UN CANAL SYMETRIQUE SANS MEMOIRENESTERUK VF; PORFIR'EVA NN.1972; RADIOTEKHNIKA; S.S.S.R.; DA. 1972; VOL. 27; NO 9; PP. 91-94; BIBL. 4 REF.Serial Issue

AN ACHIEVABLE RATE REGION FOR THE MULTIPLE-ACCESS CHANNEL WITH FEEDBACKCOVER TM; LEUNG CSK.1981; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1981; VOL. 27; NO 3; PP. 292-298; BIBL. 15 REF.Article

A LOWER BOUNDING METHOD FOR CHANNEL AND SOURCE CODING PROBABILITIES.OMURA JK.1975; INFORM. CONTROL; U.S.A.; DA. 1975; VOL. 27; NO 2; PP. 148-177; BIBL. 13 REF.Article