Bio


Tsachy's research focuses on Information Theory, Data Compression and Communications, Statistical Signal Processing, Machine Learning, the interplay between them, and their applications, with recent focus on applications to genomic data compression and processing. He is inventor of several patents and involved in several companies as member of the technical board. IEEE fellow, he serves on the board of governors of the information theory society as well as the editorial boards of the Transactions on Information Theory and Foundations and Trends in Communications and Information Theory. He is founding Director of the Stanford Compression Forum.

Academic Appointments


Administrative Appointments


  • Founder/Director, Stanford Compression Forum (2015 - Present)
  • Academic Affairs Committee, Stanford University (2013 - 2018)
  • Graduate Admissions Committee, Stanford University (2004 - 2012)

Honors & Awards


  • Google Research Award, Google (2016)
  • Yahoo! Faculty Research Award, Yahoo! (2015)
  • Google Research Award, Google (2013)
  • Yahoo! Faculty Research And Engagement Award, Yahoo! (2013)
  • IEEE Fellow Grade, IEEE (2012)
  • Google Research Award, Google (2011)
  • STMicroelectronics Faculty Scholar Award, Stanford University (2011)

Boards, Advisory Committees, Professional Organizations


  • Guest Editor, Proceedings of IEEE (2017 - 2017)
  • Organizer/Technical Program Committee, IEEE (ITW) (2015 - 2015)
  • Technical Program Committee, IEEE (ISIT) (2015 - 2015)
  • Technical Program Committee, IEEE (ISIT) (2014 - 2014)
  • Editorial Board, Foundations and Trends in Communications and Information Theory (2012 - Present)
  • Fellow, IEEE (2012 - Present)
  • Technical Program Committee, IEEE (ISIT) (2012 - 2012)
  • Technical Program Committee, IEEE (ISIT) (2011 - 2011)
  • Editorial Board, Transactions on Information Theory Associate Editor for Shannon Theory (2010 - Present)
  • Organizer/Technical Program Committee, IEEE (ITW) (2010 - 2010)
  • Paper Award Committee, IEEE (2009 - 2009)
  • Technical Program Committee, Data Compression Conference (DCC) (2009 - 2009)
  • Technical Program Committee, IEEE International Symposium on Information Theory (ISIT) (2009 - 2009)
  • Technical Program Committee, Control Over Communication Channels Workshop (ConCom) (2009 - 2009)
  • Technical Program Committee, DCC (Data Compression Conference) (2008 - 2008)
  • Technical Program Committee, IAPR Workshop on Cognitive Information Processing (CIP) (2008 - 2008)
  • Technical Program Committee, IEEE (ISIT) (2007 - 2007)
  • Member, The Mathematical Association of America (MAA) (2006 - Present)
  • Panelist, Allerton Conference (2006 - 2006)
  • Technical Program Committee, IEEE (ISIT) (2005 - 2005)

Professional Education


  • PhD, Technion-Israel Institute of Technology, Electrical Engineering (2001)
  • B.Sc., Technion-Israel Institute of Technology, Electrical Engineering (1997)

Patents


  • Itschak Weissman. "United States Patent US8320687 Universal Lossy Compression Methods", Nov 27, 2012
  • Itschak Weissman. "United States Patent US200404580 Denoising and Error Correction for Finite Input General Output Channel", May 10, 2012
  • Itschak Weissman. "United States Patent US7624009 Method and System for Producing Variable Length Context Models", Nov 24, 2009
  • Itschak Weissman. "United States Patent US7498961 Context Identification Using a Denoised Signal", Mar 3, 2009
  • Itschak Weissman. "United States Patent US7474793 Methods for Compression Using a Denoiser", Jan 6, 2009
  • Itschak Weissman. "United States Patent EP1766832 Discrete Universal Denoising with Error Correction Coding", Dec 10, 2008
  • Itschak Weissman. "United States Patent US7436969 Method and System for Optimizing Denoising Parameters Using Compressibility", Oct 14, 2008
  • Itschak Weissman. "United States Patent US7433427 Enhanced Denoising System Utilizing Incremental Parsing", Oct 7, 2008
  • Itschak Weissman. "United States Patent US7420487 Denoising Video", Sep 2, 2008
  • Itschak Weissman. "United States Patent US7271749 Context-based Denoiser That Simultaneously Updates Probabilities for Multiple Contexts", Sep 18, 2007
  • Itschak Weissman. "United States Patent US7269781 Discrete Universal Denoising with Reliability Information", Sep 11, 2007
  • Itschak Weissman. "United States Patent US7123172 Method and System for Determining an Optimal or Near Optimal Set of Contexts by Constructing a Multi-directional Context Tree", Oct 17, 2006
  • Itschak Weissman. "United States Patent US7047472 Method For Correcting Noise Errors in a Digital Signal", May 16, 2006

