Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Codage aléatoire")

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 309

  • Page / 13
Export

Selection :

  • and

Stochastic cooling of speech signals at very low bit rates: the importance of speech perceptionSCHROEDER, M. R; ATAL, B. S.Speech communication. 1985, Vol 4, Num 1-3, pp 155-162, issn 0167-6393Article

Security analysis of optical encryptionFRAUEL, Yann; CASTRO, Albertina; NAUGHTON, Thomas J et al.Proceedings of SPIE, the International Society for Optical Engineering. 2005, pp 598603.1-598603.10, issn 0277-786X, isbn 0-8194-6008-7, 1VolConference Paper

The random coded modulation : performance and Euclidean distance spectrum evaluationMAGALHAES DE OLIVEIRA; BATTAIL, G.Annales des télécommunications. 1992, Vol 47, Num 3-4, pp 107-124, issn 0003-4347Article

A new optical random coding technique for security systemsZALEVSKY, Z; MENDLOVIC, D; LEVY, U et al.Optics communications. 2000, Vol 180, Num 1-3, pp 15-20, issn 0030-4018Article

CODAGE PSEUDOSTOCHASTIQUE PAR N-PARTITION DANS LES SYSTEMES A RETROACTION DECISIVEUSTINOV GN.1982; PROBL. PEREDA. INF.; ISSN 0555-2923; SUN; DA. 1982; VOL. 18; NO 1; PP. 43-50; BIBL. 5 REF.Article

PROBLEME D'ISOMORPHISME DES SCHEMAS DE BERNOULLILIVSHITS AN.1974; TEOR. VEROJAT. PRIMEN.; S.S.S.R.; DA. 1974; VOL. 19; NO 2; PP. 409-416; ABS. ANGL.; BIBL. 7 REF.Article

ETROITESSE DES LIMITES DU CODAGE ALEATOIRE POUR LES CANAUX DE RADIODIFFUSIONPOLTYREV G SH.1982; PROBLEMS OF CONTROL AND INFORMATION THEORY; ISSN 0370-2529; HUN; DA. 1982; VOL. 11; NO 5; PP. 353-364; ABS. ENG; BIBL. 4 REF.Article

Yarrow-160 : Notes on the design and analysis of the Yarrow cryptographic pseudorandom number generatorKELSEY, J; SCHNEIER, B; FERGUSON, N et al.Lecture notes in computer science. 2000, pp 13-33, issn 0302-9743, isbn 3-540-67185-4Conference Paper

Two proofs of Pinsker's conjecture concerning arbitrarily varying channelsAHLSWEDE, R; CAI, N.IEEE transactions on information theory. 1991, Vol 37, Num 6, pp 1647-1649, issn 0018-9448Conference Paper

New lower bounds for binary codes of asymmetric distance twoZHEN ZHANG; XIANG-GEN XIA.IEEE transactions on information theory. 1992, Vol 38, Num 5, pp 1592-1597, issn 0018-9448Article

A branching process analysis of the stack algorithm for variable channel conditionsMONTPETIT, M.-J; HACCOUN, D; DESLAURIERS, G et al.IEEE transactions on information theory. 1992, Vol 38, Num 6, pp 1845-1848, issn 0018-9448Article

Random code chainingLEE, J. Y; LU, E. H; CHEN, P. C. H et al.Electronics Letters. 1988, Vol 24, Num 10, pp 579-580, issn 0013-5194Article

Random coding bound and codes produced by permutations for the multiple-access channelPOKORNY, J; WALLMEIER, H.-M.IEEE transactions on information theory. 1985, Vol 31, Num 6, pp 741-750, issn 0018-9448Article

Utilisation de codes de Reed-Solomon sur un alphabet de grande taille pour le canal gaussien à bande étroite = Using Reed-Solomon codes over a large-size alphabet for the narrow-band Gaussian channelYuan, Chen; Battail, G.1995, 140 p.Thesis

Arbitrarily varuing channels with general alphabets and statesCSISZAR, I.IEEE transactions on information theory. 1992, Vol 38, Num 6, pp 1725-1742, issn 0018-9448Article

PROBLEME DE CODAGE SEPARE DE DEUX SOURCES CORRELEESKOSHELEV VN.1977; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1977; VOL. 13; NO 1; PP. 26-32; BIBL. 3 REF.Article

CODAGE UNIVERSEL UNIFORME DES SOURCES DE BERNOULLI A LA SORTIETROFIMOV VK.1976; DISKRETN. ANAL.; S.S.S.R.; DA. 1976; NO 29; PP. 87-100; 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

BEST EXPONENTIAL UPPER BOUNDS TO ERROR PROBABILITY OBTAINABLE BY RANDOM CODING FOR BINARY SYMMETRIC CHANNELSKAMBO NS; SAMAR SINGH.1972; INFORM. AND CONTROL; U.S.A.; DA. 1972; VOL. 21; NO 3; PP. 261-279; BIBL. 10 REF.Serial Issue

THE COMPUTATIONAL CUTOFF RATE OF CHANNELS HAVING MEMORYBIGLIERI E.1981; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1981; VOL. 27; NO 3; PP. 352-357; BIBL. 15 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

PLANS D'EXPERIENCE FACTORIELS REDUITS DANS LE CAS D'UNE FONCTION DE REPONSE NON SYMETRIQUEMALYUTOV MB; MATEEV PS.1979; DOKL. AKAD NAUK S.S.S.R.; SUN; DA. 1979; VOL. 244; NO 1; PP. 42-46; BIBL. 4 REF.Article

MODELES DE SOURCES DE MESSAGES ET LEUR APPLICATIONEVTIKHIEV NN; SANDLER EA.1978; PROBL. PEREDACHI INFORM.; SUN; DA. 1978; VOL. 14; NO 4; PP. 24-31; BIBL. 11 REF.Article

ACOUSTOELECTRIC CONVOLVERS FOR PROGRAMMABLE MATCHED FILTERING IN SPREAD-SPECTRUM SYSTEMS.CAFARELLA JH; BROWN WM JR; STERN E et al.1976; PROC. I.E.E.E.; U.S.A.; DA. 1976; VOL. 64; NO 5; PP. 756-759; BIBL. 6 REF.Article

BEST ASYMPTOTIC VALUE OF THE ERROR EXPONENT WITH RANDOM CODING ON DISCRETE MEMORYLESS CHANNELSKAMBO NS; SAMAR SINGH.1972; J. APPL. PROBABIL.; G.B.; DA. 1972; VOL. 9; NO 2; PP. 327-336; BIBL. 5 REF.Serial Issue

  • Page / 13