default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Theory and Applications 2010: San Diego, CA, USA
- Information Theory and Applications Workshop, ITA 2010, San Diego, California, USA, January 31 - February 5, 2010. IEEE 2010, ISBN 978-1-4244-7014-3
- Emmanuel Abbe, Emre Telatar:
MAC polar codes and matroids. 8-15 - Li Zhang, Qin Huang, Shu Lin, Khaled A. S. Abdel-Ghaffar, Ian F. Blake:
Quasi-cyclic LDPC codes on Latin squares and the ranks of their parity-check matrices. 16-22 - Jung Hyun Bae, Achilleas Anastasopoulos:
The capacity of Markov channels with noiseless output and state feedback. 23-27 - Hong Ju Park, Boyu Li, Ender Ayanoglu:
Multiple beamforming with constellation precoding: Diversity analysis and Sphere Decoding. 28-38 - Maricica Nistor, João Barros
, Fausto Vieira, Tiago T. V. Vinhoza, Joerg Widmer:
Network coding delay: A brute-force analysis. 39-43 - Hong Wan, Rong-Rong Chen, Jun Won Choi, Andrew C. Singer, James C. Preisig, Behrouz Farhang-Boroujeny:
Markov Chain Monte Carlo detection for underwater acoustic channels. 44-48 - Yeo Hun Yun, Joon Ho Cho:
On sum capacity of continuous-time overloaded CDMA systems. 49-58 - Jun Won Choi, Byonghyo Shim, Andrew C. Singer:
On the improved path metric for soft-input soft-output tree detection. 59-63 - Si-Hyeon Lee, Sae-Young Chung:
When is compress-and-forward optimal? 64-66 - Michael Lentmaier, David G. M. Mitchell, Gerhard P. Fettweis, Daniel J. Costello Jr.:
Asymptotically regular LDPC codes with linear distance growth and thresholds close to capacity. 67-74 - Matthew Ager, Zoran Cvetkovic, Peter Sollich:
High-dimensional linear representations for robust speech recognition. 75-79 - Kevin Swersky, Bo Chen, Benjamin M. Marlin, Nando de Freitas:
A tutorial on stochastic approximation algorithms for training Restricted Boltzmann Machines and Deep Belief Nets. 80-89 - Dominique Tschopp, Suhas N. Diggavi:
Facebrowsing: Search and navigation through comparisons. 90-99 - Shadi Abu-Surra, Dariush Divsalar, William E. Ryan:
On the existence of typical minimum distance for protograph-based LDPC codes. 100-106 - Lara Dolecek:
On absorbing sets of structured sparse graph codes. 107-111 - Michelle Effros:
On capacity outer bounds for a simple family of wireless networks. 112-118 - Michele Franceschini, Luis Alfonso Lastras-Montaño, John P. Karidis, Ashish Jagmohan:
Information theory based design of phase-change memories. 119-125 - Randa Zakhour, David Gesbert:
Team decision for the cooperative MIMO channel with imperfect CSIT sharing. 126-131 - Jerry D. Gibson, Jing Hu, Pravin Ramadas:
New rate distortion bounds for speech coding based on composite source models. 132-136 - Alexandre Graell i Amat, Ingmar Land:
An analytical expression of the probability of error for relaying with decode-and-forward. 137-141 - Aman Jain, Deniz Gündüz, Sanjeev R. Kulkarni, H. Vincent Poor, Sergio Verdú:
Energy-distortion tradeoff with multiple sources and feedback. 142-146 - Riccardo Giacomelli, Radha Krishna Ganti, Martin Haenggi:
Asymptotic outage analysis of general motion-invariant Ad Hoc Networks. 147-152 - Thomas R. Halford, Keith M. Chugg:
Barrage Relay Networks. 153-160 - Te Sun Han:
Polymatroids with network coding. 161-172 - Takao Inoue, Robert W. Heath Jr.:
Grassmannian predictive frequency domain compression for limited feedback beamforming. 173-177 - Tor Helleseth, Alexander Kholosha:
On generalized bent functions. 178-183 - Sukwon Kim, Tracey Ho, Michelle Effros, Amir Salman Avestimehr:
New results on network error correction: Capacities and upper bounds. 184-193 - Bertrand M. Hochwald, Louay M. A. Jalloul:
Statistical distributions that arise in constrained beamforming with incomplete channel information. 194-203 - Libin Jiang, Jian Ni, R. Srikant, Jean C. Walrand:
Performance bounds of distributed CSMA scheduling. 204-209 - Irina E. Bocharova, Florian Hug, Rolf Johannesson, Boris D. Kudryashov:
On weight enumerators and MacWilliams identity for convolutional codes. 210-215 - Ashish Khisti:
On the MISO compound wiretap channel. 216-222 - Tao Cui, Tracey Ho, Jörg Kliewer:
Achievable strategies for general secure network coding. 223-228 - Onur Ozan Koyluoglu, Can Emre Koksal, Hesham El Gamal:
On secrecy capacity scaling in wireless networks. 229-232 - Changmian Wang, Bhaskar Krishnamachari, Qing Zhao, Geir E. Øien:
Performance of round robin policies for dynamic multichannel access. 233-239 - K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar, Kannan Ramchandran:
Explicit and optimal codes for distributed storage. 240-244 - L. A. Lastras-Montao, Thomas Mittelholzer, Michele Franceschini:
Superposition coding in rewritable channels. 245-253 - Jin-Woo Lee, Hee-Nam Cho, Han-Jun Park, Yong-Hwan Lee:
Sum-rate capacity of correlated multi-user MIMO channels. 254-258 - Ayfer Özgür, Olivier Lévêque, David Tse:
Linear capacity scaling in wireless networks: Beyond physical limits? 259-268 - Li Zhang, Qin Huang, Shu Lin:
Iterative decoding of a class of cyclic codes. 269-277 - Quanquan Liang, Mingyan Liu, Dongfeng Yuan:
Channel estimation for opportunistic spectrum sensing: Uniform and random sensing. 278-287 - Lukas Bolliger, Hans-Andrea Loeliger, Christian Vogel:
Simulation, MMSE estimation, and interpolation of sampled continuous-time signals using factor graphs. 288-291 - Mahdi Lotfinezhad, Peter Marbach:
Delay performance of CSMA policies in multihop wireless networks: A new perspective. 292-299 - Eric Torkildson, Hong Zhang, Upamanyu Madhow:
Channel modeling for millimeter wave MIMO. 300-307 - Marco Martalò, Gianluigi Ferrari, Andrea Abrardo, Michele Franceschini, Riccardo Raheli:
Density evolution-based analysis and design of LDPC codes with a priori information. 308-316 - Fang Zhao, Muriel Médard:
On analyzing and improving COPE performance. 317-322 - Hon Fah Chong, Mehul Motani, Nan Feng:
Transmitter optimization for distributed Gaussian MIMO channels. 323-328 - Pierre Moulin:
Statistical modeling and analysis of content identification. 329-333 - Varun S. Jog, Chandra Nair:
An information inequality for the BSSC broadcast channel. 334-341 - Behrouz Touri, Angelia Nedic, Sundhar Srinivasan Ram:
Asynchronous stochastic convex optimization over random networks: Error bounds. 342-351 - Michael J. Neely:
Stochastic network optimization with non-convex utilities and costs. 352-361 - Sirin Nitinawarat, Prakash Narayan:
Perfect omniscience, perfect secrecy and Steiner tree packing. 362-366 - Eduardo I. Silva, Milan S. Derpich, Jan Østergaard:
Independent source coding for control over noiseless channels. 367-368 - Po-Hsiang Lai, Joseph A. O'Sullivan:
MDL hierarchical clustering with incomplete data. 369-373 - Yue Zhao, Gregory J. Pottie:
Optimization of power and channel allocation using the deterministic channel model. 374-381 - Mathieu Feuillet, Alexandre Proutière, Philippe Robert:
Random capture algorithms fluid limits and stability. 382-385 - Giuseppe Caire, Sean A. Ramprashad, Haralabos C. Papadopoulos:
Rethinking network MIMO: Cost of CSIT, performance analysis, and architecture comparisons. 386-395 - Shadi Abu-Surra, David Declercq, Dariush Divsalar, William E. Ryan:
Trapping set enumerators for specific LDPC codes. 396-400 - Lalitha Sankar, S. Raj Rajagopalan, H. Vincent Poor:
Utility and privacy of data sources: Can Shannon help conceal and reveal information? 401-407 - M. H. R. Khouzani, Saswati Sarkar:
Dynamic malware attack in energy-constrained mobile wireless networks. 408-418 - Mehmet Ercan Yildiz, Roberto Pagliari, Asuman E. Ozdaglar, Anna Scaglione:
Voting models in random networks. 419-425 - Itzhak Tamo, Moshe Schwartz:
Correcting limited-magnitude errors in the rank-modulation scheme. 426-427 - Tsung-Yi Chen, Nambi Seshadri, Ba-Zhong Shen:
Is feedback a performance equalizer of classic and modern codes? 428-432 - Lei Ying, R. Srikant, Srinivas Shakkottai:
The asymptotic behavior of minimum buffer size requirements in large P2P streaming networks. 433-438 - Wenyi Zhang, Ahmed K. Sadek, Cong Shen, Stephen J. Shellhammer:
Adaptive spectrum sensing. 439-445 - Noam Shental, Amnon Amir, Or Zuk:
Compressed sensing-based pooling experiments using next generation sequencing. 446-447 - Andrew C. Singer, Andrew J. Bean, Jun Won Choi:
Mutual information and time-interleaved analog-to-digital conversion. 448-452 - Francesco Negro, Shakti Prasad Shenoy, Irfan Ghauri, Dirk T. M. Slock:
On the MIMO interference channel. 453-461 - Goran Ivkovic, Predrag Spasojevic, Ivan Seskar:
Single sensor radio scene analysis for packet based radio signals. 462-471 - Shiyao Chen, Lang Tong:
Multiuser cognitive access of continuous time Markov channels: Maximum throughput and effective bandwidth regions. 472-481 - Sudarshan Vasudevan, Stephan Adams, Dennis Goeckel, Zhiguo Ding, Donald F. Towsley, Kin K. Leung:
Multi-user diversity for secrecy in wireless networks. 482-490 - Dmitri V. Truhachev:
Multi-stream information transmission over K-user interference networks. 491-499 - Daniela Tuninetti:
An outer bound region for Interference Channels with Generalized Feedback. 500-504 - Omur Ozel, Elif Uysal-Biyikoglu, Tolga Girici:
Optimal buffer partitioning on a multiuser wireless link. 505-514 - Shiva Kumar Planjery, Shashi Kiran Chilappagari, Bane Vasic, David Declercq, Ludovic Danjean:
Iterative decoding beyond belief propagation. 515-524 - Pascal O. Vontobel:
A factor-graph-based random walk, and its relevance for LP decoding analysis and Bethe entropy characterization. 525-534 - Thomas A. Courtade, Richard D. Wesel:
A deterministic approach to rate-compatible fountain communication. 535-539 - Yang Yang, Yifu Zhang, Zixiang Xiong:
A new sufficient condition for sum-rate tightness of quadratic Gaussian MT source coding. 540-544 - En-Hui Yang, Jin Meng:
On interactive encoding and decoding for distributed lossless coding of individual sequences. 545-551 - Peyman Razaghi, Wei Yu:
Universal relaying for the interference channel. 552-557 - Xinmiao Zhang, Jiangli Zhu:
Hardware complexities of algebraic soft-decision Reed-Solomon decoders and comparisons. 558-567 - Keqin Liu, Qing Zhao:
Decentralized multi-armed bandit with multiple distributed players. 568-577
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 2024-11-08 20:18 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:
