CONSTRUCTION D'UN COUPLE DE CODES LINEAIRE DECODABLE UNIVOQUEMENT POUR UN CANAL SANS BRUIT A DEUX UTILISATEURSKHACHATRYAN GG.1981; PROBL. PEREDA. INF.; ISSN 0555-2923; SUN; DA. 1981; VOL. 17; NO 2; PP. 98-101; BIBL. 3 REF.Article

A BLOCK CODE FOR NOISELESS ASYNCHRONOUS MULTIPLE ACCESS OR CHANNELGYOERFI L; KEREKES I.1981; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1981; VOL. 27; NO 6; PP. 788-791; BIBL. 6 REF.Article

EXISTENCE OF GOOD DELTA -DECODABLE CODES FOR THE TWO-USER MULTIPLE-ACCESS ADDER CHANNELSHU LIN; KASAMI T; YAMAMURA S et al.1980; IBM J. RES. DEVELOP.; ISSN 0018-8646; USA; DA. 1980; VOL. 24; NO 4; PP. 486-495; BIBL. 12 REF.Article

CAPACITE D'UN CANAL DE COMMUNICATION QUANTIQUE AVEC UNE PHASE ALEATOIREFEDOROV SE; MART'YANOV AN.1981; PROBL. PEREDA. INF.; ISSN 0555-2923; SUN; DA. 1981; VOL. 17; NO 2; PP. 103-106; BIBL. 2 REF.Article

ON A CODING THOREM CONNECTED WITH RENYI'S ENTROPY.PREM NATH.1975; INFORM. AND CONTROL; U.S.A.; DA. 1975; VOL. 29; NO 3; PP. 234-242; BIBL. 11 REF.Article

CONSTRUCTION OF BOUNDED DELAY CODES FOR DISCRETE NOISELESS CHANNELSFRANASZEK PA.1982; IBM J. RES. DEVELOP.; ISSN 0018-8646; USA; DA. 1982; VOL. 26; NO 4; PP. 506-514; BIBL. 14 REF.Article

EXTENDING THE INFORMATION THEORY APPROACH TO CONVERTING LIMITED-ENTRY DECISION TABLES TO COMPUTER PROGRAMS.SHWAYDER K.1974; COMMUNIC. A.C.M.; U.S.A.; DA. 1974; VOL. 17; NO 9; PP. 532-537; BIBL. 10 REF.Article

A GENERAL METHOD FOR CHANNEL CODINGFRANASZEK PA.1980; IBM J. RES. DEVELOP.; ISSN 0018-8646; USA; DA. 1980; VOL. 24; NO 5; PP. 638-641; BIBL. 3 REF.Article

CODING FOR A MULTIPLE-ACCESS CHANNEL.WELDON EJ JR.1978; INFORM. AND CONTROL; U.S.A.; DA. 1978; VOL. 36; NO 3; PP. 256-274; BIBL. 13 REF.Article

TRANSMISSION OPTIMALE DES MESSAGES PAR UN CANAL SYMETRIQUE BINAIRE A RETROACTION POUR UNE VITESSE NULLEZIGANGIROV K SH.1978; PROBL. CONTROL INFORM. THEORY; HUN; DA. 1978; VOL. 7; NO 3; PP. 183-198; ABS. ENG; BIBL. 7 REF.Article

ON SENDING ONE BIT OF INFORMATION OVER AN AGWN CHANNEL WITH NOISELESS FEEDBACKHO YC; CHANG TS.1979; J. OPTIMIZ. THEORY APPL.; USA; DA. 1979; VOL. 27; NO 1; PP. 167-173; BIBL. 4 REF.Article

TRANSMISSION DES MESSAGES A TRAVERS UN CANAL DISCRET A RETROACTION SANS BRUITKUDRYASHOV BD.1979; PROBL. PEREDACHI INFORM.; SUN; DA. 1979; VOL. 15; NO 1; PP. 3-13; BIBL. 6 REF.Article

BORNES DE LA PROBABILITE DE NON-DETECTION DES ERREURSLEVENSHTEJN VI.1977; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1977; VOL. 13; NO 1; PP. 3-18; BIBL. 11 REF.Article

Arithmetic coding for finite-state noiseless channelsSAVARI, S. A; GALLAGER, R. G.IEEE transactions on information theory. 1994, Vol 40, Num 1, pp 100-107, issn 0018-9448Article

On false lock in suppressed carrier MPSK tracking loopsKIASALEH, K.IEEE transactions on communications. 1991, Vol 39, Num 11, pp 1683-1697, issn 0090-6778Article