Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("CANAL SANS MEMOIRE")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 340

  • Page / 14
Export

Selection :

  • and

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

CAPACITE DE TRANSMISSION DANS LE CAS D'ERREUR NULLE, EN PRESENCE D'UNE INFORMATION COMMUNE POUR LES CANAUX DETERMINISTES A ACCES MULTIPLEVASSALYGO LA; PINSKER MS; PRELOV VV et al.1982; PROBL. PEREDA. INF.; ISSN 0555-2923; SUN; DA. 1982; VOL. 18; NO 1; PP. 3-11; BIBL. 9 REF.Article

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

TRANSMISSION D'UN FAIBLE SIGNAL A TRAVERS UN CANAL SANS MEMOIREIBRAGIMOV IA; KHAS'MINSKIJ RZ.1972; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1972; VOL. 8; NO 4; PP. 28-39; BIBL. 11 REF.Serial Issue

EXPOSANT DE LA PROBABILITE D'ERREUR DANS UN SYSTEME A RETROACTION UTILISANT UN CODE EN CASCADEZHIGULIN LF; ZYABLOV VV.1973; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1973; VOL. 9; NO 1; PP. 3-10; BIBL. 8 REF.Serial Issue

CODING THEOREM FOR STATIONARY, ASYMPTOTICALLY MEMORYLESS, CONTINUOUS-TIME CHANNELSKADOTA TT; WYNER AD.1972; ANN. MATH. STATIST.; U.S.A.; DA. 1972; VOL. 43; NO 5; PP. 1603-1611; BIBL. 10 REF.Serial Issue

TREILLIS ENCODING OF MEMORYLESS DISCRETE-TIME SOURCES WITH A FIDELITY CRITERION.VITERBI AJ; OMURA JK.1974; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1974; VOL. 20; NO 3; PP. 325-332; BIBL. 10 REF.Article

CONCATENATED CODES FOR MULTIPLE ACCESS CHANNELSOHKUBO M.1980; I.E.E.E. TRANS. INFORM. THEORY; USA; DA. 1980; VOL. 26; NO 2; PP. 217-220; BIBL. 5 REF.Article

GENERAL BROADCAST CHANNELS WITH DEGRADED MESSAGE SETS.KORNER J; MARTON K.1977; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1977; VOL. 23; NO 1; PP. 60-64; BIBL. 11 REF.Article

ON A METHOD OF CALCULATING THE CAPACITY OF A DISCRETE MEMORYLESS CHANNEL.TAKANO S.1975; INFORM. AND CONTROL; U.S.A.; DA. 1975; VOL. 29; NO 4; PP. 327-336; BIBL. 5 REF.Article

A GENERAL FORMULA FOR THE CAPACITY OF STATIONARY NONANTICIPATORY CHANNELS.KIEFFER JC.1974; INFORM. AND CONTROL; U.S.A.; DA. 1974; VOL. 26; NO 4; PP. 381-391; BIBL. 13 REF.Article

CHANNELS WITH ARBITRARILY VARYING CHANNEL PROBABILITY FUNCTIONS IN THE PRESENCE OF NOISELESS FEEDBACKAHLSWEDE R.1973; Z. WAHSCHEIN.-THEOR. VERWANDTE GEB.; DTSCH.; DA. 1973; VOL. 25; NO 3; PP. 239-252; BIBL. 9 REF.Serial Issue

AN ALGORITHM FOR DETERMINING ALL THE OPTIMAL INPUT PROBABILITY DISTRIBUTIONS OF THE DMCWATANABE Y.1983; IEEE TRANSACTIONS ON INFORMATION THEORY; ISSN 0018-9448; USA; DA. 1983; VOL. 29; NO 1; PP. 151-152; BIBL. 5 REF.Article

BORNES DE CODAGE ALEATOIRE POUR LES CANAUX DISCRETS SANS MEMOIREPOLTYREV G SH.1982; PROBL. PEREDA. INF.; ISSN 0555-2923; SUN; DA. 1982; VOL. 18; NO 1; PP. 12-26; BIBL. 15 REF.Article

BORNES DE LA PROBABILITE D'ERREUR MOYENNE POUR UN ENSEMBLE DE CODES DE COMPOSITION FIXEED'YACHKOV AG.1980; PROBL. PEREDA. INF.; ISSN 0555-2923; SUN; DA. 1980; VOL. 16; NO 4; PP. 3-8; BIBL. 5 REF.Article

TWO-USER COMMUNICATION CHANNELS.SATO H.1977; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1977; VOL. 23; NO 3; PP. 295-304; BIBL. 12 REF.Article

UTILISATION DES ESTIMATEURS BAYESIENS GENERALISES POUR LA TRANSMISSION DANS LES CANAUX A CONTRE-REACTIONLEVIT B YA.1972; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1972; VOL. 8; NO 3; PP. 9-20; BIBL. 14 REF.Serial Issue

ON BROADCAST CHANNELS WITH SIDE INFORMATION UNDER FIDELITY CRITERIABHU DEV SHARMA; VED PRIYA.1983; KYBERNETIKA; ISSN 0023-5954; CSK; DA. 1983; VOL. 19; NO 1; PP. 27-41; BIBL. 12 REF.Article

CAPACITE D'UN CANAL DE RADIODIFFUSIONGEL'FAND SI.1977; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1977; VOL. 13; NO 3; PP. 106-108; BIBL. 5 REF.Article

A LOWER BOUND ON THE PROBABILITY OF DECODING ERROR FOR THE FINITE-STATE CHANNEL.KIEFFER JC.1974; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1974; VOL. 20; NO 4; PP. 549-551; BIBL. 5 REF.Article

BORNES ASYMPTOTIQUES DE LA PROBABILITE DE L'ERREUR DE TRANSMISSION AVEC RETROACTION DANS UN CANAL GAUSSIEN AVEC UNE LIMITATION DU PIC DU SIGNAL D'ENTREED'YACHKOV AG.1972; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1972; VOL. 8; NO 4; PP. 5-21; BIBL. 12 REF.Serial Issue

AN IMPROVEMENT OF ERROR EXPONENTS AT LOW RATES FOR THE GENERALIZED VERSION OF CONCATENATED CODESHIRASAWA S; KASAHARA M; SUGIYAMA Y et al.1981; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1981; VOL. 27; NO 3; PP. 350-352; BIBL. 6 REF.Article

MEDIUM CONVERSE FOR MEMORYLESS CHANNELS WITH ARBITRARY ALPHABETSBECK J; CSISZAR I.1978; PROBL. CONTROL INFORM. THEORY; HUN; DA. 1978; VOL. 7; NO 3; PP. 199-202; ABS. RUS; BIBL. 4 REF.Article

A NOISELESS CODING THEOREM FOR SOURCES HAVING UTILITIES.LONGO G.1976; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1976; VOL. 30; NO 4; PP. 739-748; BIBL. 3 REF.Article

  • Page / 14