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 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

Error Exponents for Broadcast Channels With Degraded Message SetsKASPI, Yonatan; MERHAV, Neri.IEEE transactions on information theory. 2011, Vol 57, Num 1, pp 101-123, issn 0018-9448, 23 p.Article

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

Asymptotic Improvement of the Gilbert-Varshamov Bound for Linear CodesGABORIT, Philippe; ZEMOR, Gilles.IEEE transactions on information theory. 2008, Vol 54, Num 9, pp 3865-3872, issn 0018-9448, 8 p.Article

Achievable Error Exponents for Channels With Side Information Erasure and List DecodingSABBAG, Erez; MERHAV, Neri.IEEE transactions on information theory. 2010, Vol 56, Num 11, pp 5424-5431, issn 0018-9448, 8 p.Article

A study on universal codes with finite block lengthsJUN SHI; WESEL, Richard D.IEEE transactions on information theory. 2007, Vol 53, Num 9, pp 3066-3074, issn 0018-9448, 9 p.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

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

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

Extremes of Error ExponentsGUILLEN I FABREGAS, Albert; LAND, Ingmar; MARTINEZ, Alfonso et al.IEEE transactions on information theory. 2013, Vol 59, Num 4, pp 2201-2207, issn 0018-9448, 7 p.Article

Exact Random Coding Exponents for Erasure DecodingSOMEKH-BARUCH, Anelia; MERHAV, Neri.IEEE transactions on information theory. 2011, Vol 57, Num 10, pp 6444-6454, issn 0018-9448, 11 p.Article

Expurgated Random-Coding Ensembles: Exponents, Refinements, and ConnectionsSCARLETT, Jonathan; LI PENG; MERHAV, Neri et al.IEEE transactions on information theory. 2014, Vol 60, Num 8, pp 4449-4462, issn 0018-9448, 14 p.Conference Paper

Error Exponents of Erasure/List Decoding Revisited Via Moments of Distance EnumeratorsMERHAV, Neri.IEEE transactions on information theory. 2008, Vol 54, Num 10, pp 4439-4447, issn 0018-9448, 9 p.Article

Near sufficiency of random coding for two descriptionsLASTRAS-MONTANO, Luis Alfonso; CASTELLI, Vittorio.IEEE transactions on information theory. 2006, Vol 52, Num 2, pp 681-695, issn 0018-9448, 15 p.Article

Codeword or Noise? Exact Random Coding Exponents for Joint Detection and DecodingWEINBERGER, Nir; MERHAV, Neri.IEEE transactions on information theory. 2014, Vol 60, Num 9, pp 5077-5094, issn 0018-9448, 18 p.Article

Weighted Superimposed Codes and Constrained Integer Compressed SensingWEI DAI; MILENKOVIC, Olgica.IEEE transactions on information theory. 2009, Vol 55, Num 5, pp 2215-2229, issn 0018-9448, 15 p.Article

Source coding with feed-forward: Rate-distortion theorems and error exponents for a general sourceVENKATARAMANAN, Ramji; PRADHAN, S. Sandeep.IEEE transactions on information theory. 2007, Vol 53, Num 6, pp 2154-2179, issn 0018-9448, 26 p.Article

The Existence of Concatenated Codes List-Decodable up to the Hamming BoundGURUSWAMI, Venkatesan; RUDRA, Atri.IEEE transactions on information theory. 2010, Vol 56, Num 10, pp 5195-5206, issn 0018-9448, 12 p.Article