


default search action
ISIT 2009: Seoul, Korea
- IEEE International Symposium on Information Theory, ISIT 2009, June 28 - July 3, 2009, Seoul, Korea, Proceedings. IEEE 2009, ISBN 978-1-4244-4312-3
Finite Precision Compressive Sensing
- Ehsan Ardestanizadeh, Mahdi Cheraghchi
, Amin Shokrollahi:
Bit precision analysis for compressed sensing. 1-5 - John Z. Sun, Vivek K. Goyal
:
Optimal quantization of random measurements in compressed sensing. 6-10 - Wei Dai, Hoa Vinh Pham, Olgica Milenkovic:
A comparative study of quantized compressive sensing schemes. 11-15 - Paul Tune, Sibi Raj Bhaskaran, Stephen V. Hanly
:
Number of measurements in sparse signal recovery. 16-20
Relay Channel: Capacity and Bounds I
- Ravi Tandon, Sennur Ulukus:
Outer bounds for user cooperation. 21-25 - Amir Salimi, Mahtab Mirmohseni, Mohammad Reza Aref:
A new capacity upper bound for "Relay-With-Delay" channel. 26-30 - Soheil Mohajer, David N. C. Tse, Suhas N. Diggavi:
Approximate capacity of a class of Gaussian relay-interference networks. 31-35 - Sung Hoon Lim
, Sae-Young Chung, Young-Han Kim:
Deterministic relay networks with state information. 36-40
Multiple Descriptions
- Ertem Tuncel
:
The rate transfer argument in two-stage scenarios: When does it matter? 41-45 - Jun Chen:
Gaussian multiple description coding with individual and central distortion constraints. 46-50 - Paul Cuff, Lei Zhao, Haim H. Permuter
:
Consolidating achievable regions of multiple descriptions. 51-54 - Ebad Ahmed, Aaron B. Wagner:
Binary erasure multiple descriptions: Worst-case distortion. 55-59
Combinatorial Properties of LDPC Codes I
- Kenta Kasai, Charly Poulliat, Kohichi Sakaniwa, Tomoharu Awano, David Declercq:
Weight distributions of multi-edge type LDPC codes. 60-64 - Iryna Andriyanova, Vishwambhar Rathi, Vishwambhar Tillich:
Binary weight distribution of non-binary LDPC codes. 65-69 - Yuichi Kaji:
On the number of minimum weight codewords of SFA-LDPC codes. 70-74 - Igal Sason:
On the fundamental system of cycles in the bipartite graphs of LDPC code ensembles. 75-79
Space-Time Coding I
- G. Susinder Rajan, B. Sundar Rajan:
Low complexity distributed STBCs with unitary relay matrices for any number of relays. 80-84 - Frédérique E. Oggier, Patrick Solé, Jean-Claude Belfiore:
Codes over M2(F2) and applications to Golden space-time coded modulation. 85-88 - Smarajit Das, B. Sundar Rajan:
A novel construction of complex orthogonal designs with maximal rate and low-PAPR. 89-93 - Wei Zhang, Jinhong Yuan
:
Linear receiver based high-rate space-time block codes. 94-98
Network Coding and Capacity I
- Amin Aminzadeh Gohari
, Venkat Anantharam:
A generalized cut-set bound. 99-103 - Sha Yao, Mikael Skoglund:
Analog network coding mappings for the Gaussian multiple-access relay channel. 104-108 - Mahdi Jafari Siavoshani, Lorenzo Keller, Christina Fragouli, Katerina J. Argyraki
:
Compressed network coding vectors. 109-113 - K. R. Dinesh Kumar, Andrew Thangaraj
:
Algebraic network coding: A new perspective. 114-118
Sequences and Correlation I
- Ching-Wei Chen, Yen-Cheng Liu, Yu Ted Su
:
Systematic constructions of zero-correlation zone sequences. 119-123 - Guang Gong, Honggang Hu:
New sequence families with zero or low correlation zone via interleaving techniques. 124-128 - Jin-Ho Chung, Kyeongcheol Yang:
Design of low correlation zone sequence sets of period kN. 129-133 - José R. Ortiz-Ubarri, Oscar Moreno:
Constructions of families with unequal autoand cross-correlation constraints. 134-138
Information Measures
- Flemming Topsøe:
On truth, belief and knowledge. 139-143 - Yaming Yu, Oliver Johnson
:
Concavity of entropy under thinning. 144-148 - Makoto Tsukada, Hiroki Suyari
:
Tsallis differential entropy and divergences derived from the generalized Shannon-Khinchin axioms. 149-153 - Siu-Wai Ho
:
On the interplay between Shannon's information measures and reliability criteria. 154-158
Compressive Sensing and Applications
- Naveen Goela, Michael Gastpar:
Linear compressive networks. 159-163 - Hao Zhu, Georgios B. Giannakis
:
Sparsity-embracing multiuser detection for CDMA systems with low activity factory. 164-168 - Alyson K. Fletcher, Vivek K. Goyal
, Sundeep Rangan:
A sparsity detection framework for on-off random access channels. 169-173 - Rebecca M. Willett
, Maxim Raginsky:
Performance bounds on compressed sensing with Poisson noise. 174-178
Relay Channel: Capacity and Bounds II
- Andrea Goldsmith, Jinhua Jiang, Shuguang Cui
:
Achievable rates and capacity for Gaussian relay channels with correlated noises. 179-183 - Chiranjib Choudhuri, Urbashi Mitra:
Capacity of relay channels with ISI and colored Gaussian noise. 184-188 - Reza Khosravi-Farsani, Mahtab Mirmohseni, Bahareh Akhbari, Hamed Firouzi, Mohammad Reza Aref:
The capacity region of the parallel partially cooperative relay broadcast channel with unmatched degraded subchannels. 189-193 - Seyed Saeed Changiz Rezaei, Shahab Oveis Gharan, Amir K. Khandani:
A new achievable rate for the Gaussian parallel relay channel. 194-198
Lossless Compression
- Michael B. Baer:
Efficient implementation of the generalized Tunstall code generation algorithm. 199-203 - Lav R. Varshney, Julius Kusuma, Vivek K. Goyal
:
Malleable coding with edit-distance cost. 204-208 - T. Aaron Gulliver, Hamed Narimani
, Mohammadali Khosravifard
:
Two recursive versions of the Shannon code. 209-213 - Bruno Tenório Ávila, Eduardo Sany Laber:
Merge source coding. 214-218
Combinatorial Properties of LDPC Codes II
- Igal Sason:
Lower bounds on the graphical complexity of finite-length LDPC codes. 219-223 - Igal Sason:
Linear programming bounds on the degree distributions of LDPC code ensembles. 224-228 - Roxana Smarandache, Pascal O. Vontobel
:
Absdet-pseudo-codewords and perm-pseudo-codewords: Definitions and properties. 229-233 - Masanori Hirotomo, Yoshiho Konishi, Masakatu Morii:
On the probabilistic computation of the stopping redundancy of LDPC codes. 234-238
ARQ
- Torleiv Kløve:
On the existence of proper codes for error detection. 239-243 - Jinhuan Xia, Tiejun Lv, Yonghua Li, John M. Cioffi:
A novel bit-level DS combining scheme for MIMO systems with HARQ. 244-248 - Mari Kobayashi, Mérouane Debbah, Jean-Claude Belfiore:
Outage efficient strategies for network MIMO with partial CSIT. 249-253 - Khoa D. Nguyen
, Lars K. Rasmussen, Albert Guillen i Fabregas
, Nick Letzepis:
MIMO ARQ Systems with multi-Level feedback. 254-258
Network Coding and Capacity II
- Rathinakumar Appuswamy, Massimo Franceschetti, Nikhil Karamchandani, Kenneth Zeger:
Network computing capacity for the reverse butterfly network. 259-262 - Satyajit Thakor
, Alex J. Grant
, Terence Chan
:
Network coding capacity: A functional dependence bound. 263-267 - Rayyan G. Jaber, Jeffrey G. Andrews:
A lower bound on the capacity of wireless erasure networks with random node locations. 268-272 - Mahdi Jafari Siavoshani, Soheil Mohajer, Christina Fragouli, Suhas N. Diggavi:
On the capacity of non-coherent network coding. 273-277
Sequences and Correlation II
- Ji-Woong Jang, Jong-Seon No, Young-Sik Kim, Sang-Hyo Kim:
New quaternary sequences with ideal autocorrelation constructed from binary sequences with ideal autocorrelation. 278-281 - Young-Sik Kim
, Ji-Woong Jang, Sang-Hyo Kim, Jong-Seon No:
New construction of quaternary sequences with ideal autocorrelation from Legendre sequences. 282-285 - Young-Sik Kim, Ji-Woong Jang, Sang-Hyo Kim, Jong-Seon No:
New quaternary sequences with optimal autocorrelation. 286-289 - Anne Canteaut, María Naya-Plasencia
:
Computing the biases of parity-check relations. 290-294
Information Inequalities
- Mokshay M. Madiman, Farhad Ghassemi:
The entropy power of a sum is fractionally superadditive. 295-298 - Ruoheng Liu, Tie Liu, H. Vincent Poor
, Shlomo Shamai
:
A vector generalization of Costa entropy-power inequality and applications. 299-303 - Payam Pakzad, Venkat Anantharam, Amin Shokrollahi:
Bounds on the mutual informations of the binary sums of Bernoulli random variables. 304-308 - Matthew G. Reyes, David L. Neuhoff:
Entropy bounds for a Markov random subfield. 309-313
Matrix Completion and Compressive Sensing
- Yoram Bresler
, Kiryung Lee:
Efficient and guaranteed rank minimization by atomic decomposition. 314-318 - S. T. Aditya, Onkar Dabeer, Bikash Kumar Dey:
A channel coding perspective of recommendation systems. 319-323 - Raghunandan H. Keshavan, Sewoong Oh
, Andrea Montanari:
Matrix completion from a few entries. 324-328 - Halyun Jeong, Young-Han Kim:
Sparse linear representation. 329-333
Bi-Directional Relaying
- Tùng T. Kim, H. Vincent Poor
:
On the DMT of bidirectional relaying with limited feedback. 334-338 - Deniz Gündüz, Aylin Yener, Andrea Goldsmith, H. Vincent Poor
:
The multi-way relay channel. 339-343 - Makesh P. Wilson, Krishna Narayanan:
Power allocation strategies and lattice based coding schemes for bi-directional relaying. 344-348 - Sang Joon Kim, Natasha Devroye, Vahid Tarokh:
A class of bi-directional multi-relay protocols. 349-353
Source Coding
- Neri Merhav:
On the statistical physics of directed polymers in a random medium and their relation to tree codes. 354-358 - Yihong Wu, Sergio Verdú:
Fundamental limits of almost lossless analog compression. 359-363 - Yongwook Choi
, Wojciech Szpankowski:
Compression of graphical structures. 364-368 - Wojciech Szpankowski, Sergio Verdú:
Minimum expected length of fixed-to-variable lossless compression of memoryless sources. 369-373
LDPC Decoding I
- Eran Sharon, Omer Fainzilber, Simon Litsyn:
Decreasing error floor in LDPC codes by parity-check matrix extensions. 374-378 - Shashi Kiran Chilappagari, Bane Vasic, Mikhail G. Stepanov, Michael Chertkov
:
Analysis of error floors of LDPC codes under LP decoding over the BSC. 379-383 - Vitaly Skachek:
On LP decoding of nonbinary expander codes. 384-388 - Tadashi Wadayama:
An LP decoding algorithm based on primal path-following interior point method. 389-393
Feedback in Wireless Communication
- Anand D. Sarwate
, Michael Gastpar:
Some observations on limited feedback for multiaccess channels. 394-397 - Alon Shalev Housfater, Teng Joon Lim
:
Throughput of precoded broadcast transmission with noisy feedback. 398-402 - T. R. Ramya, Srikrishna Bhashyam
:
Eigen-beamforming with delayed feedback and channel prediction. 403-407 - Mingguang Xu, Dongning Guo, Michael L. Honig:
Limited feedback for multi-carrier beamforming: A rate-distortion approach. 408-412
Network Coding and Decoding
- Ning Cai:
Valuable messages and random outputs of channels in linear network coding. 413-417 - Kunihiko Harada, Hirosuke Yamamoto
:
Separate network coding for private and common messages from one source to two sinks. 418-422 - Daniel Salmond, Alex J. Grant
, Terence Chan
, Ian Grivell:
Decoding network codes by message passing. 423-427 - Roberto Wanderley da Nóbrega, Bartolomeu F. Uchôa Filho
:
Multishot codes for network coding: Bounds and a multilevel construction. 428-432
Sequences and Applications
- Ying Li, Yen-Wen Huang:
New QAM Golay complementary pairs with unequal sequence power. 433-437 - Chenggao Han, Takeshi Hashimoto:
Z-connectable complete complementary codes and its application in CDMA systems. 438-442 - Zhenyu Zhang, Fanxin Zeng
, Wei Chen, Zhiyong Shi:
Grouped complementary codes for multicarrier CDMA systems. 443-447 - Hengchao Li, Pingzhi Fan, Dianhua Wu, Udaya Parampalli
:
Optimal variable-weight optical orthogonal codes via cyclic difference families. 448-452
Estimation I
- Dong Sik Kim:
Convergence rate on a nonparametric estimator for the conditional mean. 453-457 - Divyanshu Vats, José M. F. Moura:
Recursive filtering and smoothing for Gaussian reciprocal processes with continuous indices. 458-462 - Taiji Suzuki, Masashi Sugiyama, Toshiyuki Tanaka:
Mutual information approximation via maximum likelihood estimation of density ratio. 463-467 - Shrikanth S. Narayanan, Jorge F. Silva:
Histogram-based estimation for the divergence revisited. 468-472
Sparse Recovery I
- Mihailo Stojnic:
ℓ2/ℓ1-optimization and its strong thresholds in approximately block-sparse compressed sensing. 473-477 - Mihailo Stojnic:
Explicit thresholds for approximately sparse compressed sensing via ℓ1-optimization. 478-482 - M. Amin Khajehnejad, Weiyu Xu, Amir Salman Avestimehr, Babak Hassibi:
Weighted ℓ1 minimization for sparse recovery with prior information. 483-487 - Namrata Vaswani, Wei Lu:
Modified-CS: Modifying compressive sensing for problems with partially known support. 488-492 - Weiyu Xu, Babak Hassibi:
On sharp performance bounds for robust sparse signal recoveries. 493-497
Decode-Forward Relaying
- Manav R. Bhatnagar
, Mérouane Debbah, Are Hjørungnes:
A simple scheme for delay-tolerant decode-and-forward based cooperative communication. 498-502 - David Gregoratti, Xavier Mestre
:
Decode and forward relays: Full diversity with randomized distributed space-time coding. 503-507 - Azad Ravanshid, Lutz Lampe, Johannes B. Huber:
Signal combining for relay transmission with rateless codes. 508-512 - Xianglan Jin, Dong-Sup Jin, Jong-Seon No, Dong-Joon Shin:
On the diversity analysis of decode-and-forward protocol with multiple antennas. 513-516 - Leila Ghabeli
, Mohammad Reza Aref:
Simultaneous partial and backward decoding approach for two-level relay networks. 517-521
Random-Process Compression
- Rajesh T. Krishnamachari, Mahesh K. Varanasi:
Distortion-rate tradeoff of a source uniformly distributed over the Composite PF(N) and the composite stiefel manifolds. 522-526 - Serdar Yüksel:
Stochastic stability of adaptive quantizers for Markov sources. 527-531 - Matthew G. Reyes, David L. Neuhoff:
Arithmetic encoding of Markov random fields. 532-536 - Takahiro Ota, Hiroyoshi Morita:
Length of minimal forbidden words on a stationary ergodic source. 537-540 - Jun Muramatsu
, Shigeki Miyake:
Coding theorem for general stationary memoryless channel based on hash property. 541-545
Analysis of LDPC Codes I
- Maxime Côte, Nicolas Sendrier:
Reconstruction of convolutional codes from noisy observation. 546-550 - Irina E. Bocharova, Boris D. Kudryashov, Roman V. Satyukov, Stephan Stiglmayr:
Short quasi-cyclic LDPC codes from convolutional codes. 551-555 - Virtudes Tomás, Joachim Rosenthal
, Roxana Smarandache:
Decoding of MDP convolutional codes over the erasure channel. 556-560 - Ali Emre Pusane, Daniel J. Costello Jr., David G. M. Mitchell:
Trapping set analysis of protograph-based LDPC convolutional codes. 561-565 - Michael Lentmaier, Marcos B. S. Tavares, Gerhard P. Fettweis:
Exact erasure channel density evolution for protograph-based generalized LDPC codes. 566-570
Wireless Channels
- Huang Huang, Vincent K. N. Lau
:
Delay-optimal distributed power and transmission threshold control for S-ALOHA network with FSMC fading channels. 571-575 - Eduard A. Jorswieck
, Martin Mittelbach:
Average capacity analysis of continuous-time frequency-selective Rayleigh fading channels with correlated scattering using majorization. 576-580 - Jian-Kang Zhang, Chau Yuen:
Full diversity blind signal designs for unique identification of frequency selective channels. 581-585 - Jung Hyun Bae, Achilleas Anastasopoulos:
Capacity-achieving codes for channels with memory with maximum-likelihood decoding. 586-590 - Fei Li, Zhi Zhang:
Online maximizing weighted throughput in a fading channel. 591-595
Cognitive Radio and Capacity
- Nathan Levy, Shlomo Shamai
, Michèle A. Wigger, Amos Lapidoth:
A cognitive network with clustered decoding. 596-600 - Sriram Vishwanath, Amin Jafarian:
On the capacity of multi-user cognitive radio networks. 601-605