All Publications


  • Not all universal codes are pointwise universal Weissman, T. unpublished manuscript available upon request and at http://www.stanford.edu/~tsachy/papers.html.
  • Effect of lossy compression of quality scores on variant calling BRIEFINGS IN BIOINFORMATICS Ochoa, I., Hernaez, M., Goldfeder, R., Weissman, T., Ashley, E. 2017; 18 (2): 183-194

    View details for DOI 10.1093/bib/bbw011

    View details for Web of Science ID 000397060200002

  • When is Noisy State Information at the Encoder as Useless as No Information or as Good as Noise-Free State? IEEE TRANSACTIONS ON INFORMATION THEORY Xu, R., Chen, J., Weissman, T., Zhang, J. 2017; 63 (2): 960-974
  • Rateless Lossy Compression via the Extremes IEEE TRANSACTIONS ON INFORMATION THEORY No, A., Weissman, T. 2016; 62 (10): 5484-5495
  • GTRAC: fast retrieval from compressed collections of genomic variants BIOINFORMATICS Tatwawadi, K., Hernaez, M., Ochoa, I., Weissman, T. 2016; 32 (17): 479-486
  • Information, Estimation, and Lookahead in the Gaussian Channel IEEE TRANSACTIONS ON SIGNAL PROCESSING Venkat, K., Weissman, T., Carmon, Y., Shamai, S. 2016; 64 (14): 3605-3618
  • Secure Source Coding With a Public Helper IEEE TRANSACTIONS ON INFORMATION THEORY Kittichokechai, K., Chia, Y., Oechtering, T. J., Skoglund, M., Weissman, T. 2016; 62 (7): 3930-3949
  • Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff IEEE TRANSACTIONS ON INFORMATION THEORY No, A., Ingber, A., Weissman, T. 2016; 62 (6): 3618-3635
  • Compression for Quadratic Similarity Queries: Finite Blocklength and Practical Schemes IEEE TRANSACTIONS ON INFORMATION THEORY Steiner, F., Dempfle, S., Ingber, A., Weissman, T. 2016; 62 (5): 2737-2747
  • smallWig: parallel compression of RNA-seq WIG files BIOINFORMATICS Wang, Z., Weissman, T., Milenkovic, O. 2016; 32 (2): 173-180
  • Distortion Rate Function of Sub-Nyquist Sampled Gaussian Sources IEEE TRANSACTIONS ON INFORMATION THEORY Kipnis, A., Goldsmith, A. J., Eldar, Y. C., Weissman, T. 2016; 62 (1): 401-429
  • Minimax Estimation of Discrete Distributions Under l(1) Loss IEEE TRANSACTIONS ON INFORMATION THEORY Han, Y., Jiao, J., Weissman, T. 2015; 61 (11): 6343-6354
  • Justification of Logarithmic Loss via the Benefit of Side Information IEEE TRANSACTIONS ON INFORMATION THEORY Jiao, J., Courtade, T. A., Venkat, K., Weissman, T. 2015; 61 (10): 5357-5365
  • QVZ: lossy compression of quality values. Bioinformatics Malysa, G., Hernaez, M., Ochoa, I., Rao, M., Ganesan, K., Weissman, T. 2015; 31 (19): 3122-3129

    Abstract

    Recent advancements in sequencing technology have led to a drastic reduction in the cost of sequencing a genome. This has generated an unprecedented amount of genomic data that must be stored, processed and transmitted. To facilitate this effort, we propose a new lossy compressor for the quality values presented in genomic data files (e.g. FASTQ and SAM files), which comprise roughly half of the storage space (in the uncompressed domain). Lossy compression allows for compression of data beyond its lossless limit.The proposed algorithm QVZ exhibits better rate-distortion performance than the previously proposed algorithms, for several distortion metrics and for the lossless case. Moreover, it allows the user to define any quasi-convex distortion function to be minimized, a feature not supported by the previous algorithms. Finally, we show that QVZ-compressed data exhibit better performance in the genotyping than data compressed with previously proposed algorithms, in the sense that for a similar rate, a genotyping closer to that achieved with the original quality values is obtained.QVZ is written in C and can be downloaded from https://github.com/mikelhernaez/qvz.mhernaez@stanford.edu or gmalysa@stanford.edu or iochoa@stanford.eduSupplementary data are available at Bioinformatics online.

    View details for DOI 10.1093/bioinformatics/btv330

    View details for PubMedID 26026138

  • Network Compression: Worst Case Analysis IEEE TRANSACTIONS ON INFORMATION THEORY Asnani, H., Shomorony, I., Avestimehr, A. S., Weissman, T. 2015; 61 (7): 3980-3995
  • Compression for Quadratic Similarity Queries IEEE TRANSACTIONS ON INFORMATION THEORY Ingber, A., Courtade, T., Weissman, T. 2015; 61 (5): 2729-2747
  • Minimax Estimation of Functionals of Discrete Distributions IEEE TRANSACTIONS ON INFORMATION THEORY Jiao, J., Venkat, K., Han, Y., Weissman, T. 2015; 61 (5): 2835-2885
  • Comparison of the Achievable Rates in OFDM and Single Carrier Modulation with IID Inputs IEEE TRANSACTIONS ON INFORMATION THEORY Carmon, Y., Shamai, S., Weissman, T. 2015; 61 (4): 1795-1818
  • iDoComp: a compression scheme for assembled genomes BIOINFORMATICS Ochoa, I., Hernaez, M., Weissman, T. 2015; 31 (5): 626-633

    Abstract

    With the release of the latest next-generation sequencing (NGS) machine, the HiSeq X by Illumina, the cost of sequencing a Human has dropped to a mere $4000. Thus we are approaching a milestone in the sequencing history, known as the $1000 genome era, where the sequencing of individuals is affordable, opening the doors to effective personalized medicine. Massive generation of genomic data, including assembled genomes, is expected in the following years. There is crucial need for compression of genomes guaranteed of performing well simultaneously on different species, from simple bacteria to humans, which will ease their transmission, dissemination and analysis. Further, most of the new genomes to be compressed will correspond to individuals of a species from which a reference already exists on the database. Thus, it is natural to propose compression schemes that assume and exploit the availability of such references.We propose iDoComp, a compressor of assembled genomes presented in FASTA format that compresses an individual genome using a reference genome for both the compression and the decompression. In terms of compression efficiency, iDoComp outperforms previously proposed algorithms in most of the studied cases, with comparable or better running time. For example, we observe compression gains of up to 60% in several cases, including H.sapiens data, when comparing with the best compression performance among the previously proposed algorithms.iDoComp is written in C and can be downloaded from: http://www.stanford.edu/~iochoa/iDoComp.html (We also provide a full explanation on how to run the program and an example with all the necessary files to run it.).

    View details for DOI 10.1093/bioinformatics/btu698

    View details for Web of Science ID 000352268500002

    View details for PubMedID 25344501

  • Macrophages eat cancer cells using their own calreticulin as a guide: Roles of TLR and Btk. Proceedings of the National Academy of Sciences of the United States of America Feng, M., Chen, J. Y., Weissman-Tsukamoto, R., Volkmer, J., Ho, P. Y., McKenna, K. M., Cheshier, S., Zhang, M., Guo, N., Gip, P., Mitra, S. S., Weissman, I. L. 2015; 112 (7): 2145-2150

    Abstract

    Macrophage-mediated programmed cell removal (PrCR) is an important mechanism of eliminating diseased and damaged cells before programmed cell death. The induction of PrCR by eat-me signals on tumor cells is countered by don't-eat-me signals such as CD47, which binds macrophage signal-regulatory protein α to inhibit phagocytosis. Blockade of CD47 on tumor cells leads to phagocytosis by macrophages. Here we demonstrate that the activation of Toll-like receptor (TLR) signaling pathways in macrophages synergizes with blocking CD47 on tumor cells to enhance PrCR. Bruton's tyrosine kinase (Btk) mediates TLR signaling in macrophages. Calreticulin, previously shown to be an eat-me signal on cancer cells, is activated in macrophages for secretion and cell-surface exposure by TLR and Btk to target cancer cells for phagocytosis, even if the cancer cells themselves do not express calreticulin.

    View details for DOI 10.1073/pnas.1424907112

    View details for PubMedID 25646432

    View details for PubMedCentralID PMC4343163

  • Information Measures: The Curious Case of the Binary Alphabet IEEE TRANSACTIONS ON INFORMATION THEORY Jiao, J., Courtade, T. A., No, A., Venkat, K., Weissman, T. 2014; 60 (12): 7616-7626
  • Aligned genomic data compression via improved modeling JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY Ochoa, I., Hernaez, M., Weissman, T. 2014; 12 (6)

    Abstract

    With the release of the latest Next-Generation Sequencing (NGS) machine, the HiSeq X by Illumina, the cost of sequencing the whole genome of a human is expected to drop to a mere $1000. This milestone in sequencing history marks the era of affordable sequencing of individuals and opens the doors to personalized medicine. In accord, unprecedented volumes of genomic data will require storage for processing. There will be dire need not only of compressing aligned data, but also of generating compressed files that can be fed directly to downstream applications to facilitate the analysis of and inference on the data. Several approaches to this challenge have been proposed in the literature; however, focus thus far has been on the low coverage regime and most of the suggested compressors are not based on effective modeling of the data. We demonstrate the benefit of data modeling for compressing aligned reads. Specifically, we show that, by working with data models designed for the aligned data, we can improve considerably over the best compression ratio achieved by previously proposed algorithms. Our results indicate that the pareto-optimal barrier for compression rate and speed claimed by Bonfield and Mahoney (2013) [Bonfield JK and Mahoneys MV, Compression of FASTQ and SAM format sequencing data, PLOS ONE, 8(3):e59190, 2013.] does not apply for high coverage aligned data. Furthermore, our improved compression ratio is achieved by splitting the data in a manner conducive to operations in the compressed domain by downstream applications.

    View details for DOI 10.1142/S0219720014420025

    View details for Web of Science ID 000348347800003

    View details for PubMedID 25395305

  • Capacity of a POST Channel With and Without Feedback IEEE TRANSACTIONS ON INFORMATION THEORY Permuter, H. H., Asnani, H., Weissman, T. 2014; 60 (10): 6041-6057
  • To Feed or Not to Feedback IEEE TRANSACTIONS ON INFORMATION THEORY Asnani, H., Permuter, H. H., Weissman, T. 2014; 60 (9): 5150-5172
  • Minimax Filtering Regret via Relations Between Information and Estimation IEEE TRANSACTIONS ON INFORMATION THEORY No, A., Weissman, T. 2014; 60 (8): 4832-4847
  • The Porosity of Additive Noise Channels IEEE TRANSACTIONS ON INFORMATION THEORY Misra, V., Weissman, T. 2014; 60 (6): 3144-3162
  • Compression With Actions IEEE TRANSACTIONS ON INFORMATION THEORY Zhao, L., Chia, Y., Weissman, T. 2014; 60 (2): 796-807
  • Multiterminal Source Coding Under Logarithmic Loss IEEE TRANSACTIONS ON INFORMATION THEORY Courtade, T. A., Weissman, T. 2014; 60 (1): 740-761
  • Compression for Similarity Identification: Fundamental Limits IEEE International Symposium on Information Theory (ISIT) Ingber, A., Weissman, T. IEEE. 2014: 1–5
  • Compression for Quadratic Similarity Queries via Shape-Gain Quantizers IEEE International Symposium on Information Theory (ISIT) Dempfle, S., Steiner, F., Ingber, A., Weissman, T. IEEE. 2014: 2839–2843
  • Information Divergences and the Curious Case of the Binary Alphabet IEEE International Symposium on Information Theory (ISIT) Jiao, J., Courtade, T., No, A., Venkat, K., Weissman, T. IEEE. 2014: 351–355
  • Relations between Information and Estimation in Scalar Levy Channels IEEE International Symposium on Information Theory (ISIT) Jiao, J., Venkat, K., Weissman, T. IEEE. 2014: 2212–2216
  • Strong Successive Refinability: Sufficient Conditions IEEE International Symposium on Information Theory (ISIT) No, A., Ingber, A., Weissman, T. IEEE. 2014: 2659–2663
  • Justification of Logarithmic Loss via the Benefit of Side Information IEEE International Symposium on Information Theory (ISIT) Jiao, J., Courtade, T., Venkat, K., Weissman, T. IEEE. 2014: 946–950
  • Achievable Error Exponents in the Gaussian Channel With Rate-Limited Feedback IEEE TRANSACTIONS ON INFORMATION THEORY Mirghaderi, R., Goldsmith, A., Weissman, T. 2013; 59 (12): 8144-8156
  • Estimation With a Helper Who Knows the Interference IEEE TRANSACTIONS ON INFORMATION THEORY Chia, Y., Soundararajan, R., Weissman, T. 2013; 59 (11): 7097-7117
  • Universal Estimation of Directed Information IEEE TRANSACTIONS ON INFORMATION THEORY Jiao, J., Permuter, H. H., Zhao, L., Kim, Y., Weissman, T. 2013; 59 (10): 6220-6242
  • The human genome contracts again BIOINFORMATICS Pavlichin, D. S., Weissman, T., Yona, G. 2013; 29 (17): 2199-2202

    Abstract

    The number of human genomes that have been sequenced completely for different individuals has increased rapidly in recent years. Storing and transferring complete genomes between computers for the purpose of applying various applications and analysis tools will soon become a major hurdle, hindering the analysis phase. Therefore, there is a growing need to compress these data efficiently. Here, we describe a technique to compress human genomes based on entropy coding, using a reference genome and known Single Nucleotide Polymorphisms (SNPs). Furthermore, we explore several intrinsic features of genomes and information in other genomic databases to further improve the compression attained. Using these methods, we compress James Watson's genome to 2.5 megabytes (MB), improving on recent work by 37%. Similar compression is obtained for most genomes available from the 1000 Genomes Project. Our biologically inspired techniques promise even greater gains for genomes of lower organisms and for human genomes as more genomic data become available.Code is available at sourceforge.net/projects/genomezip/

    View details for DOI 10.1093/bioinformatics/btt362

    View details for Web of Science ID 000323344800018

    View details for PubMedID 23793748

  • Successive Refinement With Decoder Cooperation and Its Channel Coding Duals IEEE TRANSACTIONS ON INFORMATION THEORY Asnani, H., Permuter, H. H., Weissman, T. 2013; 59 (9): 5511-5533
  • QualComp: a new lossy compressor for quality scores based on rate distortion theory BMC BIOINFORMATICS Ochoa, I., Asnani, H., Bharadia, D., Chowdhury, M., Weissman, T., Yona, G. 2013; 14

    View details for DOI 10.1186/1471-2105-14-187

    View details for Web of Science ID 000321136300001

    View details for PubMedID 23758828

  • Real-Time Coding With Limited Lookahead IEEE TRANSACTIONS ON INFORMATION THEORY Asnani, H., Weissman, T. 2013; 59 (6): 3582-3606
  • Multiterminal Source Coding With Action-Dependent Side Information IEEE TRANSACTIONS ON INFORMATION THEORY Chia, Y., Asnani, H., Weissman, T. 2013; 59 (6): 3653-3667
  • Directed Information, Causal Estimation, and Communication in Continuous Time IEEE TRANSACTIONS ON INFORMATION THEORY Weissman, T., Kim, Y., Permuter, H. H. 2013; 59 (3): 1271-1287
  • On Information, Estimation and Lookahead 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Venkat, K., Weissman, T., Carmon, Y., Shamai, S. IEEE. 2013: 1292–1299
  • Efficient Similarity Queries via Lossy Compression 51st Annual Allerton Conference on Communication, Control, and Computing Ochoa, I., Ingber, A., Weissman, T. IEEE. 2013: 883–889
  • Unsupervised Learning and Universal Communication IEEE International Symposium on Information Theory Proceedings (ISIT) Misra, V., Weissman, T. IEEE. 2013: 261–265
  • The Role of Lookahead in Estimation under Gaussian Noise IEEE International Symposium on Information Theory Proceedings (ISIT) Venkat, K., Weissman, T., Carmon, Y., Shamai, S. IEEE. 2013: 2850–2854
  • Minimax Filtering Regret via Relations Between Information and Estimation IEEE International Symposium on Information Theory Proceedings (ISIT) No, A., Weissman, T. IEEE. 2013: 444–448
  • Complexity and Rate-Distortion Tradeoff via Successive Refinement 51st Annual Allerton Conference on Communication, Control, and Computing No, A., Ingber, A., Weissman, T. IEEE. 2013: 1531–1536
  • Distortion Rate Function of Sub-Nyquist Sampled Gaussian Sources Corrupted by Noise 51st Annual Allerton Conference on Communication, Control, and Computing Kipnis, A., Goldsmith, A. J., Weissman, T., Eldar, Y. C. IEEE. 2013: 901–908
  • Reliable Uncoded Communication in the Underdetermined SIMO MAC with Low-Complexity Decoding 51st Annual Allerton Conference on Communication, Control, and Computing Chowdhury, M., Goldsmith, A., Weissman, T. IEEE. 2013: 1075–1081
  • Compression for Exact Match Identification IEEE International Symposium on Information Theory Proceedings (ISIT) Ingber, A., Courtade, T., Weissman, T. IEEE. 2013: 654–658
  • Pointwise Relations between Information and Estimation in the Poisson Channel IEEE International Symposium on Information Theory Proceedings (ISIT) Jiao, J., Venkat, K., Weissman, T. IEEE. 2013: 449–453
  • Network Compression: Worst-Case Analysis IEEE International Symposium on Information Theory Proceedings (ISIT) Asnani, H., Shomorony, I., Avestimehr, A. S., Weissman, T. IEEE. 2013: 196–200
  • Relations between Information and Estimation in the presence of Feedback (invited contribution to) Information and Control in Networks (accepted) Asnani, H., Venkat, K., Weissman, T. Cambridge University Press. 2013
  • Quadratic Similarity Queries on Compressed Data Data Compression Conference (DCC) Ingber, A., Courtade, T., Weissman, T. IEEE. 2013: 441–450
  • Uncoded transmission in MAC channels achieves arbitrarily small error probability 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton) Chowdhury, M., Goldsmith, A., Weissman, T. IEEE. 2013: 1983–1990
  • On Real Time Coding with Limited Lookahead IEEE Trans. Inform. Theory Asnani, H., Weissman, T. 2013; 59 (6): 3582-3606
  • The Human Genome Contracts Again Bioinformatics Pavlichin, D., Yona, G., Weissman, T. 2013
  • Estimation with a Helper who Knows the Interference IEEE Trans. Inform. Theory Chi, Y.K., Soundararajan, R., Weissman, T. 2013; 59 (11): 7097-7117
  • QualComp: a new lossy compressor for quality scores based on rate distortion theory BMC Bioinformatics Ochoa, I., Asnani, H., Bharadia, D., Chowdhury, M., Weissman, T. 2013: 14:187
  • Achievable Error Exponents in the Gaussian Channel with Rate-Limited Feedback IEEE Trans. Inform. Theory Mirghaderi, R., Goldsmith, A., Weissman, T. 2013; 59 (12): 8144-8156
  • Multiterminal Source Coding with Action Dependent Side Information IEEE Trans. Inform. Theory Chi, Y.K., Asnani, H., Weissman, T. 2013; 59 (6): 3653-3667
  • Reliable Uncoded Communication in the SIMO MAC via Low-Complexity Decoding IEEE International Symposium on Information Theory Proceedings (ISIT) Chowdhury, M., Goldsmith, A., Weissman, T. IEEE. 2013: 1645–1649
  • Capacity of a POST Channel with and without Feedback IEEE International Symposium on Information Theory Proceedings (ISIT) Asnani, H., Permuter, H. H., Weissman, T. IEEE. 2013: 2538–2542
  • Operational Extremality of Gaussianity in Network Compression, Communication, and Coding IEEE Information Theory Workshop (ITW) Asnani, H., Shomorony, I., Avestimehr, A. S., Weissman, T. IEEE. 2013
  • Pointwise Relations Between Information and Estimation in Gaussian Noise IEEE TRANSACTIONS ON INFORMATION THEORY Venkat, K., Weissman, T. 2012; 58 (10): 6264-6281
  • Achievable Complexity-Performance Tradeoffs in Lossy Compression PROBLEMS OF INFORMATION TRANSMISSION Gupta, A., Verdu, S., Weissman, T. 2012; 48 (4): 352-375
  • An MCMC Approach to Universal Lossy Compression of Analog Sources IEEE TRANSACTIONS ON SIGNAL PROCESSING Baron, D., Weissman, T. 2012; 60 (10): 5230-5240
  • Block and Sliding-Block Lossy Compression via MCMC IEEE TRANSACTIONS ON COMMUNICATIONS Jalali, S., Weissman, T. 2012; 60 (8): 2187-2198
  • Denoising via MCMC-Based Lossy Compression IEEE TRANSACTIONS ON SIGNAL PROCESSING Jalali, S., Weissman, T. 2012; 60 (6): 3092-3100
  • Cascade and Triangular Source Coding With Side Information at the First Two Nodes IEEE TRANSACTIONS ON INFORMATION THEORY Permuter, H. H., Weissman, T. 2012; 58 (6): 3339-3349
  • Lossy Compression of Discrete Sources via the Viterbi Algorithm IEEE TRANSACTIONS ON INFORMATION THEORY Jalali, S., Montanari, A., Weissman, T. 2012; 58 (4): 2475-2489
  • Mutual Information, Relative Entropy, and Estimation in the Poisson Channel IEEE TRANSACTIONS ON INFORMATION THEORY Atar, R., Weissman, T. 2012; 58 (3): 1302-1318
  • Cascade, Triangular, and Two-Way Source Coding With Degraded Side Information at the Second User IEEE TRANSACTIONS ON INFORMATION THEORY Chia, Y., Permuter, H. H., Weissman, T. 2012; 58 (1): 189-206
  • The Degraded Broadcast Channel with Action-Dependent States IEEE International Symposium on Information Theory Steinberg, Y., Weissman, T. IEEE. 2012: 596–600
  • Estimation with a Helper Who Knows the Interference IEEE International Symposium on Information Theory Chia, Y., Soundararajan, R., Weissman, T. IEEE. 2012: 706–710
  • Multiterminal Source Coding under Logarithmic Loss IEEE International Symposium on Information Theory Courtade, T. A., Weissman, T. IEEE. 2012: 761–765
  • Reference Based Genome Compression IEEE Information Theory Workshop (ITW) Chern, B. G., Ochoa, I., Manolakos, A., No, A., Venkat, K., Weissman, T. IEEE. 2012: 427–431
  • Universal Estimation of Directed Information via Sequential Probability Assignments IEEE International Symposium on Information Theory Jiao, J., Permuter, H. H., Zhao, L., Kim, Y., Weissman, T. IEEE. 2012: 523–527
  • Successive Refinement with Cribbing Decoders and its Channel Coding Duals IEEE International Symposium on Information Theory Asnani, H., Permuter, H., Weissman, T. IEEE. 2012
  • Pointwise Relations between Information and Estimation in Gaussian Noise IEEE International Symposium on Information Theory Venkat, K., Weissman, T. IEEE. 2012: 701–705
  • Joint Source-Channel Coding of one Random Variable over the Poisson Channel IEEE International Symposium on Information Theory No, A., Venkat, K., Weissman, T. IEEE. 2012
  • The Porosity of Additive Noise Sequences IEEE International Symposium on Information Theory Misra, V., Weissman, T. IEEE. 2012
  • Achievable Complexity-Performance Tradeoffs in Lossy Compression Problems of Information Transmission Gupta, A., Verdú, S., Weissman, T. 2012; 48 (4): 352-375
  • An MCMC Approach to Universal Lossy Compression of Analog Sources IEEE Trans. Sig. Proc. Baron, D., Weissman, T. 2012; 60 (10): 5230-5240
  • Cascade and Triangular Source Coding with Side Information at the First Two Nodes IEEE Trans. Inform. Theory Permuter, H. H., Weissman, T. 2012; 58 (6): 3309-3349
  • Denoising via MCMC-based Lossy Compression IEEE Trans. Sig. Proc. Jalali, S., Weissman, T. 2012; 60 (6): 3092-3100
  • Block and Sliding-Block Lossy Compression via MCMC IEEE Trans. on Communications Jalali, S., Weissman, T. 2012; 60 (8): 2187-2198
  • Mutual Information, Relative Entropy, and Estimation in the Poisson Channel IEEE Trans. Inform. Theory Atar, R., Weissman, T. 2012; 58 (3): 1302-1318
  • Cascade, Triangular and Two Way Source Coding with Degraded Side Information at the Second User IEEE Trans. Inform. Theory Chia, Y. K., Permuter, H., Weissman, T. 2012; 58 (1): 189-206
  • Worst-Case Source for Distributed Compression with Quadratic Distortion IEEE Information Theory Workshop (ITW) Shomorony, I., Avestimehr, A. S., Asnani, H., Weissman, T. IEEE. 2012: 187–191
  • Probing Capacity IEEE TRANSACTIONS ON INFORMATION THEORY Asnani, H., Permuter, H., Weissman, T. 2011; 57 (11): 7317-7332
  • Source Coding With a Side Information "Vending Machine" IEEE TRANSACTIONS ON INFORMATION THEORY Permuter, H. H., Weissman, T. 2011; 57 (7): 4530-4544
  • Interpretations of Directed Information in Portfolio Theory, Data Compression, and Hypothesis Testing IEEE TRANSACTIONS ON INFORMATION THEORY Permuter, H. H., Kim, Y., Weissman, T. 2011; 57 (6): 3248-3259
  • Error Exponents for the Gaussian Channel With Active Noisy Feedback IEEE TRANSACTIONS ON INFORMATION THEORY Kim, Y., Lapidoth, A., Weissman, T. 2011; 57 (3): 1223-1236
  • To Feed or Not to Feed Back IEEE International Symposium on Information Theory (ISIT) Asnani, H., Permuter, H., Weissman, T. IEEE. 2011: 159–163
  • Mutual Information, Relative Entropy, and Estimation in the Poisson Channel IEEE International Symposium on Information Theory (ISIT) Atar, R., Weissman, T. IEEE. 2011: 708–712
  • Discrete denoising of heterogeneous two-dimensional data IEEE International Symposium on Information Theory (ISIT) Moon, T., Weissman, T., Kim, J. IEEE. 2011: 1041–1045
  • Continuous-Time Directed Information and Its Role in Communication IEEE Information Theory Workshop (ITW) Permuter, H. H., Kim, Y., Weissman, T. IEEE. 2011
  • Bounds on the Entropy Rate of Binary Hidden Markov Processes Entropy of Hidden Markov Processes and Connections to Dynamical Systems Ordentlich, E., Weissman, T. edited by Marcus, B., Petersen, K., Weissman, T. Cambridge University Press. 2011: 117–171
  • Entropy of Hidden Markov Processes and Connections to Dynamical Systems Marcus, B., Petersen, K., Weissman, T. edited by Marcus, B., Petersen, K., Weissman, T. Cambridge University Press. 2011
  • Cascade and Triangular source coding with causal side information IEEE International Symposium on Information Theory (ISIT) Chia, Y., Weissman, T. IEEE. 2011: 1683–1687
  • Multi-terminal Source Coding With Action Dependent Side Information IEEE International Symposium on Information Theory (ISIT) Chia, Y., Asnani, H., Weissman, T. IEEE. 2011
  • Error Exponents for the Gaussian Channel with Active Noisy Feedback IEEE Trans. Inform. Theory Kim, Y.H., Lapidoth, A., Weissman, T. 2011; 57 (3): 1223-1236
  • Capacity of Channels With Action-Dependent States IEEE TRANSACTIONS ON INFORMATION THEORY Weissman, T. 2010; 56 (11): 5396-5411
  • The Relationship Between Causal and Noncausal Mismatched Estimation in Continuous-Time AWGN Channels IEEE TRANSACTIONS ON INFORMATION THEORY Weissman, T. 2010; 56 (9): 4256-4273
  • Tighter Bounds on the Capacity of Finite-State Channels Via Markov Set-Chains IEEE TRANSACTIONS ON INFORMATION THEORY Chen, J., Permuter, H., Weissman, T. 2010; 57 (8): 3660-3691
  • Two-Way Source Coding With a Helper IEEE TRANSACTIONS ON INFORMATION THEORY Permuter, H. H., Steinberg, Y., Weissman, T. 2010; 56 (6): 2905-2919
  • Universal Reinforcement Learning IEEE TRANSACTIONS ON INFORMATION THEORY Farias, V. F., Moallemi, C. C., Van Roy, B., Weissman, T. 2010; 56 (5): 2441-2454
  • A Universal Scheme for Wyner-Ziv Coding of Discrete Sources IEEE TRANSACTIONS ON INFORMATION THEORY Jalali, S., Verdu, S., Weissman, T. 2010; 56 (4): 1737-1750
  • Universal Estimation of Directed Information 2010 IEEE International Symposium on Information Theory Zhao, L., Permuter, H., Kim, Y., Weissman, T. IEEE. 2010: 1433–1437
  • Cascade and Triangular Source Coding with Side Information at the First Two Nodes 2010 IEEE International Symposium on Information Theory Permuter, H. H., Weissman, T. IEEE. 2010: 31–35
  • Universal Lossless Compression-based Denoising 2010 IEEE International Symposium on Information Theory Su, H., Weissman, T. IEEE. 2010: 1648–1652
  • The Relationship Between Causal and Non-Causal Mismatched Estimation in Continuous-Time AWGN Channels IEEE Trans. Inform. Theory Weissman, T. 2010; 56 (9): 4256-4273
  • A Universal Scheme for Wyner-Ziv Coding of Discrete Sources IEEE Trans. Inform. Theory Jalali, S., Verdú, S., Weissman, T. 2010; 56 (4): 1737-1750
  • Capacity of Channels with Action-Dependent States IEEE Trans. Inform. Theory Weissman, T. 2010; 56 (11): 5396-5411
  • Discrete Denoising With Shifts IEEE TRANSACTIONS ON INFORMATION THEORY Moon, T., Weissman, T. 2009; 55 (11): 5284-5301
  • A Context Quantization Approach to Universal Denoising IEEE TRANSACTIONS ON SIGNAL PROCESSING Sivaramakrishnan, K., Weissman, T. 2009; 57 (6): 2110-2129
  • Capacity Region of the Finite-State Multiple-Access Channel With and Without Feedback IEEE International Symposium on Information Theory Permuter, H. H., Weissman, T., Chen, J. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2009: 2455–77
  • Universal FIR MMSE Filtering IEEE TRANSACTIONS ON SIGNAL PROCESSING Moon, T., Weissman, T. 2009; 57 (3): 1068-1083
  • Finite State Channels With Time-Invariant Deterministic Feedback IEEE TRANSACTIONS ON INFORMATION THEORY Permuter, H. H., Weissman, T., Goldsmith, A. J. 2009; 55 (2): 644-662
  • A Context Quantization Approach to Universal denoising IEEE Trans. Sig. Proc. Sivaramakrishnan, K., Weissman, T. 2009; 57 (6): 2110-2129
  • Two-way source coding with a common helper IEEE International Symposium on Information Theory (ISIT 2009) Permuter, H., Steinberg, Y., Weissman, T. IEEE. 2009: 1473–1477
  • Problems We Can Solve With a Helper IEEE Information Theory Workshop on Networking and Information Theory Permuter, H., Steinberg, Y., Weissman, T. IEEE. 2009: 266–270
  • An Outer Bound for Side-Information Scalable Source Coding with Partially Cooperating Decoders IEEE International Symposium on Information Theory (ISIT 2009) Bross, S. I., Weissman, T. IEEE. 2009: 1194–1198
  • Multiple Description Coding of Discrete Ergodic Sources 47th Annual Allerton Conference on Communication, Control, and Computing Jalali, S., Weissman, T. IEEE. 2009: 1256–1261
  • Directed Information, Causal Estimation, and Communication in Continuous Time 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Kim, Y., Permuter, H. H., Weissman, T. IEEE. 2009: 632–638
  • Source Coding with a Side Information 'Vending Machine' at the Decoder IEEE International Symposium on Information Theory (ISIT 2009) Permuter, H., Weissman, T. IEEE. 2009: 1030–1034
  • Directed Information and Causal Estimation in Continuous Time IEEE International Symposium on Information Theory (ISIT 2009) Kim, Y., Permuter, H. H., Weissman, T. IEEE. 2009: 819–823
  • Capacity of Channels with Action-Dependent States IEEE International Symposium on Information Theory (ISIT 2009) Weissman, T. IEEE. 2009: 1794–1798
  • Discrete Denoising with Shifts IEEE Trans. Inform. Theory Moon, T., Weissman, T. 2009; 55 (11): 5284-5301
  • Finite-state channels with time-invariant deterministic feedback IEEE Trans. Inform. Theory Permuter, H., Weissman, T. 2009; 55 (2): 644-662
  • Capacity Region of the Multiple Access Channel With or Without Feedback IEEE Trans. Inform. Theory Permuter, H., Weissman, T. 2009; 55 (6): 2455-2477
  • An Iterative Scheme for Near Optimal and Universal Lossy Compression IEEE Information Theory Workshop on Networking and Information Theory Jalali, S., Montanari, A., Weissman, T. IEEE. 2009: 231–235
  • Universal Denoising of Discrete-Time Continuous-Amplitude Signals IEEE TRANSACTIONS ON INFORMATION THEORY Sivaramakrishnan, K., Weissman, T. 2008; 54 (12): 5632-5660
  • Scanning and Sequential Decision Making for Multidimensional Data-Part II: The Noisy Case IEEE TRANSACTIONS ON INFORMATION THEORY Cohen, A., Weissman, T., Merhav, N. 2008; 54 (12): 5609-5631
  • The Information Lost in Erasures IEEE International Symposium on Information Theory Verdu, S., Weissman, T. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2008: 5030–58
  • Coding for additive white noise channels with feedback corrupted by quantization or bounded noise IEEE TRANSACTIONS ON INFORMATION THEORY Martins, N. C., Weissman, T. 2008; 54 (9): 4274-4282
  • How to filter an "individual sequence with feedback" 44th Annual Allerton Conference on Communication, Control and Computing Weissman, T. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2008: 3831–41
  • Capacity of the trapdoor channel with feedback IEEE International Symposium on Information Theory Permuter, H., Cuff, P., Van Roy, B., Weissman, T. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2008: 3150–65
  • Universal filtering via hidden Markov modeling IEEE International Symposium on Information Theory and Its Applications Moon, T., Weissman, T. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2008: 692–708
  • An Implementable Scheme for Universal Lossy Compression of Discrete Markov Sources 19th Data Compression Conference Jalali, S., Montanari, A., Weissman, T. IEEE COMPUTER SOC. 2008: 292–301
  • Rate-Distortion in Near-Linear Time IEEE International Symposium on Information Theory Gupta, A., Verdu, S., Weissman, T. IEEE. 2008: 847–851
  • Near optimal lossy source coding and compression-based denoising via Markov Chain Monte Carlo 42nd Annual Conference on Information Sciences and Systems Jalali, S., Weissman, T. IEEE. 2008: 441–446
  • RATE-DISTORTION WITH COMMON RATE-LIMITED SIDE INFORMATION TO THE ENCODER AND DECODER 47th AIAA Aerospace Sciences Meeting and Exhibit including the New Horizons Forum and Aerospace Exposition Permuter, H., Steinberg, Y., Weissman, T. IEEE. 2008: 777–779
  • Rate-Distortion via Markov Chain Monte Carlo IEEE International Symposium on Information Theory Jalali, S., Weissman, T. IEEE. 2008: 852–856
  • Lossy source coding via Markov chain Monte Carlo International Zurich Seminar on Communications Jalali, S., Weissman, T. IEEE. 2008: 80–83
  • Scanning and sequential decision making for multi-dimensional data, Part II: the noisy case IEEE Trans. Inform. Theory Cohen, A., Weissman, T., Merhav, N. 2008; 54 (12): 5609-5631
  • On Directed Information and Gambling IEEE International Symposium on Information Theory Permuter, H. H., Kim, Y., Weissman, T. IEEE. 2008: 1403–1407
  • Universal denoising of discretetime continuous-amplitude signals IEEE Trans. Inform. Theory Sivaramakrishnan, K., Weissman, T. 2008; 54 (12): 5632-5660
  • The Information Lost in Erasures IEEE Trans. Inform. Theory Verdú, S., Weissman, T. 2008; 54 (11): 5030-5058
  • How to filter an 'individual sequence with feedback' IEEE Trans. Inform. Theory Weissman, T. 2008; 54 (8): 3831-3841
  • Discrete Universal Filtering via Hidden Markov Modeling IEEE Trans. Inform. Theory Moon, T., Weissman, T. 2008; 54 (2): 692 - 708
  • Universal FIR MMSE filtering IEEE Trans. Sig. Proc. Moon, T., Weissman, T. 2008; 57 (3): 1068-1083
  • Coding Schemes for Additive White Noise Channels with Feedback Corrupted by Quantization or Bounded Noise IEEE Trans. Inform. Theory Martins, N.C., Weissman, T. 2008; 54 (9): 4274-4282
  • On the Capacity of Finite-State Channels IEEE International Symposium on Information Theory Chen, J., Permuter, H., Weissman, T. IEEE. 2008: 1223–1227
  • New Bounds for the Capacity Region of the Finite-State Multiple Access Channel IEEE International Symposium on Information Theory Permuter, H. H., Weissman, T., Chen, J. IEEE. 2008: 394–398
  • Scanning and sequential decision making for multidimensional data - Part I : The noiseless case IEEE International Symposium on Information Theory Cohen, A., Merhav, N., Weissman, T. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2007: 3001–20
  • Universal filtering via prediction Data Compression Conference (DCC 2004) Weissman, T., Ordentlich, E., Weinberger, M. J., Somekh-Baruch, A., Merhav, N. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2007: 1253–64
  • Denoising and filtering under the probability of excess loss criterion 43rd Annual Allerton Conference on Communication, Control and Computing Pereira, S., Weissman, T. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2007: 1265–81
  • On separation in the presence of feedback IEEE Information Theory Workshop Permuter, H., Weissman, T. IEEE. 2007: 266–270
  • Scanning and sequential decision making for multidimensional data IEEE Information Theory and Applications Workshop Cohen, A., Merhav, N., Weissman, T. IEEE. 2007: 99–108
  • Scanning, filtering and prediction for random fields corrupted by Gaussian noise IEEE International Symposium on Information Theory Cohen, A., Merhav, N., Weissman, T. IEEE. 2007: 691–695
  • The Gaussian channel with noisy feedback IEEE International Symposium on Information Theory Kim, Y., Lapidoth, A., Weissman, T. IEEE. 2007: 1416–1420
  • Competitive on-line linear FIR MMSE filtering IEEE International Symposium on Information Theory Moon, T., Weissman, T. IEEE. 2007: 1126–1130
  • A context quantization approach to universal denoising IEEE International Symposium on Information Theory Sivaramakrishnan, K., Weissman, T. IEEE. 2007: 2361–2365
  • Scanning and sequential decision making for multi-dimensional data, Part I: the noiseless case IEEE Trans. Inform. Theory Cohen, A., Merhav, N., Weissman, T. 2007; 53 (9): 3001 - 3020
  • New bounds on the rate-distortion function of a binary Markov source IEEE International Symposium on Information Theory Jalali, S., Weissman, T. IEEE. 2007: 571–575
  • A universal Wyner-Ziv scheme for discrete sources IEEE International Symposium on Information Theory Jalali, S., Verdu, S., Weissman, T. IEEE. 2007: 1951–1955
  • Reflections on the DUDE IEEE Information Theory Society Newsletter Ordentlich, E., Serouss, G., Verd_x0013_u, S., Weinberger, M., Weissman, T. 2007; 57 (2): 5-10
  • Denoising and filtering under the probability of excess loss criterion IEEE Trans. Inform. Theory Matloub, S., Weissman, T. 2007; 53 (4): 1265 - 1281
  • Capacity and zero-error capacity of the chemical channel with feedback IEEE International Symposium on Information Theory Permuter, H., Cuff, P., Van Roy, B., Weissman, T. IEEE. 2007: 1866–1870
  • Source coding with limited-look-ahead side information at the decoder IEEE International Symposium on Information Theory Weissman, T., El Gamal, A. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2006: 5218–39
  • Universal zero-delay joint source-channel coding 38th Conference on Information Sciences and Systems Matloub, S., Weissman, T. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2006: 5240–50
  • On the entropy rate of pattern processes IEEE TRANSACTIONS ON INFORMATION THEORY Gemelos, G. M., Weissman, T. 2006; 52 (9): 3994-4007
  • Coding for the feedback Gel'fand-Pinsker channel and the feedforward Wyner-Ziv source IEEE International Symposium on Information Theory and Its Applications Merhav, N., Weissman, T. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2006: 4207–11
  • Universal minimax discrete denoising under channel uncertainty IEEE International Symposium on Information Theory Gemelos, G. M., Sigurjonsson, S., Weissman, T. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2006: 3476–97
  • Algorithms for discrete denoising under channel uncertainty IEEE TRANSACTIONS ON SIGNAL PROCESSING Gemelos, G. A., Sigurjonsson, S., Weissman, T. 2006; 54 (6): 2263-2276
  • Coding for the feedback Gel'fand-Pinsker channel and the feedforward Wyner-Ziv source IEEE Trans. Inform. Theory Weissman, T., Merhav, N. 2006; 52 (9): 4207 - 4211
  • Universal scanning and sequential decision making for multidimensional data IEEE International Symposium on Information Theory Cohen, A., Merhav, N., Weissman, T. IEEE. 2006: 431–435
  • Erasure entropy IEEE International Symposium on Information Theory Verdu, S., Weissman, T. IEEE. 2006: 98–102
  • Universal scanning of mixing ra the performance of the peano ndom fields and Peano-Hilbert scan 24th IEEE Convention of Electrical and Electronics Engineers in Israel Cohen, A., Merhav, N., Weissman, T. IEEE. 2006: 62–66
  • On the optimality of symbol-by-symbol filtering and denoising IEEE International Symposium on Information Theory Ordentlich, E., Weissman, T. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2006: 19–40
  • Compound sequential decisions against the well-informed antagonist IEEE Information Theory Workshop Weissman, T. IEEE. 2006: 77–81
  • Universal denoising of continuous amplitude signals with applications to images IEEE International Conference on Image Processing (ICIP 2006) Sivaramakrishnan, K., Weissman, T. IEEE. 2006: 2609–2612
  • Universal Zero-Delay Joint Source-Channel Coding IEEE Trans. Inform. Theory Matloub, S., Weissman, T. 2006; 52 (12): 5240 - 5250
  • Universal Minimax Discrete Denoising under Channel Uncertainty IEEE Trans. Inform. Theory Gemelos, G., Sigurjonsson, S., Weissman, T. 2006; 52 (8): 3476-3497
  • Universal denoising of discrete-time continuous-amplitude signals IEEE International Symposium on Information Theory Sivaramakrishnan, K., Weissman, T. IEEE. 2006: 2531–2535
  • Source Coding with Limited Side Information Lookahead at the Decoder IEEE Trans. Inform. Theory Weissman, T., Gamal, A., El 2006; 52 (12): 5218 - 5239
  • Source coding with limited side information lookahead at the decoder IEEE International Symposium on Information Theory El Gamal, A., Weissman, T. IEEE. 2006: 2441–2445
  • 2006 Kailath Lecture and Colloquia Verdú, S., Weissman, T. Newsletter article in the IEEE Information Theory Society Newsletter. 2006
  • On the Entropy Rate of Pattern Processes IEEE Trans. Inform. Theory Gemelos, G., Weissman, T. 2006; 52 (9): 3994 - 4007
  • Algorithms for Discrete Denoising under Channel Uncertainty IEEE Trans. Inform. Theory Gemelos, G., Sigurjonsson, S., Weissman, T. 2006; 54 (6): 2263-2276
  • On the Optimality of Symbol by Symbol Fitering and Denoising IEEE Trans. Inform. Theory Ordentlich, E., Weissman, T. 2006; 52 (1): 19-40
  • Bounds on the error exponent of the AWGN channel with AWGN-corrupted feedback 24th IEEE Convention of Electrical and Electronics Engineers in Israel Kim, Y., Lapidoth, A., Weissman, T. IEEE. 2006: 184–188
  • Capacity of finite-state channels with time-invariant deterministic feedback IEEE International Symposium on Information Theory Permuter, H., Weissman, T., Goldsmith, A. IEEE. 2006: 64–68
  • The empirical distribution of rate-constrained source codes IEEE TRANSACTIONS ON INFORMATION THEORY Weissman, T., Ordentlich, E. 2005; 51 (11): 3718-3733
  • On causal source codes with side information 40th Annual Allerton Conference on Communication, Control and Computing Weissman, T., Merhav, N. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2005: 4003–13
  • Universal denoising for the finite-input general-output channel IEEE International Symposium on Information Theory Dembo, A., Weissman, T. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2005: 1507–17
  • Universal Denoising for the Finite-Input- General-Output Channel IEEE Trans. Inform. Theory Dembo, A., Weissman, T. 2005; 51 (4): 1507-1517
  • On the entropy rate of pattern processes IEEE Data Compression Conference Gemelos, G. M., Weissman, T. IEEE COMPUTER SOC. 2005: 233–242
  • Universal discrete denoising: Known channel IEEE International Symposium on Information Theory Weissman, T., Ordentlich, E., Seroussi, G., Verdu, S., Weinberger, M. J. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2005: 5–28
  • On the relationship between process and pattern entropy rate IEEE International Symposium on Information Theory and Its Applications Gemelos, G. M., Weissman, T. IEEE. 2005: 2208–2212
  • Coding for the feedback Gel'fand-Pinsker channel and the feedforward Wyner-Ziv source IEEE International Symposium on Information Theory and Its Applications Merhav, N., Weissman, T. IEEE. 2005: 1506–1510
  • Approximations for the entropy rate of a hidden Markov process IEEE International Symposium on Information Theory and Its Applications Ordentlich, E., Weissman, T. IEEE. 2005: 2198–2202
  • Discrete universal filtering via hidden Markov modelling IEEE International Symposium on Information Theory and Its Applications Moon, T., Weissman, T. IEEE. 2005: 1285–1289
  • Asymptotic filtering and entropy rate of a hidden Markov process in the rare transitions regime IEEE International Symposium on Information Theory and Its Applications Nair, C., Ordentlich, E., Weissman, T. IEEE. 2005: 1838–1842
  • On Causal Source Codes with Side Information IEEE Trans. Inform. Theory Weissman, T., Merhav, N. 2005; 51 (11): 4003-4013
  • Discrete Denoising for Channels with Memory Comm. in Information and Systems Zhang, R., Weissman, T. 2005; 5 (2): 257-288
  • The empirical distribution of rate-constrained codes IEEE Trans. Inform. Theory Weissman, T., Ordentlich, E. 2005; 51 (11): 3718-3733
  • Universal Discrete Denoising: Known Channel IEEE Trans. Inform. Theory Weissman, T., Ordentlich, E., Seroussi, G., Verdú, S., Weinberger, M. 2005; 51 (1): 5-28
  • Multi-directional context sets with applications to universal denoising and compression IEEE International Symposium on Information Theory and Its Applications Ordentlich, E., Weinberger, M. J., Weissman, T. IEEE. 2005: 1270–1274
  • A universal scheme for learning IEEE International Symposium on Information Theory and Its Applications Farias, V. F., Moallemi, C. C., Van Roy, B., Weissman, T. IEEE. 2005: 1158–1162
  • Universally attainable error exponents for rate-distortion coding of noisy sources IEEE TRANSACTIONS ON INFORMATION THEORY Weissman, T. 2004; 50 (6): 1229-1246
  • Universal prediction of random binary sequences in a noisy environment ANNALS OF APPLIED PROBABILITY Weissman, T., Merhav, N. 2004; 14 (1): 54-89
  • Universal minimax binary image denoising under channel uncertainty International Conference on Image Processing (ICIP 2004) Gemelos, G., Sigurjonsson, S., Weissman, T. IEEE. 2004: 997–1000
  • Universal denoising for the finite-input-general-output channel IEEE International Symposium on Information Theory Dembo, A., Weissman, T. IEEE. 2004: 201–201
  • The empirical distribution of rate - Constrained source codes IEEE International Symposium on Information Theory Weissman, T., Ordentlich, E. IEEE. 2004: 464–464
  • New bounds on the entropy rate of hidden Markov processes IEEE Information Theory Workshop Ordentlich, E., Weissman, T. IEEE. 2004: 117–122
  • Channel decoding of systematically encoded unknown redundant sources IEEE International Symposium on Information Theory Ordentlich, E., Seroussi, G., Verdu, S., Viswanathan, K., Weinberger, M. J., Weissman, T. IEEE. 2004: 165–165
  • Efficient pruning of bi-directional context trees with applications to universal denoising and compression IEEE Information Theory Workshop Ordentlich, E., Weinberger, M. J., Weissman, T. IEEE. 2004: 94–98
  • On the optimality of symbol by symbol filtering and denoising IEEE International Symposium on Information Theory Ordentlich, E., Weissman, T. IEEE. 2004: 200–200
  • Discrete universal filtering through incremental parsing Data Compression Conference (DCC 2004) Ordentlich, E., Weissman, T., Weinberger, M. J., Somekh-Baruch, A., Merhav, N. IEEE COMPUTER SOC. 2004: 352–361
  • Universal minimax discrete denoising under channel uncertainty IEEE International Symposium on Information Theory Gemelos, G., Sigurjonsson, S., Weissman, T. IEEE. 2004: 199–199
  • On the Entropy Rate of Pattern Sequences HP Laboratories Technical Report Gemelos, G., Weissman, T. 2004
  • Universally Attainable Error-Exponents for Rate-Distortion Coding of Noisy Sources IEEE Trans. Inform. Theory Weissman, T. 2004; 50 (6): 1229-1246
  • Universal prediction of random binary sequences in a noisy environment Annals of Applied Probability Weissman, T., Merhav, N. 2004; 14 (1): 54-89
  • On competitive prediction and its relation to rate-distortion theory IEEE TRANSACTIONS ON INFORMATION THEORY Weissman, T., Merhav, N. 2003; 49 (12): 3185-3194
  • The minimax distortion redundancy in noisy source coding IEEE TRANSACTIONS ON INFORMATION THEORY Dembo, A., Weissman, T. 2003; 49 (11): 3020-3030
  • Scanning and Prediction in Multi-Dimensional Data Arrays IEEE Trans. Inform. Theory Merhav, N., Weissman, T. 2003; IT-49 (1): 65-82
  • Scanning and prediction in multidimensional data arrays IEEE International Symposium on Information Theory Merhav, N., Weissman, T. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2003: 65–82
  • A discrete universal denoiser and its application to binary images IEEE International Conference on Image Processing Ordentlich, E., Seroussi, G., Verdu, S., Weinberger, M., Weissman, T. IEEE. 2003: 117–120
  • Universally attainable error-exponents for rate-distortion coding of noisy sources IEEE International Symposium on Information Theory Weissman, T. IEEE. 2003: 194–194
  • On competitive prediction and its relation to rate-distortion theory and to channel capacity theory IEEE International Symposium on Information Theory Weissman, T., Merhav, N. IEEE. 2003: 81–81
  • On Competitive Prediction and its Relation to Rate-Distortion Theory IEEE Trans. Inform. Theory Weissman, T., Merhav, N. 2003; 49 (12): 3185-3194
  • On limited-delay lossy coding and filtering of individual sequences IEEE TRANSACTIONS ON INFORMATION THEORY Weissman, T., Merhav, N. 2002; 48 (3): 721-733
  • Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding IEEE TRANSACTIONS ON INFORMATION THEORY Weissman, T., Merhav, N. 2002; 48 (2): 396-415
  • Universally Attainable Error-Exponents for Rate-Constrained Denoising of Noisy Sources HP Laboratories Technical Report Weissman, T. 2002
  • The minimax distortion redundancy in noisy source coding IEEE International Symposium on Information Theory Dembo, A., Weissman, T. IEEE. 2002: 318–318
  • On Competitive Prediction and its Relation to Rate-Distortion Theory and to Channel Capacity Theory Technion – I.I.T., CC Pub., EE Pub. Weissman, T., Merhav, N. 2002
  • On limited-delay lossy coding and filtering of individual sequences IEEE Trans. Inform. Theory Weissman, T., Merhav, N. 2002; IT-48 (3): 721-733
  • Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding IEEE Trans. Inform. Theory Weissman, T., Merhav, N. 2002; IT-48 (2): 396-415
  • Universal prediction of individual binary sequences in the presence of noise IEEE TRANSACTIONS ON INFORMATION THEORY Weissman, T., Merhav, N. 2001; 47 (6): 2151-2173
  • Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence IEEE International Symposium on Information Theory Weissman, T., Merhav, N., Somekh-Baruch, A. IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC. 2001: 1849–66
  • Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence IEEE Trans. Inform. Theory Weissman, T., Merhav, N., Somekh-Baruch, A. 2001; IT-47 (5): 1849-1866
  • Tradeoffs between the excess-code-length exponent and the excess-distortion exponent in lossy source coding Technical Report, CCIT Pub., EE Pub. Weissman, T., Merhav, N. 2001
  • Universal prediction of binary individual sequences in the presence of noise IEEE Trans. Inform. Theory Weissman, T., Merhav, N. 2001; IT-47 (6): 2151-2173
  • Universal prediction of individual binary sequences in the presence of noise Technion – I.I.T., CC Pub., EE Pub. Weissman, T., Merhav, N. 1999