Coding for computing von Orlitsky, A., Roche, J.R.

Volltext

Stopping set distribution of LDPC code ensembles von Orlitsky, A., Viswanathan, K., Junan Zhang

Volltext

Universal compression of memoryless sources over unknown alphabets von Orlitsky, A., Santhanam, N.P., Junan Zhang

Volltext

Zero-error information theory von Korner, J., Orlitsky, A.

Volltext

Silence-Based Communication von Dhulipala, A.K., Fragouli, C., Orlitsky, A.

Volltext

Speaking of infinity [i.i.d. strings] von Orlitsky, A., Santhanam, N.P.

Volltext

Source coding and graph entropies von Alon, N., Orlitsky, A.

Volltext

Universal Compression of Markov and Related Sources Over Arbitrary Alphabets von Dhulipala, A.K., Orlitsky, A.

Volltext

One-way communication and error-correcting codes von Orlitsky, A., Viswanathan, K.

Volltext

Limit results on pattern entropy von Orlitsky, A., Santhanam, N.P., Viswanathan, K., Junan Zhang

Volltext

Scalar versus vector quantization: worst case analysis von Orlitsky, A.

Volltext

On codes that avoid specified differences von Moision, B.E., Orlitsky, A., Siegel, P.H.

Volltext

Worst-case interactive communication. I. Two messages are almost optimal von Orlitsky, A.

Volltext

A lower bound on the expected length of one-to-one codes von Alon, N., Orlitsky, A.

Volltext

Repeated communication and Ramsey graphs von Alon, N., Orlitsky, A.

Volltext

Average-case interactive communication von Orlitsky, A.

Volltext

Worst-case interactive communication. II. Two messages are not optimal von Orlitsky, A.

Volltext

Always Good Turing: Asymptotically Optimal Probability Estimation von Orlitsky, Alon, Santhanam, Narayana P., Zhang, Junan

Volltext

Design of shapes for precise image registration von Bruckstein, A.M., O'Gorman, L., Orlitsky, A.

Volltext

Lower bounds on threshold and related circuits via communication complexity von Roychowdhury, V.P., Orlitsky, A., Kai-Yeung Siu

Volltext