default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISIT 2012: Cambridge, MA, USA
- Proceedings of the 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, USA, July 1-6, 2012. IEEE 2012, ISBN 978-1-4673-2580-6
Source Coding with Side Information
- Avraham Reani, Neri Merhav:
Data processing lower bounds for scalar lossy source codes with side information at the decoder. 1-5 - Yi-Peng Wei, Shih-Chun Lin, Yu-Hsiu Lin, Hsuan-Jung Su
:
Graph-based code design for quadratic-Gaussian Wyner-Ziv problem with arbitrary side information. 6-10 - Osvaldo Simeone, Haim H. Permuter:
Source coding with delayed side information. 11-15 - Nan Ma, Kannan Ramchandran, David N. C. Tse:
A compression algorithm using mis-aligned side-information. 16-20
Multiple Access Codes
- Toni Ernvall, Roope Vehkalahti:
Construction of MIMO MAC codes achieving the pigeon hole bound. 21-25 - Babak Mamandipoor, Kamyar Moshksar, Amir K. Khandani:
On the sum-capacity of Gaussian MAC with peak constraint. 26-30 - Eli Haim, Yuval Kochman, Uri Erez:
Expurgation for discrete multiple-access channels via linear codes. 31-35 - Ebrahim MolavianJazi, J. Nicholas Laneman:
Simpler achievable rate regions for multiaccess with finite blocklength. 36-40
Two-Unicast Networks
- I-Hsiang Wang:
On two unicast wireless networks with destination-to-source feedback. 41-45 - I-Hsiang Wang, Suhas N. Diggavi:
On degrees of freedom of layered two unicast networks with delayed CSIT. 46-50 - Jianwei Xie, Sennur Ulukus:
On the sum secure degrees of freedom of two-unicast layered wireless networks. 51-55 - Sang-Woon Jeon, Chien-Yi Wang, Michael Gastpar:
Approximate ergodic capacity of a class of fading 2-user 2-hop networks. 56-60
Secrecy Modesl in Wiretap Channels
- Shun Watanabe, Yasutada Oohama:
Broadcast channels with confidential messages by randomness constrained stochastic encoder. 61-65 - Curt Schieler, Paul Cuff:
Secrecy is cheap if the adversary must reconstruct. 66-70 - Fan Cheng, Raymond W. Yeung, Kenneth W. Shum:
Imperfect secrecy in wiretap channel II. 71-75 - Rafael F. Wyrembelski, Holger Boche:
Strong secrecy in compound broadcast channels with confidential messages. 76-80
List Decoding and Reed-Solomon Codes
- Tom Kolan, Ron M. Roth:
Burst list decoding of interleaved Reed-Solomon codes. 81-85 - Olav Geil, Ryutaroh Matsumoto, Diego Ruano:
List decoding algorithms based on Gröbner bases for general one-point AG codes. 86-90 - Jean-François Biasse, Guillaume Quintin:
An algorithm for list decoding number field codes. 91-95 - Guillaume Quintin:
A lifting decoding scheme and its application to interleaved linear codes. 96-100
Combinatorical Problems in Coding
- Alexander Barg, Marcelo Firer:
Translation association schemes, poset metrics, and the shape enumerator of codes. 101-105 - Eitan Yaakobi, Jehoshua Bruck:
On the uncertainty of information retrieval in associative memories. 106-110 - Erik Ordentlich, Ron M. Roth, Gadiel Seroussi:
On q-ary antipodal matchings and applications. 111-115 - Carl Bracken, Yeow Meng Chee, Punarbasu Purkayastha:
Optimal family of q-ary codes obtained from a substructure of generalised Hadamard matrices. 116-119
Gaussian Channels
- Andrew R. Barron, Sanghee Cho:
High-rate sparse superposition codes with iteratively optimal estimates. 120-124 - Ronit Bustin, Shlomo Shamai (Shitz):
The capacity of the multi-MMSE constrained Gaussian channel. 125-129 - Amir Ingber, Ram Zamir:
Expurgated infinite constellations at finite dimensions. 130-134 - Tobias Koch, Alfonso Martinez, Albert Guillen i Fabregas:
The capacity loss of dense constellations. 135-139
Information Theoretic Tools and Properties
- Neri Merhav:
On optimum strategies for minimizing the exponential moments of a loss function. 140-144 - Sangwoo Park, Erchin Serpedin, Khalid A. Qaraqe:
On the equivalence between Stein identity and de Bruijn identity. 145-149 - Imre Csiszár, Frantisek Matús:
Minimization of entropy functionals revisited. 150-154 - Jorge F. Silva, Patricio Parada:
Shannon entropy convergence results in the countable infinite case. 155-159
Theory of Quantum Error Correction
- Marco Dalai:
Sphere packing bound for quantum channels. 160-164 - Sushma Nadella, Andreas Klappenecker:
Stabilizer codes over Frobenius rings. 165-169 - Andreas Klappenecker:
Nice nearrings. 170-173
Network Source Coding with Side Information
- Tetsunao Matsuta, Tomohiko Uyematsu:
A general formula of rate-distortion functions for source coding with side information at many decoders. 174-178 - Behzad Ahmadi, Ravi Tandon, Osvaldo Simeone, H. Vincent Poor:
On the Heegard-Berger problem with common reconstruction constraints. 179-183 - Behzad Ahmadi, Osvaldo Simeone:
Distributed and cascade lossy source coding with a side information "vending machine". 184-188 - Thomas A. Courtade:
Information masking and amplification: The source coding setting. 189-193
Variations on Broadcast Channels
- Seçkin Anil Yildirim, Melda Yuksel:
Multiple description coding based compress-and-forward for the broadcast relay channel. 194-198 - Lin Song, Jun Chen, Chao Tian:
Broadcast correlated Gaussians: The vector-scalar case. 199-203 - Louis Tan, Ashish Khisti, Emina Soljanin:
Quadratic Gaussian source broadcast with individual bandwidth mismatches. 204-208 - Kfir M. Cohen, Avi Steiner, Shlomo Shamai (Shitz):
The broadcast approach under mixed delay constraints. 209-213
Multi-Hop Multi-Flow Wireless Networks
- Ilan Shomorony, Amir Salman Avestimehr:
Is Gaussian noise the worst-case additive noise in wireless networks? 214-218 - Chouchang Yang, Basel Alomair, Radha Poovendran:
Optimized flow allocation for anonymous communication in multipath wireless networks. 219-223 - Dinesh Ramasamy, Upamanyu Madhow:
Can geographic routing scale when nodes are mobile? 224-228 - Vasuki Narasimha Swamy, Rajesh Sundaresan, Pramod Viswanath:
An asymptotically optimal push-pull method for multicasting over a random network. 229-233
Wiretap Channels with Feedback, Side Information, and Common Messaes
- Yingbin Liang, Lifeng Lai, H. Vincent Poor, Shlomo Shamai (Shitz):
Broadcasting over fading wiretap channels. 234-238 - Zouheir Rezki, Ashish Khisti, Mohamed-Slim Alouini:
On the ergodic secret message capacity of the wiretap channel with finite-rate feedback. 239-243 - Bin Dai, A. J. Han Vinck, Yuan Luo, Zhuojun Zhuang:
Capacity region of non-degraded wiretap channel with noiseless feedback. 244-248 - Moritz Wiese, Holger Boche:
An achievable region for the Wiretap multiple-access channel with common message. 249-253
Reed-Muller Codes
- Matthieu Legeay, Pierre Loidreau:
Projected subcodes of the second order binary Reed-Muller code. 254-258 - Ilya Dumer, Olga Kapralova:
Spherically punctured biorthogonal codes. 259-263 - Iwan M. Duursma, Jiashun Shen:
Multiplicative secret sharing schemes from Reed-Muller type codes. 264-268 - José Joaquín Bernal, Juan Jacobo Simón:
Partial permutation decoding for abelian codes. 269-273
Constrained Coding
- Hiroshi Fujisaki:
On embedding conditions of shifts of finite type into the Fibonacci-Dyck shift. 274-278 - Farzad Parvaresh, Pascal O. Vontobel:
Approximately counting the number of constrained arrays via the sum-product algorithm. 279-283 - Luis Alfonso Lastras-Montaño, Mario Blaum:
On codes for structured bursts. 284-288 - Derek Leong, Tracey Ho:
Erasure coding for real-time streaming. 289-293
Capacity of Gaussian Channels
- Jihad Fahs, Ibrahim C. Abou-Faycal:
On the capacity of additive white alpha-stable noise channels. 294-298 - Hui-Ting Chang, Stefan M. Moser:
Bounds on the capacity of the additive inverse Gaussian noise channel. 299-303 - Hui Li, Dongning Guo:
Achievable rates of Gaussian channels with realistic duty cycle and power constraints. 304-308 - Georg Böcherer, Fabian Altenbach, Alex Alvarado, Steven Corroy, Rudolf Mathar:
An efficient algorithm to calculate BICM capacity. 309-313
Distributed Detection and Estimation
- Yan Wang, Yajun Mei:
Quantization effect on second moment of log-likelihood ratio and its application to decentralized sequential detection. 314-318 - Ge Xu, Biao Chen:
The sufficiency principle for decentralized data reduction. 319-323 - Jiayao Hu, Yingbin Liang, Eric P. Xing:
Nonparametric decentralized detection based on weighted count kernel. 324-328 - Lalitha Sankar, H. Vincent Poor:
Distributed estimation in multi-agent networks. 329-333
Quantum Codes from Classical Codes
- Mark M. Wilde, Joseph M. Renes:
Quantum polar codes for arbitrary channels. 334-338 - Lingfei Jin, Chaoping Xing:
A construction of quantum codes via a class of classical polynomial codes. 339-342 - Iryna Andriyanova, Denise Maurice, Jean-Pierre Tillich:
Quantum LDPC codes obtained by non-binary constructions. 343-347 - Alexandr Kovalev, Leonid P. Pryadko:
Improved quantum hypergraph-product LDPC codes. 348-352
Lossy Source Coding
- Yonatan Kaspi, Neri Merhav:
On real-time and causal secure source coding. 353-357 - David L. Neuhoff, S. Sandeep Pradhan:
Rate-distortion behavior at low distortion for densely sampled Gaussian data. 358-362 - Barlas Oguz, Venkat Anantharam:
Pointwise lossy source coding theorem for sources with memory. 363-367 - Ramji Venkataramanan, Antony Joseph, Sekhar Tatikonda:
Gaussian rate-distortion via sparse linear regression over compact dictionaries. 368-372 - Vahid Aref, Nicolas Macris, Rüdiger L. Urbanke, Marc Vuffray:
Lossy source coding via spatially coupled LDGM ensembles. 373-377
Three-Receiver Broadcast Channels
- Chandra Nair, Lingxiao Xia:
On three-receiver more capable channels. 378-382 - Hon Fah Chong, Ying-Chang Liang:
The capacity region of some classes of parallel degraded broadcast channels with three receivers and three-degraded message sets. 383-387 - Tobias J. Oechtering, Michèle A. Wigger, Roy Timo:
Broadcast capacity regions with three receivers and message cognition. 388-392 - Saeed Hajizadeh, Ghosheh Abed Hodtani:
Three-receiver broadcast channels with side information. 393-397 - Shirin Saeedi Bidokhti, Vinod M. Prabhakaran, Suhas N. Diggavi:
Is non-unique decoding necessary? 398-402
*-and-Forward Relaying
- Chen Feng, Danilo Silva, Frank R. Kschischang:
Blind compute-and-forward. 403-407 - Talha A. Khan, Momin Uppal, Anders Høst-Madsen, Zixiang Xiong:
Rateless coded hybrid amplify/decode-forward cooperation for wireless multicast. 408-412 - Ayfer Özgür, Suhas N. Diggavi:
Dynamic QMF for half-duplex relay networks. 413-417 - Ramy H. Gohary, Halim Yanikomeroglu:
Joint optimization of the transmit covariance and the relay precoder in general Gaussian amplify-and-forward relay channels. 418-422 - Hieu T. Do, Tobias J. Oechtering, Mikael Skoglund:
Layered quantize-forward for the two-way relay channel. 423-427
Secure Communications
- László Czap, Vinod M. Prabhakaran, Suhas N. Diggavi, Christina Fragouli:
Broadcasting private messages securely. 428-432 - Ashish Khisti, Tie Liu:
On private broadcasting over independent parallel channels. 433-437 - Bin Dai, Jiehua Hong, A. J. Han Vinck, Yuan Luo, Zhuojun Zhuang:
Degraded broadcast channel with noncausal side information, confidential messages and noiseless feedback. 438-442 - Sergey Loyka, Charalambos D. Charalambous:
On optimal signaling over secure MIMO channels. 443-447 - Boulat A. Bash, Dennis Goeckel, Don Towsley:
Square root law for communication with low probability of detection on AWGN channels. 448-452
Spatially-Coupled Coding
- Shrinivas Kudekar, Tom Richardson, Rüdiger L. Urbanke:
Spatially coupled ensembles universally achieve capacity under belief propagation. 453-457 - Andrei Giurgiu, Nicolas Macris, Rüdiger L. Urbanke:
How to prove the Maxwell conjecture via spatial coupling - A proof of concept. 458-462 - Kenta Kasai, Takayuki Nozaki, Kohichi Sakaniwa:
Spatially-coupled binary MacKay-Neal codes for channels with non-binary inputs and affine subspace outputs. 463-467 - Dmitri V. Truhachev, David G. M. Mitchell, Michael Lentmaier, Daniel J. Costello Jr.:
Improving spatially coupled LDPC codes by connecting chains. 468-472 - Hua Zhou, David G. M. Mitchell, Norbert Goertz, Daniel J. Costello Jr.:
Distance spectrum estimation of LDPC convolutional codes. 473-477
Codes and Their Applications
- Gianluigi Liva, Enrico Paolini, Michael Lentmaier, Marco Chiani:
Spatially-coupled random access on graphs. 478-482 - Michael Mitzenmacher, George Varghese:
Biff (Bloom filter) codes: Fast error correction for large data sets. 483-487 - Mahyar Shirvanimoghaddam, Yonghui Li, Branka Vucetic:
Distributed rateless coding with cooperative sources. 488-492 - Stefan Nowak, Ruediger Kays:
On matching short LDPC codes with spectrally-efficient modulation. 493-497 - Guang Yang, Eirik Rosnes, Angela I. Barbero, Øyvind Ytrehus:
On the power transfer of error-control codes for RFID communications. 498-502
Deletion Channels
- Yuvalal Liron, Michael Langberg:
A characterization of the number of subsequences obtained via the deletion channel. 503-507 - Masato Inoue, Haruhiko Kaneko:
Adaptive synchronization marker for insertion/deletion/substitution error correction. 508-512 - Daniel Cullina, Ankur A. Kulkarni, Negar Kiyavash:
A coloring approach to constructing deletion correcting codes from constant weight subgraphs. 513-517
Directed Information, Common Information, and Divergence
- Charalambos D. Charalambous, Photios A. Stavrou:
Directed information on abstract spaces: Properties and extremum problems. 518-522 - Jiantao Jiao, Haim H. Permuter, Lei Zhao, Young-Han Kim, Tsachy Weissman:
Universal estimation of directed information via sequential probability assignments. 523-527 - Kumar Viswanatha, Emrah Akyol, Kenneth Rose:
Lossy common information of two dependent random variables. 528-532 - Peter Harremoës, Gábor E. Tusnády:
Information divergence is more χ2-distributed than the χ2-statistics. 533-537 - Amir Ahmadi-Javid:
Application of information-type divergences to constructing multiple-priors and variational preferences. 538-540
Communication Problems in Quantum Optics
- Sam Dolinar, Baris I. Erkmen, Bruce E. Moision, Kevin M. Birnbaum, Dariush Divsalar:
The ultimate limits of optical communication efficiency with photon-counting receivers. 541-545 - Saikat Guha, Mark M. Wilde:
Polar coding to achieve the Holevo capacity of a pure-loss optical channel. 546-550 - Mark M. Wilde, Saikat Guha, Si-Hui Tan, Seth Lloyd:
Explicit capacity-achieving receivers for optical communication and quantum reading. 551-555 - Ranjith Nair, Brent J. Yen, Saikat Guha, Jeffrey H. Shapiro, Stefano Pirandola:
Quantum M-ary phase shift keying. 556-560
TheSlepian-Wolf and CEO Problems
- Ahmad Beirami, Faramarz Fekri:
On lossless universal compression of distributed identical sources. 561-565 - Erdal Arikan:
Polar coding for the Slepian-Wolf problem based on monotone chain rules. 566-570 - Jia Wang, Jun Chen:
On the vector Gaussian L-terminal CEO problem. 571-575 - Ersen Ekrem, Sennur Ulukus:
An outer bound for the vector Gaussian CEO problem. 576-580
Capacity of Broadcast Channels
- Amin Aminzadeh Gohari, Chandra Nair, Venkat Anantharam:
On Marton's inner bound for broadcast channels. 581-585 - Yanlin Geng, Chandra Nair:
The capacity region of the two-receiver vector Gaussian broadcast channel with private and common messages. 586-590 - Amos Lapidoth, Ligong Wang:
The state-dependent semideterministic broadcast channel. 591-595 - Yossef Steinberg, Tsachy Weissman:
The degraded broadcast channel with action-dependent states. 596-600
Connectivity and Interference
- Olivier Dousse:
Percolation in directed random geometric graphs. 601-605