Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Codificación aleatoria")

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 276

  • Page / 12
Export

Selection :

  • and

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

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

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

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

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

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

Codage convolutif récursif pseudo-aléatoireBATTAIL, G.Annales des télécommunications. 1995, Vol 50, Num 9-10, pp 779-789, issn 0003-4347Article

Fountain codes : Capacity approaching codes design and implementationMACKAY, D. J. C.IEE proceedings. Communications. 2005, Vol 152, Num 6, pp 1062-1068, issn 1350-2425, 7 p.Article

An integral representation of functions using three-layered networks and their approximation boundsMURATA, N.Neural networks. 1996, Vol 9, Num 6, pp 947-956, issn 0893-6080Article

Nonconvexity of the capacity region of the multiple-access arbitrarily varying channel subject to constraintsGUBNER, J. A; HUGHES, B. L.IEEE transactions on information theory. 1995, Vol 41, Num 1, pp 3-13, issn 0018-9448Article

Weight distribution and performance of the iterated product of single-parity-check codesCAIRE, G; TARICCO, G; BATTAIL, G et al.Annales des télécommunications. 1995, Vol 50, Num 9-10, pp 752-761, issn 0003-4347Article

Asymptotic bounds on optimal noisy channel quantization via random codingZEGER, K; MANZELLA, V.IEEE transactions on information theory. 1994, Vol 40, Num 6, pp 1926-1938, issn 0018-9448Article

On information rates for mismatched decodersMERHAV, N; KAPLAN, G; LAPIDOTH, A et al.IEEE transactions on information theory. 1994, Vol 40, Num 6, pp 1953-1967, issn 0018-9448Article

A rate of convergence result for a universal D-semifaithful codeBIN YU; SPEED, T. P.IEEE transactions on information theory. 1993, Vol 39, Num 3, pp 813-820, issn 0018-9448Article

Codage déterministe imitant le codage aléatoire pour le canal à bruit gaussien additif = Deterministic coding which mimics random coding for the additive gaussian noise channelBATTAIL, G; MAGALHAEZ DE OLIVEIRA, H; WEIDONG ZHANG et al.Annales des télécommunications. 1992, Vol 47, Num 9-10, pp 433-447, issn 0003-4347Article

Error-correcting codes and pseudorandom projectionsTREVISAN, Luca.Lecture notes in computer science. 2001, pp 7-9, issn 0302-9743, isbn 3-540-42470-9Conference Paper

Pseudorandom light from a mode-locked laserSALEHI, J. A.Optics letters. 1989, Vol 14, Num 3, pp 174-176, issn 0146-9592Article

Efficient multimedia data encryption based on flexible QM coderDAHUA XIE; JAY KUO, C.-C.SPIE proceedings series. 2004, pp 696-704, isbn 0-8194-5209-2, 9 p.Conference Paper

Weight distributions and bounds for turbo-codes : Iterative and Turbo decodingSVIRID, YU. V.European transactions on telecommunications and related technologies. 1995, Vol 6, Num 5, pp 543-555, issn 1120-3862Article

Exponential error bounds for random codes on Gaussian arbitrarily varying channelsTHOMAS, T. G; HUGHES, B.IEEE transactions on information theory. 1991, Vol 37, Num 3, pp 643-649, issn 0018-9448, 1Article

A Derivation of the Source-Channel Error Exponent Using Nonidentical Product DistributionsTAUSTE CAMPO, Adrià; VAZQUEZ-VILAR, Gonzalo; I FABREGAS, Albert Guillén et al.IEEE transactions on information theory. 2014, Vol 60, Num 6, pp 3209-3217, issn 0018-9448, 9 p.Conference Paper

  • Page / 12