Universal Source Coding for Multiple Decoders with Side

Universal Source Coding for Multiple Decoders with Side

2010 IEEE International Symposium on Information Theory Proceedings (ISIT 2010) Austin, Texas, USA 13 – 18 June 2010 Pages 1-908 IEEE Catalog Number: CFP10SIF-PRT ISBN: 978-1-4244-7890-3 1/3 TABLE OF CONTENTS Plenary Sessions Monday 8:30 – 9:30 — Completely Random Measures for Bayesian Nonparametrics .........................................................................xlv Michael I. Jordan Tuesday 8:30 – 9:30 — Coding for Noisy Networks .................................................................................................................................xlv Abbas El Gamal Wednesday 8:30 – 9:30 — THE AUDACITY OF THROUGHPUT – A Trilogy of Rates – ........................................................................xlv Anthony Ephremides Thursday 8:30 – 9:30 — Musing upon Information Theory ......................................................................................................................xliv Te Sun Han Friday 8:30 – 9:30 — Can Structure Beat Shannon? — The Secrets of Lattice-codes ...............................................................................xlv Ram Zamir S-Mo-1: MULTI-TERMINAL SOURCE CODING S-Mo-1.1: UNIVERSAL SOURCE CODING FOR MULTIPLE DECODERS WITH SIDE ............................................................................... 1 INFORMATION Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu S-Mo-1.2: ROBUST MULTIRESOLUTION CODING WITH HAMMING DISTORTION ............................................................................ 6 MEASURE Jun Chen, Sorina Dumitrescu, Ying Zhang, Jia Wang S-Mo-1.3: ON ZERO-ERROR SOURCE CODING WITH FEEDBACK .......................................................................................................11 Mayank Bakshi, Michelle Effros S-Mo-1.4: RATE DISTORTION WITH SIDE-INFORMATION AT MANY RECEIVERS ...............................................................................16 Roy Timo, Terence Chan, Alex Grant S-Mo-2: GAUSSIAN MULTI-TERMINAL SOURCE CODING I S-Mo-2.1: THE GENERALIZED QUADRATIC GAUSSIAN CEO PROBLEM: NEW CASES ....................................................................21 WITH TIGHT RATE REGION AND APPLICATIONS Yang Yang, Yifu Zhang, Zixiang Xiong S-Mo-2.2: SUM RATE OF THE VACATIONING CEO PROBLEM ..............................................................................................................26 Rajiv Soundararajan, Aaron Wagner, Sriram Vishwanath S-Mo-2.3: CASCADE AND TRIANGULAR SOURCE CODING WITH SIDE INFORMATION AT .........................................................31 THE FIRST TWO NODES Haim Permuter, Tsachy Weissman S-Mo-2.4: ON THE EXCESS DISTORTION EXPONENT OF THE QUADRATIC-GAUSSIAN .................................................................36 WYNER-ZIV PROBLEM Yuval Kochman, Gregory W. Wornell S-Mo-3: GAUSSIAN MULTI-TERMINAL SOURCE CODING II S-Mo-3.1: ON THE SUM-RATE LOSS OF QUADRATIC GAUSSIAN MULTITERMINAL .........................................................................41 SOURCE CODING Yang Yang, Yifu Zhang, Zixiang Xiong vii S-Mo-3.2: ON THE SUM RATE OF VECTOR GAUSSIAN MULTITERMINAL SOURCE ..........................................................................46 CODING Jia Wang, Jun Chen S-Mo-3.3: DISTRIBUTED SOURCE CODING OF CORRELATED MEMORYLESS GAUSSIAN ...............................................................51 OBSERVATIONS Yasutada Oohama S-Mo-3.4: RATE REGION OF THE GAUSSIAN SCALAR-HELP-VECTOR SOURCE-CODING ...............................................................56 PROBLEM Md Saifur Rahman, Aaron Wagner S-Mo-4: RATE-DISTORTION THEORY S-Mo-4.1: INTERACTION STRICTLY IMPROVES THE WYNER-ZIV RATE-DISTORTION .........................................................................61 FUNCTION Nan Ma, Prakash Ishwar S-Mo-4.2: ON THE RATE DISTORTION FUNCTION OF BERNOULLI GAUSSIAN ...............................................................................66 SEQUENCES Cheng Chang S-Mo-4.3: ON THE PHYSICS OF RATE-DISTORTION THEORY ................................................................................................................71 Neri Merhav S-Mo-4.4: IMPROVED UPPER BOUNDS TO THE CAUSAL QUADRATIC RATE-DISTORTION ..............................................................76 FUNCTION FOR GAUSSIAN STATIONARY SOURCES Milan Derpich, Jan Ostergaard S-Tu-1: SOURCE CODING UNDER CONSTRAINTS S-Tu-1.1: ON OPTIMAL CAUSAL CODING OF PARTIALLY OBSERVED MARKOV SOURCES ..............................................................81 UNDER CLASSICAL AND NON-CLASSICAL INFORMATION STRUCTURES Serdar Yuksel S-Tu-1.2: STRUCTURE THEOREM FOR REAL-TIME VARIABLE-RATE LOSSY SOURCE .............................................................................86 ENCODERS AND MEMORY-LIMITED DECODERS WITH SIDE INFORMATION Yonatan Kaspi, Neri Merhav S-Tu-1.3: SOURCE CODING WITH SIDE INFORMATION USING LIST DECODING ...........................................................................91 Mortuza Ali, Margreta Kuijper S-Tu-1.4: SOURCE CODING WITH FEEDFORWARD USING THE POSTERIOR ....................................................................................96 MATCHING SCHEME Hani-James Ebeid, Todd Coleman S-Tu-2: CODING FOR SOURCES I S-Tu-2.1: ASYMPTOTIC OPTIMALITY OF ANTIDICTIONARY CODES .................................................................................................. 101 Takahiro Ota, Hiroyoshi Morita S-Tu-2.2: FRACTAL COMPRESSION RATE CURVES IN LOSSLESS COMPRESSION OF .................................................................... 106 BALANCED TREES Sang-Youn Oh, John Kieffer S-Tu-2.3: LOCAL COORDINATES OF A TRELLIS SOURCE CODE .......................................................................................................... 111 John Kieffer, John Marcos S-Tu-2.4: CASES WHERE FINDING THE MINIMUM ENTROPY COLORING OF A .......................................................................... 116 CHARACTERISTIC GRAPH IS A POLYNOMIAL TIME PROBLEM Soheil Feizi, Muriel Medard viii S-Tu-3: CODING FOR SOURCES II S-Tu-3.1: ON THE ERROR EXPONENT TO REDUNDANCY RATIO OF INTERACTIVE ....................................................................... 121 ENCODING AND DECODING Jin Meng, En-Hui Yang S-Tu-3.2: ON THE ACHIEVABLE REDUNDANCY RATE OF FIXED LENGTH SOURCE ........................................................................ 126 CODE FOR GENERAL SOURCES Mitsuharu Arimura, Ken-Ichi Iwata S-Tu-3.3: ON THE OVERFLOW PROBABILITY OF LOSSLESS CODES WITH SIDE .............................................................................. 131 INFORMATION Ryo Nomura, Toshiyasu Matsushima S-Tu-4: JOINT SOURCE-CHANNEL CODING S-Tu-4.1: A TIGHT BOUND ON THE PERFORMANCE OF A MINIMAL DELAY JOINT ..................................................................... 136 SOURCE-CHANNEL CODING SCHEME Marius Kleiner, Bixio Rimoldi S-Tu-4.2: ON OPTIMALITY OF A HYBRID DIGITAL/ANALOG SCHEME FOR WYNER-ZIV .............................................................. 141 CODING OVER BROADCAST CHANNELS Yang Gao, Ertem Tuncel S-Tu-4.3: THE ACHIEVABLE DISTORTION REGION OF BIVARIATE GAUSSIAN SOURCE ................................................................ 146 ON GAUSSIAN BROADCAST CHANNEL Chao Tian, Suhas Diggavi, Shlomo Shamai (Shitz) S-Tu-4.4: DISTRIBUTED SIGNAL CANCELATION INSPIRED BY WITSENHAUSEN’S ........................................................................ 151 COUNTEREXAMPLE Pulkit Grover, Anant Sahai S-Tu-4.5: DISTORTION EXPONENTS OF TWO-WAY RELAYING COOPERATIVE .............................................................................. 156 NETWORKS Jing Wang, Jie Liang S-We-2: CODING FOR SOURCE NETWORKS I S-We-2.1: EXACT-REPAIR MDS CODES FOR DISTRIBUTED STORAGE USING .................................................................................. 161 INTERFERENCE ALIGNMENT Changho Suh, Kannan Ramchandran S-We-2.2: INTERFERENCE NEUTRALIZATION IN DISTRIBUTED LOSSY SOURCE ............................................................................. 166 CODING Mohammad Ali Maddah-Ali, David Tse S-We-2.3: HAMMING CODING FOR MULTIPLE SOURCES ................................................................................................................. 171 Rick Ma, Samuel Cheng S-We-2.4: TWO-WAY SOURCE CODING THROUGH A RELAY .......................................................................................................... 176 Han-I Su, Abbas El Gamal S-Th-1: CODING FOR SOURCE NETWORKS II S-Th-1.1: OPTIMAL MULTIRESOLUTION QUANTIZATION FOR BROADCAST CHANNELS ............................................................. 181 WITH RANDOM INDEX ASSIGNMENT Fei Teng, En-Hui Yang, Xiang Yu S-Th-1.2: UNIVERSAL SLEPIAN-WOLF SOURCE CODES USING LOW-DENSITY .............................................................................. 186 PARITY-CHECK MATRICES Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto S-Th-1.3: IDENTIFICATION AND LOSSY RECONSTRUCTION IN NOISY DATABASES ..................................................................... 191 Ertem Tuncel, Deniz Gunduz ix S-Th-1.4: ON THE MEMORY REQUIRED TO COMPUTE FUNCTIONS OF STREAMING ................................................................. 196 DATA Krishnamurthy Viswanathan S-Th-2: CAPACITY S-Th-2.1: THE CAPACITY OF THE UNIFORM NOISE REWRITABLE CHANNEL WITH ....................................................................... 201 AVERAGE COST Luis A. Lastras-Montaño, Michele M. Franceschini, Thomas Mittelholzer S-Th-2.2: A FOKKER-PLANCK DIFFERENTIAL EQUATION APPROACH FOR THE ..............................................................................

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    38 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us