default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDISIT 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 - Goochul Chung, Chan-Soo Hwang, Sriram Sridharan, Sriram Vishwanath:
On the capacity of partially cognitive radios. 606-610 - Seyed Hossein Seyedmehdi, Jinhua Jiang, Yan Xin, Xiaodong Wang:
An improved achievable rate region for causal cognitive radio. 611-615 - Andrea Zanella, Ramesh R. Rao, Michele Zorzi:
Capture analysis in wireless radio systems with multi-packet reception capabilities. 616-620
Sequences and Complexity
- Li-Ping Wang:
An algorithm for computing bidirectional minimal polynomials for multisequences. 621-624 - Kenji Hamano, Hirosuke Yamamoto:
A differential equation method to derive the formulas of the T-complexity and the LZ-complexity. 625-629 - Khmaies Ouahada, Hendrik C. Ferreira:
A k-cube graph construction for mappings from Binary vectors to permutations. 630-634 - John C. Kieffer, En-Hui Yang, Wojciech Szpankowski:
Structural complexity of random binary trees. 635-639 - Boris Ryabko, Yulia S. Medvedeva:
Fast enumeration of run-length-limited words. 640-643
Detection
- Vasanthan Raghavan, Venugopal V. Veeravalli:
Bayesian quickest change process detection. 644-648 - Jayakrishnan Unnikrishnan, Venugopal V. Veeravalli, Sean P. Meyn:
Least favorable distributions for robust quickest change detection. 649-653 - Emanuele Grossi, Marco Lops, Vasileios Maroulas:
A sequential procedure for simultaneous detection and state estimation of Markov signals. 654-658 - Augusto Aubry, Marco Lops, Antonia M. Tulino, Luca Venturino:
On MIMO detection under non-Gaussian target scattering: The power-limited case. 659-663 - Hao Chen, Pramod K. Varshney, Biao Chen:
Conditional dependence in distributed detection: How far can we go? 664-668
Sparse Recovery II
- Stark C. Draper, Sheida Malekpour:
Compressed sensing over finite fields. 669-673 - Hoa Vinh Pham, Wei Dai, Olgica Milenkovic:
Sublinear compressive sensing reconstruction via belief propagation decoding. 674-678 - Amin Karbasi, Ali Hormati, Soheil Mohajer, Martin Vetterli:
Support recovery in compressed sensing: An estimation theoretic approach. 679-683 - Ivana Tosic, Pascal Frossard:
Conditions for recovery of sparse signals correlated by local transforms. 684-688
Cooperation I
- Jinhong Yuan, Tao Yang:
Iterative decoding for superposition modulation-based cooperative transmission. 689-693 - Mikael Skoglund, Majid Nasiri Khormuji, Sha Yao, Syed Ali Abbas Zaidi:
Rate-maximizing mappings for memoryless relaying. 694-698 - Milad Sefidgaran, Bahareh Akhbari, Yalda Mohsenzadeh, Mohammad Reza Aref:
Reliable source transmission over relay networks with Side Information. 699-703 - Andrew W. Eckford, Josephine P. K. Chu, Raviraj S. Adve:
Diversity analysis of irregular fractional cooperation. 704-708
Universal Compression
- Henrik Densing Petersen, Flemming Topsøe:
Universal coding for distributions over co-trees. 709-713 - Peter Grünwald, Peter Harremoës:
Finiteness of redundancy, regret, Shtarkov sums, and Jeffreys integrals in exponential families. 714-718 - Toshiyasu Matsushima, Shigeichi Hirasawa:
Reducing the space complexity of a Bayes coding algorithm using an expanded context tree. 719-723 - Zsolt Talata, Tyrone E. Duncan:
Unrestricted BIC context tree estimation for not necessarily finite memory processes. 724-728
Lattice Codes
- Dominik Seethaler, Joakim Jaldén, Christoph Studer, Helmut Bölcskei:
Tail behavior of sphere-decoding complexity in random lattices. 729-733 - Brian M. Kurkoski, Kazuhiko Yamaguchi, Kingo Kobayashi:
Single-Gaussian messages and noise thresholds for decoding low-density lattice codes. 734-738 - Justin Dauwels, Hans-Andrea Loeliger, Brian M. Kurkoski:
Power-constrained communications using LDLC lattices. 739-743 - Yair Yona, Meir Feder:
Efficient parametric decoder of low density lattice codes. 744-748
Channel Estimation
- Alan Barbieri:
Blind per-state detection of DPSK over correlated fading channels. 749-753 - Daniel N. Liu, Michael P. Fitz, Urbashi Mitra:
On channel estimation in fast fading mobile coded MIMO OFDM. 754-758 - Keigo Takeuchi, Ralf R. Müller, Mikko Vehkaperä, Toshiyuki Tanaka:
Practical signaling with vanishing pilot-energy for large noncoherent block-fading MIMO channels. 759-763 - Po-Ning Chen, Chia-Lung Wu, Mikael Skoglund, Yunghsiang Sam Han:
A systematic space-time code design and its maximum-likelihood decoding for combined channel estimation and error correction. 764-768
Network Wireless Communication
- Xiao Juan Zhang, Yi Gong:
Impact of CSIT on the tradeoff of diversity and spatial multiplexing in MIMO channels. 769-773 - Pascal Vallet, Philippe Loubaton:
A G-estimator of the MIMO channel ergodic capacity. 774-778 - Zoran Utkovski, Gilbert Yammine, Jürgen Lindner:
A distributed differential space-time coding scheme for two-way wireless relay networks. 779-783 - Rui Wang, Vincent K. N. Lau, Kaibin Huang:
A new scaling law on throughput and delay performance of wireless mobile relay networks over parallel fading channels. 784-788
Quantum Codes
- Arijit Chowdhury, B. Sundar Rajan:
Quantum error correction via codes over GF(2). 789-793 - Mitsuru Hamada:
A polynomial-time construction of self-orthogonal codes and applications to quantum error correction. 794-798 - Jean-Pierre Tillich, Gilles Zémor:
Quantum LDPC codes with positive rate and minimum distance proportional to n½. 799-803 - Pradeep Kiran Sarvepalli, Andreas Klappenecker, Martin Rötteler:
New decoding algorithms for a class of subsystem codes and generalized shor codes. 804-808
Estimation II
- Sergio Verdú:
Mismatched estimation and relative entropy. 809-813 - Dongning Guo:
Relative entropy and score function: New information-estimation relationships through arbitrary additive perturbation. 814-818 - Young-Han Kim, Haim H. Permuter, Tsachy Weissman:
Directed information and causal estimation in continuous time. 819-823 - Erik Ordentlich, Krishnamurthy Viswanathan, Marcelo J. Weinberger:
On concentration for denoiser-loss estimators. 824-828
Network Operations
- Danny Dolev, Argyris Zymnis, Stephen P. Boyd, Danny Bickson, Yoav Tock:
Distributed large scale network utility maximization. 829-833 - Yunnan Wu, Y. Charlie Hu, Jin Li, Philip A. Chou:
The delay region for P2P file transfer. 834-838 - Philippe Jacquet, Bernard Mans, Georgios Rodolakis:
Broadcast delay of epidemic routing in intermittently connected networks. 839-843 - Eleni Drinea, Christina Fragouli, Lorenzo Keller:
Delay with network coding and feedback. 844-848
Cooperation II
- Majid Nasiri Khormuji, Mikael Skoglund:
On cooperative downlink transmission with frequency reuse. 849-853 - Jing Wang, Jie Liang, Sami Muhaidat:
Distortion exponents for decode-and-forward multi-relay cooperative networks. 854-858 - Vinod M. Prabhakaran, P. R. Kumar:
Communication by sleeping: Optimizing a relay channel under wake and transmit power costs. 859-863 - Are Hjørungnes, Ninoslav Marina:
Power allocation game in a four node relay network: A lower bound on the price of anarchy. 864-868
Slepian-Wolf
- Zhibin Sun, Chao Tian, Jun Chen, Kon Max Wong:
Asynchronous Slepian-Wolf code design. 869-873 - Benjamin G. Kelly, Aaron B. Wagner:
Improved Slepian-Wolf exponents via Witsenhausen's rate. 874-878 - Mohammad Hossein Yassaee, Mohammad Reza Aref:
Slepian-Wolf coding over cooperative networks. 879-883 - Yang Yang, Zixiang Xiong:
Distributed source coding without Slepian-Wolf compression. 884-888
Turbo Codes
- John B. Anderson, Adnan Prlja, Fredrik Rusek:
New reduced state space BCJR algorithms for the ISI channel. 889-893 - Kai Xie, Peiyu Tan, Boon Chong Ng, Jing Li:
Analog turbo codes: A chaotic construction. 894-898 - Joakim Grahl Knudsen, Constanza Riera, Lars Eirik Danielsen, Matthew Geoffrey Parker, Eirik Rosnes:
Iterative decoding on multiple tanner graphs using random edge local complementation. 899-903 - Arun Ayyar, Michael Lentmaier, Giridhar Krishnamurthy, Gerhard P. Fettweis:
Robust initial LLRs for iterative decoders in presence of non-Gaussian noise. 904-908
Space-Time Coding II
- Zhefeng Li, Xiang-Gen Xia:
Time domain interference cancellation for Alamouti coded cooperative OFDM systems with insufficient CP. 909-913 - Roope Vehkalahti:
Some properties of Alamouti-like MISO codes. 914-918 - Kyoung-Young Song, Jae-Dong Yang, Xianglan Jin, Jong-Seon No, Habong Chung:
Quadrature partial response signaling based on Alamouti Code. 919-922 - Anzhong Wong, Jian-Kang Zhang:
Novel rotated quasi-orthogonal space-time block codes with the fixed nearest neighbor number. 923-927
Applications of LDPC Codes
- Myung-Kyu Lee, Kyeongcheol Yang:
Adaptive turbo equalizer with stopping rule based on LDPC codes. 928-932 - Jing Lei, Wen Gao, Predrag Spasojevic, Roy D. Yates:
Demultiplexer design for multi-edge type LDPC coded modulation. 933-937 - Mahdi Ramezani, Masoud Ardakani:
Disjoint LDPC coding for Gaussian broadcast channels. 938-942 - Hung Quoc Ngo, Sungyoung Lee, Young-Koo Lee:
Factor graph approach to distributed facility location in large-scale networks. 943-947
Quantum Codes and Systems
- Frédéric Dupuis:
The capacity of quantum channels with side information at the transmitter. 948-952 - Markus Grassl, Peter W. Shor, Bei Zeng:
Generalized concatenation for quantum codes. 953-957 - A. Robert Calderbank, Gerald Gilbert, Yaakov S. Weinstein, Vaneet Aggarwal:
Engineering fault tolerance for realistic quantum systems via the full error dynamics of quantum codes. 958-962 - Saikat Guha:
Receiver design to harness quantum illumination advantage. 963-967
Hypothesis Testing
- Aaron B. Wagner, Md Saifur Rahman:
Vector Gaussian hypothesis testing and lossy one-helper problem. 968-972 - Ali Ghobadzadeh, Sayed Jalal Zahabi, AliAkbar Tadaion:
The role of MVU estimator and CRB in binary composite hypothesis test. 973-976 - Mohammad Reza Taban, Ali Ghobadzadeh, AliAkbar Tadaion:
Transformation effects on invariant property of invariant hypothesis test and UMPI detector. 977-980 - Evgueni A. Haroutunian, Naira Grigoryan:
On arbitrarily varying Markov source coding and hypothesis LAO testing by non-informed statistician. 981-985
Errors and Erasures
- Aditya Ramamoorthy, Shizheng Li:
Protection against link errors and failures using network coding in overlay networks. 986-990 - Graham Booker, Alex Sprintson:
Design of efficient robust network codes for multicast connections. 991-995 - Svitlana Vyetrenko, Tracey Ho, Elona Erez:
On noncoherent correction of network errors and erasures with random locations. 996-1000 - Svitlana Vyetrenko, Tracey Ho, Michelle Effros, Jörg Kliewer, Elona Erez:
Rate rRegions for coherent and noncoherent multisource network error correction. 1001-1005
Scheduling in Relay Networks
- Lawrence Ong, Sarah J. Johnson, Mehul Motani:
Optimal schedules for the D-node half duplex phase fading MRC. 1006-1010 - Zhiguo Ding, Dennis Goeckel, Kin K. Leung, Don Towsley:
Application of joint source-relay scheduling to cooperative multiple access channels. 1011-1015 - Dong-Joon Shin, Kyoung-Young Song, Jong-Seon No:
Soft-decision-and-forward protocol for cooperative communication networks based on Alamouti code. 1016-1019 - Radha Krishna Ganti, Martin Haenggi:
Analysis of uncoordinated opportunistic two-hop wireless ad hoc systems. 1020-1024
Coding with Side Information
- Avraham Reani, Neri Merhav:
Efficient on-line schemes for encoding individual sequences with side information at the decoder. 1025-1029 - Tsachy Weissman, Haim H. Permuter:
Source coding with a side information 'vending machine' at the decoder. 1030-1034 - Suhas N. Diggavi, Etienne Perron, Emre Telatar:
Lossy source coding with Gaussian or erased side-information. 1035-1039 - Roy Timo, Badri N. Vellambi:
Two lossy source coding problems with causal side-information. 1040-1044
Constrained Coding I
- Erez Louidor, Brian H. Marcus:
Improved lower bounds on capacities of symmetric 2-dimensional constraints ising Rayleigh quotients. 1045-1049 - Erik Ordentlich, Ron M. Roth:
Approximate enumerative coding for 2-D constraints through ratios of maprix Products. 1050-1054 - Søren Forchhammer:
Extending models for two-dimensional constraints. 1055-1059 - Ron M. Roth, Ido Tal:
Concave programming upper bounds on the capacity of 2-D constraints. 1060-1064
Coded Modulation
- Jian-Jia Weng, Chung-Hsuan Wang:
Protection matching: A new scheduling rule for improved design of BICM-ID systems. 1065-1069 - Clemens Novak, Peter Fertl, Gerald Matz:
Quantization for soft-output demodulators in bit-interleaved coded modulation systems. 1070-1074 - Alfonso Martinez, Albert Guillen i Fabregas:
Error probability of BICM in fading channels: Uniform interleaving analysis. 1075-1079 - Josef A. Nossek, Amine Mezghani:
Analysis of 1-bit output noncoherent fading channels in the low SNR regime. 1080-1084 - Miquel Payaró, Daniel P. Palomar:
On optimal precoding in linear vector Gaussian channels with arbitrary input distribution. 1085-1089 - Vaneet Aggarwal, Youjian Liu, Ashutosh Sabharwal:
Message passing in distributed wireless networks. 1090-1094 - Cédric Artigue, Philippe Loubaton:
On the ergodic capacity and precoder design of flat fading MIMO systems equipped with MMSE receivers. 1095-1099 - Giuseppe Caire, Sandro Bellini, Alessandro Tomasoni, Marco Ferrari:
On the selection of semi-orthogonal users for zero-forcing beamforming. 1100-1104
Cryptographic Algorithms
- Michael Huber:
Authentication and secrecy codes for equiprobable source probability distributions. 1105-1109 - Haitham Rashwan, Bahram Honary, Ernst M. Gabidulin:
On improving security of GPT cryptosystems. 1110-1114 - Martin Hell, Lennart Brynielsson:
Another look at weak feedback polynomials in the nonlinear combiner. 1115-1119 - Cédric Lauradoux:
Extended windmill polynomials. 1120-1124
Maximum Likelihood
- Farzad Farnoud, Olgica Milenkovic, Narayana P. Santhanam:
Small-sample distribution estimation over sticky channels. 1125-1129 - Alon Orlitsky, Shengjun Pan:
The maximum likelihood probability of skewed patterns. 1130-1134 - Shengjun Pan, Jayadev Acharya, Alon Orlitsky:
The maximum likelihood probability of unique-singleton, ternary, and length-7 patterns. 1135-1139 - Vincent Y. F. Tan, Animashree Anandkumar, Lang Tong, Alan S. Willsky:
A large-deviation analysis for the maximum likelihood learning of tree structures. 1140-1144
Network Coding and Security
- Oliver Kosut, Lang Tong:
The quadratic Gaussian CEO problem with byzantine agents. 1145-1149 - Yunnan Wu:
Existence and construction of capacity-achieving network codes for distributed storage. 1150-1154 - Zhixue Zhang, Raymond W. Yeung:
A general security condition for multi-source linear network coding. 1155-1158 - Minji Kim, Ralf Koetter, Muriel Médard, João Barros:
An algebraic watchdog for wireless network coding. 1159-1163 - Luísa Lima, João Barros, Ralf Koetter:
Byzantine attacks against network coding in peer to peer distributed storage. 1164-1168
Impact of Channel State Information
- Bahareh Akhbari, Mahtab Mirmohseni, Mohammad Reza Aref:
Compress-and-forward strategy for the relay channel with non-causal State Information. 1169-1173 - Reza Khosravi-Farsani, Bahareh Akhbari, Mahtab Mirmohseni, Mohammad Reza Aref:
Cooperative relay-broadcast channels with causal Channel State Information. 1174-1178 - Arash Behboodi, Pablo Piantanida:
On the simultaneous relay channel with informed receivers. 1179-1183 - Jiening Zhan, Michael Gastpar:
Functional forwarding of channel state information. 1184-1188 - Yingbin Liang, H. Vincent Poor, Lei Ying:
Secrecy throughput of MANETs with malicious nodes. 1189-1193
Distributed Source Coding
- Shraga I. Bross, Tsachy Weissman:
An outer bound for side-information scalable source coding with partially cooperating decoders. 1194-1198 - Paul Cuff, Han-I Su, Abbas El Gamal:
Cascade multiterminal source coding. 1199-1203 - Xuechen Chen, Ertem Tuncel:
High-resolution predictive Wyner-Ziv coding of Gaussian sources. 1204-1208 - Lei Zhao, Haim H. Permuter:
The Gray-Wyner network with a limited-rate helper to the encoder and decoders. 1209-1213 - Tetsunao Matsuta, Tomohiko Uyematsu, Ryutaroh Matsumoto:
Closed forms of the achievable rate region for Wyner's source coding systems. 1214-1218
Coding for Storage
- Anxiao Jiang, Michael Langberg, Moshe Schwartz, Jehoshua Bruck:
Universal rewriting in constrained memories. 1219-1223 - Luis Alfonso Lastras-Montaño, Michele Franceschini, Thomas Mittelholzer, John P. Karidis, Mark N. Wegman:
On the lifetime of multilevel memories. 1224-1228 - Jehoshua Bruck, Alexander Vardy, Anxiao Andrew Jiang, Eitan Yaakobi, Jack K. Wolf, Robert Mateescu, Paul H. Siegel:
Storage coding for wear leveling in flash memories. 1229-1233 - Jehoshua Bruck, Anxiao Jiang, Zhiying Wang:
On the capacity of bounded rank modulation for flash memories. 1234-1238 - Hessam Mahdavifar, Paul H. Siegel, Alexander Vardy, Jack K. Wolf, Eitan Yaakobi:
A nearly optimal construction of flash codes. 1239-1243
List Decoding
- Vladimir M. Blinovsky, Simon Litsyn:
New asymptotic bounds on the size of list codes on Euclidean sphere. 1244-1247 - Hirakendu Das, Alexander Vardy:
Multiplicity assignments for algebraic soft-decoding of Reed-Solomon codes using the method of types. 1248-1252 - Ofer Shayevitz:
On error correction with feedback under list decoding. 1253-1257 - Utsaw Kumar, J. Nicholas Laneman, Vijay Gupta:
Noisy feedback schemes and rate-error tradeoffs from stochastic approximation. 1258-1262 - Joakim Jaldén, Petros Elia:
LR-aided MMSE lattice decoding is DMT optimal for all approximately universal codes. 1263-1267
Precoding II
- Fredrik Rusek, Dzevdan Kapetanovic:
Design of close to optimal Euclidean distance MIMO-precoders. 1268-1272 - Richard D. Wesel, Bike Xie:
Optimal natural encoding scheme for discrete multiplicative degraded broadcast channels. 1273-1277 - Juha Karjalainen, Tadashi Matsumoto, Antti Tölli, Markku J. Juntti:
On convergence constrained precoder design for iterative frequency domain MIMO detector. 1278-1282 - Mari Kobayashi, Yingbin Liang, Shlomo Shamai, Mérouane Debbah:
On the compound MIMO broadcast channels with confidential messages. 1283-1287 - Sirin Nitinawarat, Alexander Barg, Prakash Narayan, Chunxuan Ye, Alex Reznik:
Perfect secrecy, perfect omniscience and steiner tree packing. 1288-1292
Cryptographic Protocols
- Motohiko Isaka:
Efficient oblivious transfer from algebraic signaling over the Gaussian channel. 1293-1297 - Shun Watanabe, Tsuki Saitou, Ryutaroh Matsumoto, Tomohiko Uyematsu:
Strongly secure privacy amplification cannot be obtained by encoder of Slepian-Wolf code. 1298-1302 - Ye Wang, Prakash Ishwar:
Bootstrapped oblivious transfer and secure two-party function computation. 1303-1307 - Mitsugu Iwamoto, Hirosuke Yamamoto, Hiroki Koga:
A coding theorem for cheating-detectable (2, 2)-threshold blockwise secret sharing schemes. 1308-1312 - Hongsong Shi, Shaoquan Jiang, Reihaneh Safavi-Naini, Mohammed Ashraful Tuhin:
Optimal secure message transmission by public discussion. 1313-1317 - Po-Hsiang Lai, Joseph A. O'Sullivan, Robert Pless:
Minimum description length and clustering with exemplars. 1318-1322 - Ravi C. Venkatesan, Angelo Plastino:
Deformed statistics formulation of the information bottleneck method. 1323-1327 - Maxim Raginsky:
Achievability results for statistical learning under communication constraints. 1328-1332 - Yanbing Zhang, Huaiyu Dai:
Structured variational methods for distributed inference: Convergence analysis and performance-complexity tradeoff. 1333-1337 - Maxim Raginsky, Roummel F. Marcia, Jorge G. Silva, Rebecca M. Willett:
Sequential probability assignment via online convex programming using exponential families. 1338-1342
Lossless Distributed Source Coding
- Asaf Cohen, Amir Salman Avestimehr, Michelle Effros:
On networks with side information. 1343-1347 - Mayank Bakshi, Michelle Effros:
On feedback in network source coding. 1348-1352 - Brijesh Kumar Rai, Bikash Kumar Dey:
Feasible alphabets for communicating the sum of sources over a network. 1353-1357
Sequential Methods
- Florian Hug, Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov:
Searching for high-rate convolutional codes via binary syndrome trellises. 1358-1362 - Marco Secondini, Dario Fertonani, Giulio Colavolpe, Enrico Forestieri:
Performance evaluation of Viterbi decoders by multicanonical Monte Carlo simulations. 1363-1367 - Wing Shing Wong, Kenneth W. Shum, Chung Shue Chen, Chi Wan Sung:
Design and construction of protocol sequences: Shift invariance and user irrepressibility. 1368-1372
Frequency Domain Communication
- Anders Høst-Madsen, Momin Uppal, Zixiang Xiong:
Cooperation in the MAC channel using frequency division multiplexing. 1373-1377 - Abdel-Nasser Assimi, Charly Poulliat, Inbar Fijalkow:
On cyclic frequency diversity for single-carrier packet retransmissions. 1378-1382 - Kamyar Moshksar, Amir K. Khandani:
A new approach to improve multiplexing gain in decentralized networks via frequency hopping and repetition coding. 1383-1387
Algebraic Methods I
- Camilla Hollanti, Roope Vehkalahti, Hsiao-feng Lu:
An algebraic tool for obtaining conditional non-vanishing determinants. 1388-1392 - Vladimir Sidorenko, Anas Chaaban, Christian Senger, Martin Bossert:
On Extended Forney-Kovalev GMD decoding. 1393-1397 - Dilip V. Sarwate, Zhiyuan Yan:
Modified Euclidean algorithms for decoding Reed-Solomon codes. 1398-1402
Queuing and Delays
- Liangzhong Ruan, Vincent K. N. Lau:
Delay-optimal power control and performance analysis in SDMA system with limited buffer size via stochastic decomposition. 1403-1407 - Theodoros K. Dikaliotis, Alexandros G. Dimakis, Tracey Ho, Michelle Effros:
On the delay of network coding over line networks. 1408-1412 - Mohammad Ravanbakhsh, Angela I. Barbero, Øyvind Ytrehus:
Improved delay estimates for a queueing model for random linear coding for unicast. 1413-1417 - Chan Zhou, Gerhard Wunder:
A fundamental characterization of stability in broadcast queueing systems. 1418-1422 - Muriel Médard, Daniel Enrique Lucani, Milica Stojanovic:
Random linear network coding for time-division duplexing: Queueing analysis. 1423-1427
Cooperative Diversity-Multiplexing Tradeoff
- Olivier Lévêque, Christophe Vignat, Melda Yüksel:
Diversity-multiplexing tradeoff for the MIMO static half-duplex relay. 1428-1432 - Kiran Thimme Gowda, Tony Q. S. Quek, Hyundong Shin:
Secure diversity-multiplexing tradeoffs in MIMO relay channels. 1433-1437 - Vinayak Nagpal, Sameer Pawar, David Tse, Borivoje Nikolic:
Cooperative multiplexing in the multiple antenna half duplex relay channel. 1438-1442 - Sanjay Karmakar, Mahesh K. Varanasi:
Diversity-multiplexing tradeoff of the dynamic decode and forward protocol on a MIMO half-duplex relay channel. 1443-1447 - Yahya Mohasseb, Hassan Ghozlan, Gerhard Kramer, Hesham El Gamal:
The MIMO Wireless Switch: Relaying can increase the multiplexing gain. 1448-1452
Lossy Distributed Source Coding
- Han-I Su, Abbas El Gamal:
Distributed lossy averaging. 1453-1457 - Yifu Zhang, Zixiang Xiong, Yang Yang:
Code design for quadratic Gaussian multiterminal source coding: The symmetric case. 1458-1462 - Jia Wang, Jun Chen, Xiaolin Wu:
On the minimum sum rate of Gaussian multiterminal source coding: New proofs. 1463-1467 - Mohammad Ali Maddah-Ali, David N. C. Tse:
Approximating the rate-distortion region of the distributed source coding for three jointly Gaussian tree-structured sources. 1468-1472 - Tsachy Weissman, Yossef Steinberg, Haim H. Permuter:
Two-way source coding with a common helper. 1473-1477 - Satish Babu Korada, Eren Sasoglu:
A class of transformations that polarize binary-input memoryless channels. 1478-1482 - Satish Babu Korada, Eren Sasoglu, Rüdiger L. Urbanke:
Polar codes: Characterization of exponent, bounds, and constructions. 1483-1487 - Nadine Hussami, Rüdiger L. Urbanke, Satish Babu Korada:
Performance of polar codes for channel and source coding. 1488-1492 - Erdal Arikan, Emre Telatar:
On the rate of channel polarization. 1493-1495 - Ryuhei Mori, Toshiyuki Tanaka:
Performance and construction of polar codes on symmetric binary-input memoryless channels. 1496-1500
Channels with Feedback
- Hirosuke Yamamoto, Marat V. Burnashev:
Noisy feedback improves the BSC reliability function. 1501-1505 - Yuval Lomnitz, Meir Feder:
Feedback communication over individual channels. 1506-1510 - Yuval Lomnitz, Meir Feder:
Power adaptive feedback communication over an additive individual noise sequence channel. 1511-1514 - Baris Nakiboglu, Lizhong Zheng:
Upper bounds to error probability with feedback. 1515-1519 - Todd P. Coleman:
A stochastic control viewpoint on 'Posterior Matching'-style feedback communication schemes. 1520-1524
Wireless Systems
- Vahid Pourahmadi, Abolfazl S. Motahari, Amir K. Khandani:
Infinite-layer codes for single-user slowly fading MIMO channels. 1525-1529 - Bobak Nazer, Amichai Sanderovich, Michael Gastpar, Shlomo Shamai:
Structured superposition for backhaul constrained cellular uplink. 1530-1534 - Hideki Ochiai, Makoto Tanahashi:
On destructive superposition of shaping pulses in band-limited linear modulation systems. 1535-1539 - Seok-Joong Heo, Hyun-Seung Joo, Jong-Seon No, Dae-Woon Lim, Dong-Joon Shin:
Analysis of PAPR reduction performance of SLM schemes with correlated phase vectors. 1540-1543 - Anil Mengi, A. J. Han Vinck:
Coded modulation with a constraint on the minimum channel symbol duration. 1544-1548
Constrained Coding II
- Thomas Mittelholzer:
Enumerative maximum-transition-run codes. 1549-1553 - Kees A. Schouhamer Immink, Jos H. Weber:
Simple balanced codes that approach capacity. 1554-1558 - Hiroshi Kamabe:
Insertion rate and optimization of redundancy of constrained systems with unconstrained positions. 1559-1563 - Theo G. Swart, Jos H. Weber:
Efficient balancing of q-ary sequences with parallel decoding. 1564-1568 - Navin Kashyap, Akiko Manada:
The zeta function of a periodic-finite-type shift. 1569-1573
Applications
- Lara Dolecek, Devavrat Shah:
Influence in a large society: Interplay between information dynamics and network structure. 1574-1578 - Michael Kohler, Adam Krzyzak, Harro Walk:
On application of nonparametric regression estimation to options pricing. 1579-1583 - Toby Berger, William B. Levy:
Information transfer by energy-efficient neurons. 1584-1588 - Shiro Ikeda, Jonathan H. Manton:
Spiking neuron channel. 1589-1593 - Mehdi Aghagolzadeh, Seif Eldawlatly, Karim G. Oweiss:
Coding stimulus information with cooperative neural populations. 1594-1598
DMT and Feedback in the Interference Channel
- Adnan Raja, Pramod Viswanath:
Diversity-Multiplexing tradeoff of the two-user interference channel. 1599-1603 - Cemal Akçaba, Helmut Bölcskei:
On the achievable diversity-multiplexing tradeoff in interference channels. 1604-1608 - Changho Suh, David Tse:
Symmetric feedback capacity of the Gaussian interference channel to within one bit. 1609-1613 - Hamid Ebrahimzad, Amir K. Khandani:
On Diversity-Multiplexing Tradeoff of the Interference Channel. 1614-1618
Multihop Wireless Networks
- Changxin Shi, Randall A. Berry, Michael L. Honig:
Monotonic convergence of distributed interference pricing in wireless networks. 1619-1623 - Mehdi Ansari Sadrabadi, Alireza Bayesteh, Eytan H. Modiano:
Opportunistic scheduling in large-scale wireless networks. 1624-1628 - Dijiang Huang:
On an information theoretic approach to model anonymous MANET communications. 1629-1633 - Ramanan Subramanian, Faramarz Fekri:
Analysis of multiple-unicast throughput in finite-buffer Delay-Tolerant Networks. 1634-1638
Channel Coding
- Marius Kleiner, Bixio Rimoldi:
On fidelity per unit cost. 1639-1643 - Emmanuel Abbe, Lizhong Zheng:
Coding along Hermite polynomials for Gaussian noise channels. 1644-1648 - Fredrik Rusek, Dario Fertonani:
Lower bounds on the information rate of intersymbol interference channels based on the Ungerboeck observation model. 1649-1653 - Guangyue Han, Brian H. Marcus:
Concavity of mutual information rate for input-restricted finite-state memoryless channels at high SNR. 1654-1658
LDPC Decoding II
- Axel Heim, Ulrich Sorger:
On the convergence of iterative belief propagation. 1659-1663 - Yu-Liang Chen, Chang-Ming Lee, Yu Ted Su, Chi-Yuan Chang:
New group shuffled BP decoding algorithms for LDPC codes. 1664-1668 - Eran Sharon, Noam Presman, Simon Litsyn:
Analysis of LDPC decoding schedules. 1669-1673 - Danny Dolev, Danny Bickson, Jason K. Johnson:
Fixing convergence of Gaussian belief propagation. 1674-1678
Wireless Precoding
- Amin Mobasher, Mohammad Ali Maddah-Ali, Amir K. Khandani:
Selective Mapping for channel inversion precoding in multiple-antenna broadcast systems. 1679-1683 - Chee Yen (Bruce) Leow, Zhiguo Ding, Kin K. Leung:
Linear precoded cooperative transmission protocol for wireless broadcast channels. 1684-1688 - Alon Shalev Housfater, Teng Joon Lim:
Noisy feedback linear precoding: A Bayesian Cramér-Rao bound. 1689-1693 - Hyukjoon Kwon, John M. Cioffi:
MISO broadcast channel with user-cooperation and limited feedback. 1694-1698
Capacity of Multiple Access Channels
- Hon Fah Chong, Mehul Motani:
The capacity region of the symbol-asynchronous Gaussian multiple-access channel with orthogonal signaling. 1699-1703 - S. Sandeep Pradhan, Ali Nazari, Achilleas Anastasopoulos:
New bounds on the maximal error exponent for multiple-access channels. 1704-1708 - Jinho Kim, Wayne E. Stark:
Error exponent of exclusive-or multiple-access channels. 1709-1713 - Sang-Woon Jeon, Sae-Young Chung:
Sum capacity of multi-source linear finite-field relay networks with fading. 1714-1718
Algebraic Error Correcting Codes I
- Shixin Zhu, Yu Wang, Minjia Shi:
Cyclic codes over F2 + vF2. 1719-1722 - Carl Bracken, Tor Helleseth:
Triple-error-correcting BCH-like codes. 1723-1725 - Jinquan Luo, Yuansheng Tang, Hongyu Wang:
On the weight distribution of a class of cyclic codes. 1726-1729 - Shixin Zhu, Xiaoshan Kai, Ping Li:
Negacyclic MDS codes over GR(2a, m). 1730-1733
Stochastic Processes
- Daniil Ryabko:
An impossibility result for process discrimination. 1734-1738 - Gadiel Seroussi, Marcelo J. Weinberger, Wojciech Szpankowski:
Deinterleaving Markov processes via penalized ML. 1739-1743 - Tareq Y. Al-Naffouri, Babak Hassibi:
On the distribution of indefinite quadratic forms in Gaussian random variables. 1744-1748 - Muhammet Fatih Bayramoglu, Ali Özgür Yilmaz:
Factorization of joint probability mass functions into parity check interactions. 1749-1753
Interference Alignment
- Ayfer Özgür, David Tse:
Achieving linear scaling with interference alignment. 1754-1758 - Helmut Bölcskei, Jatin Thukral:
Interference alignment with limited feedback. 1759-1763 - Behzad Nourani, Abolfazl S. Motahari, Amir K. Khandani:
Relay-aided interference alignment for the quasi-static X channel. 1764-1768 - Bobak Nazer, Syed Ali Jafar, Michael Gastpar, Sriram Vishwanath:
Ergodic interference alignment. 1769-1773
Heterogeneous Wireless Networks
- Changchuan Yin, Changhai Chen, Tie Liu, Shuguang Cui:
Generalized results of transmission capacities for overlaid wireless networks. 1774-1778 - Sidharth Jaggi, Ziyu Shao, Shuo-Yen Robert Li:
To code or not to code: Rate optimality in node-capacitated networks. 1779-1783 - Zhenning Kong, Edmund M. Yeh, Emina Soljanin:
Coding improves the throughput-delay trade-off in mobile wireless networks. 1784-1788 - Beiyu Rong, Anthony Ephremides:
Cooperation above the physical layer: The case of a simple network. 1789-1793
Capacity Bounds
- Tsachy Weissman:
Capacity of channels with action-dependent states. 1794-1798 - Amir Ingber, Meir Feder:
Capacity and error exponent analysis of multilevel coding with multistage decoding. 1799-1803 - Ligong Wang, Renato Renner, Roger Colbeck:
Simple channel coding bounds. 1804-1808 - Edwin Hammerich:
On the heat channel and its capacity. 1809-1813
Analysis of LDPC Codes II
- Eirik Rosnes, Alexandre Graell i Amat:
Stopping set analysis of repeat multiple-accumulate codes. 1814-1818 - Christian Koller, Alexandre Graell i Amat, Jörg Kliewer, Daniel J. Costello Jr.:
Trapping set enumerators for repeat multiple accumulate code ensembles. 1819-1823 - Amir H. Djahanshahi, Laurence B. Milstein, Paul H. Siegel:
On unequal error protection of finite-length LDPC codes over BECs: A scaling approach. 1824-1828 - Kazushi Mimura, A. C. C. Coolen:
Generating functional analysis of LDGM channel coding with many short loops. 1829-1833
Wireless Capacities
- Chao Tian:
Latent capacity region: A case study on symmetric broadcast with common messages. 1834-1838 - Chandra Nair:
Capacity regions of two new classes of 2-receiver broadcast channels. 1839-1843 - Chandra Nair, Zizhou Vincent Wang:
On 3-receiver broadcast channels with 2-degraded message sets. 1844-1848 - Yeow-Khiang Chia, Abbas El Gamal:
3-Receiver broadcast channels with common and confidential messages. 1849-1853
Coding for Multiple Access Channels
- Hideki Yagi, H. Vincent Poor:
Coset codes for compound multiple access channels with common information. 1854-1858 - Jagadeesh Harshan, B. Sundar Rajan:
Coding for two-user Gaussian MAC with PSK and PAM signal sets. 1859-1863 - Hsiao-feng Lu, Camilla Hollanti:
Diversity-multiplexing tradeoff-optimal code constructions for symmetric MIMO multiple access channels. 1864-1868 - Tao Cui, Tracey Ho:
On multiple access random medium access control. 1869-1873
Quantum Channels and Systems
- Alfonso Martinez:
Information Rate loss from radiation decoherence. 1874-1878 - David Elkouss, Anthony Leverrier, Romain Alléaume, Joseph Jean Boutros:
Efficient reconciliation protocol for discrete-variable quantum key distribution. 1879-1883 - Tomohiko Uyematsu, Shun Watanabe, Ryutaroh Matsumoto:
Optimal axis compensation in quantum key distribution protocols over unital channels. 1884-1888 - Igor Bjelakovic, Holger Boche, Janis Noetzel:
Entanglement transmission capacity of compound channels. 1889-1893
Statistics
- Jun'ichi Takeuchi:
Fisher information determinant and stochastic complexity for Markov models. 1894-1898 - Oliver Johnson, Ioannis Kontoyiannis, Mokshay M. Madiman:
A criterion for the compound poisson distribution to be maximum entropy. 1899-1903 - Ambedkar Dukkipati:
Embedding maximum entropy models in algebraic varieties by Gröbner bases methods. 1904-1908 - Baris I. Erkmen, Bruce E. Moision:
Maximum likelihood time-of-arrival estimation of optical pulses via photon-counting photodetectors. 1909-1913
Degrees of Freedom for the Interference Channel
- Abolfazl S. Motahari, Amir K. Khandani, Shahab Oveis Gharan:
On the Degrees of Freedom of the 3-user Gaussian interference channel: The symmetric case. 1914-1918 - Raúl H. Etkin, Erik Ordentlich:
On the Degrees-of-Freedom of the K-user Gaussian interference channel. 1919-1923 - Tiangao Gou, Syed Ali Jafar:
Capacity of a class of symmetric SIMO Gaussian interference channels within O(1). 1924-1928 - Chiachi Huang, Viveck R. Cadambe, Syed Ali Jafar:
Interference alignment and the generalized degrees of freedom of the X channel. 1929-1933
Wiretap Channels
- Mahdi Cheraghchi, Frédéric Didier, Amin Shokrollahi:
Invertible extractors and wiretap protocols. 1934-1938 - Willie K. Harrison, Steven W. McLaughlin:
Tandem coding and cryptography on wiretap channels: EXIT chart analysis. 1939-1943 - Vaneet Aggarwal, Lifeng Lai, A. Robert Calderbank, H. Vincent Poor:
Wiretap channel type II with an active eavesdropper. 1944-1948 - Rajesh Sundaresan, Manjesh Kumar Hanawal:
The Shannon cipher system with a guessing wiretapper: General sources. 1949-1953
The Gelfand-Pinsker Channel
- Himanshu Tyagi, Prakash Narayan:
The Gelfand-Pinsker channel: Strong converse and upper bound for the reliability function. 1954-1957 - Pierre Moulin:
Strong converse for Gel'fand-Pinsker channel. 1958-1962 - Ravi Tandon, Sennur Ulukus:
On the rate-limited Gelfand-Pinsker problem. 1963-1967 - Pablo Piantanida, Shlomo Shamai:
Capacity of compound state-dependent channels with states known at the transmitter. 1968-1972
LDPC Code Design
- Junya Honda, Hirosuke Yamamoto:
Variable length lossy coding using an LDPC code. 1973-1977 - Alfredo Braunstein, Riccardo Zecchina, Farbod Kayhan:
Efficient LDPC codes over GF(q) for lossy data compression. 1978-1982 - Enrico Paolini, Mark F. Flanagan, Marco Chiani, Marc P. C. Fossorier:
On a class of doubly-generalized LDPC codes with single parity-check variable nodes. 1983-1987 - Marwan Hadri Azmi, Jinhong Yuan:
Design of multi-edge type bilayer-expurgated LDPC codes. 1988-1992
Space-Time Coding III
- B. Sundar Rajan, Saif K. Mohammed, Ananthanarayanan Chockalingam, Nagaraja Srinidhi:
Low-complexity near-ML decoding of large non-orthogonal STBCs using reactive tabu search. 1993-1997 - Saif K. Mohammed, Ananthanarayanan Chockalingam, B. Sundar Rajan:
Low-complexity near-MAP decoding of large non-orthogonal STBCs using PDA. 1998-2002 - Madhekar Suneel, Pritam Som, Ananthanarayanan Chockalingam, B. Sundar Rajan:
Belief propagation based decoding of large non-orthogonal STBCs. 2003-2007 - K. Pavan Srinath, B. Sundar Rajan:
High-rate, 2-group ML-decodable STBCs for 2m transmit antennas. 2008-2012
Bi-Directional Communications
- Tobias J. Oechtering, Mikael Skoglund:
Coding for the bidirectional broadcast channel with random states known at the encoder. 2013-2017 - Babak Hassibi, Aydin Sezgin, M. Amin Khajehnejad, Amir Salman Avestimehr:
Approximate capacity region of the two-pair bidirectional Gaussian relay network. 2018-2022 - Osvaldo Simeone, Onur Sahin, Elza Erkip:
Interference Channel aided by an Infrastructure Relay. 2023-2027 - Tony Q. S. Quek, Hien Quoc Ngo, Hyundong Shin:
Amplify-and-forward two-way relay channels: Error exponents. 2028-2032
Spherical Codes
- Cristiano Torezzan, Sueli I. R. Costa, Vinay A. Vaishampayan:
Spherical codes on torus layers. 2033-2037 - Ha Q. Nguyen, Vivek K. Goyal, Lav R. Varshney:
On concentric spherical codes and permutation codes with multiple initial codewords. 2038-2042 - Jibo Wei, Xing Lan:
The expected complexity of sphere decoding algorithm in spatial correlated MIMO channels. 2043-2047 - Vladimir M. Blinovsky:
Generalization of Plotkin bound to the case of multiple packing. 2048-2050
Algorithms and Circuits
- Erman Ayday, Hanseung Lee, Faramarz Fekri:
An iterative algorithm for trust and reputation management. 2051-2055 - Hiroshi Fujisaki:
Entropy of the induced transformations associated with the interval algorithm. 2056-2060 - Hongchao Zhou, Jehoshua Bruck:
On the expressibility of stochastic switching circuits. 2061-2065 - Po-Ling Loh, Hongchao Zhou, Jehoshua Bruck:
The robustness of stochastic switching networks. 2066-2070
Interference Cooperation and Secrecy
- Vinod M. Prabhakaran, Pramod Viswanath:
Interference management through cooperation. 2071-2075 - Nilesh Khude, Vinod M. Prabhakaran, Pramod Viswanath:
Opportunistic interference management. 2076-2080 - Yong Peng, Dinesh Rajan:
Capacity bounds of half-duplex gaussian cooperative interference channel. 2081-2085 - Xiang He, Aylin Yener:
The Gaussian many-to-one interference channel with confidential messages. 2086-2090 - Shweta Agrawal, Sriram Vishwanath:
On the secrecy rate of interference networks using structured codes. 2091-2095
Network Resilience
- Xiang He, Aylin Yener:
Secure communication with a Byzantine relay. 2096-2100 - Roel Maes, Pim Tuyls, Ingrid Verbauwhede:
A soft decision helper data algorithm for SRAM PUFs. 2101-2105 - Terence Chan, Ning Cai, Alex J. Grant:
Robust key agreement schemes. 2106-2110 - Urs Niesen, Devavrat Shah, Gregory W. Wornell:
Caching in wireless networks. 2111-2115 - Jin Xu, Biao Chen:
Secure coding over networks. 2116-2120
Source-Channel Coding
- Michael Langberg, Aditya Ramamoorthy:
Communicating the sum of sources in a 3-sources/3-terminals network. 2121-2125 - Ozgun Y. Bursalioglu, Giuseppe Caire, Maria Fresia, H. Vincent Poor:
Joint source-channel coding at the application layer for parallel Gaussian sources. 2126-2130 - Maria Fresia, Fernando Pérez-Cruz, H. Vincent Poor:
Optimized concatenated LDPC codes for joint source-channel coding. 2131-2135 - Neri Merhav:
Joint source-channel coding via statistical mechanics: Thermal equilibrium between the source and the channel. 2136-2140 - En-Hui Yang, Lin Zheng, Zhen Zhang, Da-ke He:
A computation approach to the minimum total rate problem of causal video coding. 2141-2145 - Ingmar Land, Gottfried Lechner, Lars K. Rasmussen:
Adaptive decoding of LDPC codes with binary messages. 2146-2150 - Jonathan S. Yedidia, Stark C. Draper, Yige Wang:
Multi-stage decoding of LDPC codes. 2151-2155 - Shashi Kiran Chilappagari, David Declercq, Lucile Sassatelli, Bane Vasic:
Two-bit message passing decoders for LDPC codes over the binary symmetric channel. 2156-2160 - Eric Psota, Lance C. Pérez:
LDPC decoding and code design on extrinsic trees. 2161-2165 - Guiqiang Dong, Yanan Li, Ningde Xie, Tong Zhang, Huaping Liu:
Candidate bit based bit-flipping decoding algorithm for LDPC codes. 2166-2168
Channel Variations
- Tùng T. Kim, Albert Guillen i Fabregas:
Coded modulation with mismatched power control over block-fading channels. 2169-2173 - Giuseppe Durisi, Veniamin I. Morgenshtern, Helmut Bölcskei:
On the sensitivity of noncoherent capacity to the channel model. 2174-2178 - Michel T. Ivrlac, Josef A. Nossek:
Physical modeling of communication systems in information theory. 2179-2183 - Jubin Jose, Alexei E. Ashikhmin, Thomas L. Marzetta, Sriram Vishwanath:
Pilot contamination problem in multi-cell TDD systems. 2184-2188 - Thomas L. Marzetta, Nihar Jindal, Angel E. Lozano:
What is the value of joint processing of pilots and data in block-fading channels? 2189-2193
Channel Capacity
- Yiyue Wu, Linda M. Davis, A. Robert Calderbank:
On the capacity of the discrete-time channel with uniform output quantization. 2194-2198 - Jaspreet Singh, Upamanyu Madhow:
On block noncoherent communication with low-precision phase quantization at the receiver. 2199-2203 - Yury Polyanskiy, H. Vincent Poor, Sergio Verdú:
Dispersion of Gaussian channels. 2204-2208 - Yury Polyanskiy, H. Vincent Poor, Sergio Verdú:
Dispersion of the Gilbert-Elliott channel. 2209-2213 - Alfonso Martinez:
A lower bound for the capacity of the discrete-time Poisson channel. 2214-2215
Codes and Bands
- Stefan Ruzika, Akin Tanatmis, Frank Kienle, Horst W. Hamacher, Norbert Wehn, Mayur Punekar:
Valid inequalities for binary linear codes. 2216-2220 - Maximilien Gadouleau, Zhiyuan Yan:
Construction and covering properties of constant-dimension codes. 2221-2225 - Maximilien Gadouleau, Zhiyuan Yan:
Decoder error probability of bounded distance decoders for constant-dimension codes. 2226-2230 - Shashi Borade, Sujay Sanghavi:
Some fundamental coding theoretic limits of unequal error protection. 2231-2235 - Yanling Chen, A. J. Han Vinck:
The optimum distance profiles of the second order Reed-Muller codes. 2236-2240
Biometric Identification and Fingerprinting
- Frans M. J. Willems:
Searching methods for biometric identification systems: Fundamental limits. 2241-2245 - Vladimir B. Balakirsky, Anahit R. Ghazaryan, A. J. Han Vinck:
Combinatorial data reduction algorithm and its applications to biometric verification. 2246-2250 - Tanya Ignatenko, Frans M. J. Willems:
Secret rate - Privacy leakage in biometric systems. 2251-2255 - Yen-Wei Huang, Pierre Moulin:
Saddle-point solution of the fingerprinting capacity game under the marking assumption. 2256-2260 - N. Prasanth Anthapadmanabhan, Alexander Barg:
Two-level fingerprinting codes. 2261-2265
Interference and System Performance
- Yue Zhao, Gregory J. Pottie:
Optimal spectrum management in multiuser interference channels. 2266-2270 - Amina Piemontese, Giulio Colavolpe:
A novel graph-based soft interference cancellation algorithm for FDM-CPM satellite systems. 2271-2275 - Yunnan Wu, Alexandros G. Dimakis:
Reducing repair traffic for erasure coding-based storage via interference alignment. 2276-2280 - Kamyar Moshksar, Amir K. Khandani:
Resource management in interference channels with asynchronous users. 2281-2285
Generation and Cost of Secrecy
- Ashish Khisti, Gregory W. Wornell, Suhas N. Diggavi:
Secret key agreement using asymmetry in channel state knowledge. 2286-2290 - Mustafa Cenk Gursoy:
Secure communication in the low-SNR regime: A Characterization of the energy-secrecy tradeoff. 2291-2295 - Stark C. Draper, Akbar M. Sayeed, Tzu-Han Chou:
Minimum energy per bit for secret key acquisition over multipath wireless channels. 2296-2300 - Mustafa El-Halabi, Tie Liu, Costas N. Georghiades:
On secrecy capacity per unit cost. 2301-2305
Network Information Theory
- Nan Ma, Prakash Ishwar, Piyush Gupta:
Information-theoretic bounds for multiround function computation in collocated networks. 2306-2310 - Ertem Tuncel, H. Vincent Poor, Andrea Goldsmith, Deniz Gündüz:
Identification over multiple databases. 2311-2315 - Wei-Hsin Gu, Michelle Effros:
A strong converse for a collection of network source coding problems. 2316-2320 - Deniz Gündüz, Osvaldo Simeone, Andrea Goldsmith, H. Vincent Poor, Shlomo Shamai:
Relaying simultaneous multicasts via structured codes. 2321-2325
Rateless Codes
- Ghid Maatouk, Amin Shokrollahi:
Analysis of the second moment of the LT decoder. 2326-2330 - Xiaojun Yuan, Li Ping:
Quasi-systematic doped LT codes. 2331-2335 - Cedomir Stefanovic, Vladimir Stankovic, Milos Stojakovic, Dejan Vukobratovic:
Raptor packets: A packet-centric approach to distributed raptor code design. 2336-2340 - Zheng Wang, Jie Luo:
Concatenated fountain codes. 2341-2345
Feedback in Wireless Communication II
- Xiujie Huang, Aleksandar Kavcic, Xiao Ma, Danilo P. Mandic:
Upper bounds on the capacities of non-controllable finite-state channels using dynamic programming methods. 2346-2350 - Ya-Lan Liang, Yung-Shun Wang, Tsung-Hui Chang, Yao-Win Peter Hong, Chong-Yung Chi:
On the impact of quantized channel feedback in guaranteeing secrecy with artificial noise. 2351-2355 - Shuang Echo Yang, Daniela Tuninetti:
A new sum-rate outer bound for Gaussian Interference Channels with Generalized Feedback. 2356-2360 - K. Raj Kumar, Giuseppe Caire:
Channel state feedback over the MIMO-MAC. 2361-2365
Multiple-Access Channels
- Jing Yang, Sennur Ulukus:
Delay minimization in multiple access channels. 2366-2370 - Ramji Venkataramanan, S. Sandeep Pradhan:
A new achievable rate region for the discrete memoryless multiple-access channel with feedback. 2371-2375 - Abdellatif Zaidi, Luc Vandendorpe, Shivaprasad Kotagiri, J. Nicholas Laneman:
Multiaccess channels with state known to one encoder: Another case of degraded message sets. 2376-2380 - Gerhard Wunder, Jörg Bühler:
On capacity computation for the two-user binary multiple-access channel. 2381-2385
Algebraic Error-Correcting Codes II
- Yumi Sakemi, Yoshitaka Morikawa, Yasuyuki Nogami, Hidehiro Kato:
Cross twisted Xate pairing with Barreto-Naehrig curve for multi-pairing technique. 2386-2390 - Shoujiro Hirasawa, Atsuko Miyaji:
Elliptic curves with a pre-determined embedding degree. 2391-2395 - Sunghyu Han, Heisook Lee, Yoonjin Lee, Jon-Lark Kim:
Construction of cubic self-dual codes. ISIT 2009: 2396-2399 - Jon-Lark Kim, Yoonjin Lee:
Self-dual codes using the building-up construction. 2400-2402
Statistics II
- Osman Yagan, Armand M. Makowski:
Connectivity results for random key graphs. 2403-2407 - Yan Wang, Yajun Mei:
Decentralized two-sided sequential tests for A normal mean. 2408-2412 - Babar H. Khan, Øyvind Ryan, Mérouane Debbah, Tareq Y. Al-Naffouri:
Estimation of the distribution of randomly deployed wireless sensors. 2413-2417 - Ulrich Speidel:
A note on BSD codes constructed from T-codes. 2418-2421
Interference and Capacity
- Nan Liu, Ivana Maric, Andrea Goldsmith, Shlomo Shamai:
Bounds and capacity results for the cognitive Z-interference channel. 2422-2426 - Onur Ozan Koyluoglu, Mohammad Shahmohammadi, Hesham El Gamal:
A new achievable rate region for the discrete memoryless X channel. 2427-2431 - Yongwei Huang, Daniel Pérez Palomar:
Rank-constrained separable semidefinite programming for optimal beamforming design. 2432-2436 - Vasanthan Raghavan, Michael L. Honig, Venugopal V. Veeravalli:
Performance analysis of RVQ-based limited feedback beamforming codebooks. 2437-2441
Physical Layer Security
- Pedro C. Pinto, João Barros, Moe Z. Win:
Wireless physical-layer security: The case of colluding eavesdroppers. 2442-2446 - Imre Csiszár, Prakash Narayan:
Secrecy generation for multiple input multiple output channel models. 2447-2451 - Matthieu R. Bloch:
Channel scrambling for secrecy. 2452-2456 - Nebojsa Milosavljevic, Michael Gastpar, Kannan Ramchandran:
Secure communication using an untrusted relay via sources and channels. 2457-2461
Broadcast Channels
- Amin Aminzadeh Gohari, Venkat Anantharam:
Evaluation of Marton's inner bound for the general broadcast channel. 2462-2466 - Eli Haim, Ram Zamir:
On the tightness of Marton's regions for semi-additive broadcast channels. 2467-2471 - Tie Liu, Jae Won Yoo, Feng Xue:
Gaussian broadcast channels with receiver message side information. 2472-2476 - Chao Tian, Shlomo Shamai, Suhas N. Diggavi:
Approximate characterizations for the Gaussian broadcasting distortion region. 2477-2481 - Alexander Barg, Arya Mazumdar:
On the number of errors correctable with codes on graphs. 2482-2486 - Harm S. Cronie, Bertrand Ndzana Ndzana, Amin Shokrollahi:
Decoding algorithms for binary Raptor codes over nonbinary channels. 2487-2491 - Feng Lu, Chuan Heng Foh, Jianfei Cai, Liang-Tien Chia:
LT codes decoding: Design and analysis. 2492-2496 - Kenta Kasai, Ryuhei Mori, Toshiyuki Tanaka, Kohichi Sakaniwa:
Finite-length analysis of irregular expurgated LDPC codes under finite number of iterations. 2497-2501
Wireless Broadcast
- Lan Zhang, Ying-Chang Liang, Yan Xin, Rui Zhang, H. Vincent Poor:
On Gaussian MIMO BC-MAC duality with multiple transmit covariance constraints. 2502-2506 - Yonatan Kaspi, Neri Merhav:
Error exponents of optimum decoding for the degraded broadcast channel using moments of type class enumerators. 2507-2511 - Miguel R. D. Rodrigues, Gil Ramos:
On multiple-input multiple-output Gaussian channels with arbitrary inputs subject to jamming. 2512-2516 - Pulkit Grover, Anant Sahai:
Time-division multiplexing for green broadcasting. 2517-2521
Cognitive Radio Systems
- George T. Amariucai, Shuangqing Wei:
Mixed anti-jamming strategies in fixed-rate wireless systems over fast fading channels. 2522-2526 - Dae-Young Seol, Hyoung-Jin Lim, Gi-Hong Im:
Optimal threshold adaptation with radio environment map for cognitive radio networks. 2527-2531 - Chinmay S. Vaze, Mahesh K. Varanasi:
Dirty Paper Coding for the MIMO cognitive radio channel with imperfect CSIT. 2532-2536 - Feifei Gao, Xiaodong Wang, Rui Zhang, Ying-Chang Liang:
Optimal design of learning based MIMO cognitive radio systems. 2537-2541
Codes and Applications I
- Jen-Chun Chang, Hsin-Lung Wu:
Distance-increasing mappings from binary vectors to constant composition vectors. 2542-2546 - Svante Janson, Tero Laihonen:
An optimal result for codes identifying sets of words. 2547-2551 - Dario Fertonani, Tolga M. Duman:
Novel bounds on the capacity of binary channels with deletions and substitutions. 2552-2556 - Majid Fozunbal:
A subsequence-histogram method for generic vocabulary recognition over deletion channels. 2557-2561
Wireless Network Coding
- Ming Xiao, Mikael Skoglund:
Design of network codes for multiple-user multiple-relay wireless networks. 2562-2566 - Jasper Goseling, Ryutaroh Matsumoto, Tomohiko Uyematsu, Jos H. Weber:
On the energy benefit of network coding for wireless multiple unicast. 2567-2571 - Poramate Tarasak, Ubolthip Sethakaset, Sumei Sun:
Capacity analysis of two-user opportunistic scheduling for wireless network coding. 2572-2576 - Sameh Sorour, Shahrokh Valaee:
Adaptive network coded retransmission scheme for wireless multicast. 2577-2581
Gaussian Interference Channels
- Raúl H. Etkin:
New sum-rate upper bound for the two-user Gaussian interference channel. 2582-2586 - Eduard Calvo, Javier Rodríguez Fonollosa, Josep Vidal:
On the totally asynchronous interference channel with single-user receivers. 2587-2591 - Sae-Young Chung, Sang Won Choi:
On the separability of parallel Gaussian interference channels. 2592-2596 - Xiaohu Shang, Biao Chen, Gerhard Kramer, H. Vincent Poor:
Noisy-interference sum-rate capacity of parallel Gaussian interference channels. 2597-2601
Wireless Security
- Ruoheng Liu, Ronit Bustin, Shlomo Shamai, H. Vincent Poor:
An MMSE approach to the secrecy capacity of the MIMO Gaussian wiretap channel. 2602-2606 - H. Vincent Poor, Lalitha Sankar, Vaneet Aggarwal, A. Robert Calderbank:
Information secrecy from multiple eavesdroppers in orthogonal relay channels. 2607-2611 - Ersen Ekrem, Sennur Ulukus:
Secrecy capacity region of the Gaussian multi-receiver wiretap channel. 2612-2616 - Karim Khalil, Moustafa Youssef, Onur Ozan Koyluoglu, Hesham El Gamal:
On the delay limited secrecy capacity of fading channels. 2617-2621
Multiuser Information Theory
- Bernd Bandemer, Abbas El Gamal, Gonzalo Vazquez-Vilar:
On the sum capacity of a class of cyclically symmetric deterministic interference channels. 2622-2626 - Aman Jain, Sanjeev R. Kulkarni, Sergio Verdú:
Multicasting in large random wireless networks: Bounds on the minimum energy per bit. 2627-2631 - Qi Chen, Chen He, Lingge Jiang, Qingchuan Wang:
Average entropy functions. 2632-2633 - Viveck R. Cadambe, Syed Ali Jafar, Sriram Vishwanath:
The capacity region of a class of deterministic Z channels. 2634-2638
Analysis of LDPC Codes IV
- Mahdi Cheraghchi:
Capacity achieving codes From randomness conductors. 2639-2643 - Rüdiger L. Urbanke, Iryna Andriyanova:
Waterfall region performance of punctured LDPC codes over the BEC. 2644-2648 - Kohichi Sakaniwa, Kenta Kasai, Takayuki Nozaki:
Analytical solution of covariance evolution for regular LDPC codes. 2649-2653 - Shrinivas Kudekar, Nicolas Macris:
Decay of correlations in low density parity check codes: Low noise regime. 2654-2658
Optimization of Wireless Systems
- Jun Zhang, Marios Kountouris, Jeffrey G. Andrews, Robert W. Heath Jr.:
Achievable throughput of multi-mode multiuser MIMO with imperfect CSI constraints. 2659-2663 - Hoon Huh, Haralabos C. Papadopoulos, Giuseppe Caire:
MIMO broadcast channel optimization under general linear constraints. 2664-2668 - Chee Wei Tan, Mung Chiang, R. Srikant:
Maximizing sum rate and minimizing MSE on multiuser downlink: Optimality, fast algorithms and equivalence via max-min SIR. 2669-2673 - Tao Cui, Tracey Ho, Jörg Kliewer:
Achievable rate and optimal physical layer rate allocation in interference-free wireless networks. 2674-2678
Network Detection
- Rui Zhang, John M. Cioffi:
Iterative spectrum shaping with opportunistic multiuser detection. 2679-2683 - Lei Bao, Mikael Skoglund, Carlo Fischione, Karl Henrik Johansson:
Optimized rate allocation for state estimation over noisy channels. 2684-2688 - Mikko Vehkaperä, Keigo Takeuchi, Ralf R. Müller, Toshiyuki Tanaka:
Iterative channel and data estimation: Framework and analysis via replica method. 2689-2693 - Tara Javidi, Raghava N. Swamy:
Optimal code length for bursty sources with deadlines. 2694-2698
Combinatorial Codes
- Arya Mazumdar, Ron M. Roth, Pascal O. Vontobel:
On linear balancing sets. 2699-2703 - Noha Elarief, Bella Bose:
Optimal, systematic q-ary codes correcting all asymmetric errors of limited magnitude. 2704-2707 - Laura Pezza, Luca G. Tallini, Bella Bose:
On systematic variable length unordered codes. 2708-2712 - Shi-Chun Tsai, Min-Zheng Shieh:
Decoding frequency permutation arrays under infinite norm. 2713-2717
Security
- Shuheng Zhou, Katrina Ligett, Larry A. Wasserman:
Differential privacy with compression. 2718-2722 - Michael Langberg, Sidharth Jaggi, Bikash Kumar Dey:
Binary causal-adversary channels. 2723-2727 - Orna Sumszyk, Yossef Steinberg:
Information embedding with reversible stegotext. 2728-2732 - Boris Ryabko, Daniil Ryabko:
Using Kolmogorov complexity for understanding some limitations on steganography. 2733-2736
Wireless Network Broadcast and Access
- Mathieu Cluzeau, Matthieu Finiasz:
Recovering a code's length and synchronization from a noisy intercepted bitstream. 2737-2741 - Nadia Jamal, Hamidreza Ebrahimzadeh Saffar, Patrick Mitran:
Throughput enhancements in point-to-multipoint cognitive systems. 2742-2746 - Michal Kaliszan, Marcin Wiczanowski, Slawomir Stanczak, Nicholas Bambos:
A characterization of max-min SIR-balanced power allocation with applications. 2747-2751 - Kamyar Moshksar, Amir K. Khandani:
On the design of PN codes in decentralized networks. 2752-2756
Broadcast Channels and Secrecy
- Ruoheng Liu, Tie Liu, H. Vincent Poor, Shlomo Shamai:
MIMO Gaussian broadcast channels with confidential messages. 2757-2761 - Xiaojun Tang, H. Vincent Poor, Ruoheng Liu, Predrag Spasojevic:
Secret-key sharing based on layered broadcast coding over fading channels. 2762-2766 - Wei Kang, Nan Liu:
The secrecy capacity of the semi-deterministic broadcast channel. 2767-2771 - Ghadamali Bagherikaram, Abolfazl S. Motahari, Amir K. Khandani:
The secrecy capacity region of the degraded vector Gaussian broadcast channel. 2772-2776
Broadcasting Correlated Sources
- Gerhard Kramer, Chandra Nair:
Comments on "broadcast channels with arbitrarily correlated sources". 2777-2779 - Paolo Minero, Young-Han Kim:
Correlated sources over broadcast channels. 2780-2784 - Hamid Behroozi, Fady Alajaji, Tamás Linder:
Hybrid digital-analog joint source-channel coding for broadcasting correlated Gaussian sources. 2785-2789 - Rajiv Soundararajan, Sriram Vishwanath:
Hybrid coding for Gaussian broadcast channels with Gaussian sources. 2790-2794
Algebraic Methods II
- Yindong Chen, Yao Lu, Peizhong Lu:
Fast computation of Gröbner bases of ideals of F[x, y]. 2795-2798 - Ernst M. Gabidulin:
Rank q-cyclic and pseudo-q-cyclic codes. 2799-2802 - Moon Ho Lee, Yuri L. Borissov:
On Jacket transforms over finite fields. 2803-2807 - T.-H. Hubert Chan, Kevin L. Chang, Rajiv Raman:
An SDP primal-dual algorithm for approximating the Lovász-theta function. 2808-2812
Space-Time Coding IV
- Petros Elia, P. Vijay Kumar:
Space-time codes that are approximately universal for the parallel, multi-block and cooperative DDF channels. 2813-2817 - Avik Ray, Ghaya Rekaya-Ben Othman, P. Vijay Kumar, K. Vinodh:
Ideal structure of the Silver code. 2818-2822 - Joseph Jean Boutros, Hugues Randriambololona:
The Aladdin-Pythagoras space-time code. 2823-2827 - Haiquan Wang, Zhijin Zhao:
Distributed differential space-time codes based on Weyl's reciprocity. 2828-2832
Operation of Ad Hoc Networks
- Long Gao, Shuguang Cui, Changchuan Yin, Rui Zhang:
Delay-throughput tradeoff for supportive two-tier networks. 2833-2837 - Abhijeet Bhorkar, Bhaskar D. Rao, Mohammad Naghshvar, Tara Javidi:
An adaptive opportunistic routing scheme for wireless ad-hoc networks. 2838-2842 - Changchuan Yin, Long Gao, Shuguang Cui:
Delay-throughput tradeoff for overlaid wireless networks of different priorities. 2843-2847 - Jiening Zhan, Uri Erez, Michael Gastpar, Bobak Nazer:
MIMO compute-and-forward. 2848-2852 - Qiang Li, See Ho Ting, Chin Keong Ho:
Nonlinear network code for high throughput broadcasting with retransmissions. 2853-2857
Network Codes
- Danilo Silva, Frank R. Kschischang:
Fast encoding and decoding of Gabidulin codes. 2858-2862 - Martin Bossert, Ernst M. Gabidulin:
One family of algebraic codes for network coding. 2863-2866 - Maximilien Gadouleau, Zhiyuan Yan:
Packing and covering properties of subspace codes. 2867-2871 - Alex Sprintson, Salim Y. El Rouayheb, Costas N. Georghiades:
A new construction method for networks from matroids. 2872-2876
Sensors and Network Coding
- Fernando Pérez-Cruz, Sanjeev R. Kulkarni:
Distributed least square for consensus building in sensor networks. 2877-2881 - Animashree Anandkumar, Alan S. Willsky, Lang Tong:
Detection error exponent for spatially dependent samples in random networks. 2882-2886 - Jatinder P. Singh, Ashish Khisti:
On multicasting with streaming burst-erasure codes. 2887-2891 - Namyoon Lee, Jong Bu Lim:
A novel signaling for communication on MIMO Y channel: Signal space alignment for network coding. 2892-2896
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-27 00:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
