default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDITW 2008: Porto, Portugal
- 2008 IEEE Information Theory Workshop, ITW 2008, Porto, Portugal, May 5-9, 2008. IEEE 2008
- Charles H. Bennett, Mavis Donkor:
Thermodynamics of error correction: speed-error-dissipation tradeoff in copying. 1 - Yingbin Liang, Gerhard Kramer
, Shlomo Shamai:
Capacity outer bounds for broadcast channels. 2-4 - Lav R. Varshney:
Meeting Shannon: Information-theoretic thinking in engineering and science. 5 - Tobias Koch, Amos Lapidoth:
Multipath channels of bounded capacity. 6-10 - Ron Dabora, Andrea Goldsmith:
The capacity region of the degraded finite-state broadcast channel. 11-15 - Sriram Sridharan, Angel Lozano, Harish Viswanathan, Sriram Vishwanath:
Capacity to within one bit of a class of Gaussian multicast channels with interference. 16-20 - Patricia Layec, Pablo Piantanida, Raphaël Visoz, Antoine O. Berthet:
Capacity bounds for MIMO multiple access channel with imperfect channel state information. 21-25 - Eran Hof, Igal Sason, Shlomo Shamai:
Gallager-type bounds for non-binary linear block codes over memoryless symmetric channels. 26-30 - Tal Philosof, Ram Zamir:
The rate loss of single letter characterization for the "dirty" multiple access channel. 31-35 - Eren Sasoglu:
Successive cancellation for cyclic interference channels. 36-40 - Viveck R. Cadambe, Syed Ali Jafar, Shlomo Shamai:
Interference alignment on the deterministic channel and application to fully connected AWGN interference networks. 41-45 - Ron Dabora, Ivana Maric, Andrea Goldsmith:
Relay strategies for interference-forwarding. 46-50 - Holger Boche, Ullrich J. Mönich:
Time domain representation of systems on bandlimited signals. 51-55 - Maxime Guillaud, Mérouane Debbah, Aris L. Moustakas:
A characterization of maximum entropy spatially correlated wireless channel models. 56-60 - Jouko Leinonen, Jyri Hämäläinen, Markku J. Juntti:
Outage capacity analysis of downlink ODFMA resource allocation with limited feedback. 61-65 - Masanori Hirotomo, Yoshiho Konishi, Masakatu Morii:
A probabilistic algorithm for finding the minimum-size stopping sets of LDPC codes. 66-70 - Bo Zhou, Li Zhang, Qin Huang, Shu Lin, Meina Xu:
Constructions of high performance non-binary quasi-cyclic LDPC codes. 71-75 - Marco Ferrari, Sandro Bellini, Marcel Adrian Ambroze, Martin Tomlinson:
A II-HARQ scheme for BEC models with ML decoding of Turbo Codes. 76-80 - Frédérique E. Oggier:
Design of algebraic cyclic codes. 81-85 - Laura Luzzi, Ghaya Rekaya-Ben Othman, Jean-Claude Belfiore, Emanuele Viterbo:
Golden space-time block coded modulation. 86-90 - Camilla Hollanti, Jyrki T. Lahtonen, Kalle Ranto, Roope Vehkalahti, Emanuele Viterbo:
On the algebraic structure of the Silver code: A 2 × 2 perfect space-time block code. 91-94 - Alberto Apostolico, Olgert Denas:
Sequence distances based on exhaustive substring composition. 95-98 - Petar M. Djuric, Mónica F. Bugallo, Vibha Mane:
On new stochastic approaches for solving forward and backward problems of biochemical networks. 99-103 - Don H. Johnson:
Information theory and neuroscience: Why is the intersection so small? 104-108 - Julian Jarzebowski, Lakshminarayan Srinivasan, Todd P. Coleman:
Using stochastic control with data compression perspectives to enhance P300 Neural Communication Prostheses. 109-113 - Janis Dingel, Olgica Milenkovic:
Coding-theoretic methods for reverse engineering of gene regulatory networks. 114-118 - Boris Ryabko, Natalie Usotskaya:
DNA-sequence analysis using Markov chain models. 119-123 - Wei Dai, Olgica Milenkovic:
Weighted Euclidean superimposed codes for integer compressed sensing. 124-128 - Walid Hachem, Pascal Bianchi, Philippe Ciblat:
Outage probability optimization of certain wireless relaying protocols. 129-133 - Clemens Schnurr, Slawomir Stanczak, Tobias J. Oechtering:
Achievable rates for the restricted half-duplex two-way relay channel under a partial-decode-and-forward protocol. 134-138 - Abdellatif Zaidi, Shivaprasad Kotagiri, J. Nicholas Laneman, Luc Vandendorpe:
Cooperative relaying with state available at the relay. 139-143 - Ertugrul Necdet Ciftcioglu, Aylin Yener, Randall Berry:
Stability of bi-directional cooperative relay networks. 144-148 - Ramakrishna Gummadi, R. S. Sreenivas:
Relaying a fountain code across multiple nodes. 149-153 - Matthieu R. Bloch, Andrew Thangaraj:
Confidential messages to a cooperative relay. 154-158 - Petar Popovski, Osvaldo Simeone:
Wireless secrecy with infrastructure-aided cooperation. 159-163 - Xiaojun Tang, Ruoheng Liu, Predrag Spasojevic, H. Vincent Poor:
Interference-assisted secret communication. 164-168 - Deniz Gündüz, Elza Erkip, H. Vincent Poor:
Secure lossless compression with side information. 169-173 - Itai Leibowitz, Ram Zamir:
A Ziv-Zakai-Rényi lower bound on distortion at high resolution. 174-178 - Jayanth Nayak, Ertem Tuncel, Deniz Gündüz:
Wyner-Ziv coding over broadcast channels. 179-183 - Fadi Abi Abdallah, Raymond Knopp:
Source-channel coding for very-low bandwidth sources. 184-188 - Javier Garcia-Frías, Inaki Esnaola:
Distributed compression of correlated real sequences using random projections. 189-193 - Marek Tomasz Biskup:
A word that does not appear in encoded message as a resynchronization marker. 199-203 - Anatoly Khina, Uri Erez:
On robust dirty paper coding. 204-208 - Nadia Fawaz, Keyvan Zarifi, Mérouane Debbah, David Gesbert:
Asymptotic capacity and optimal precoding strategy of multi-level precode & forward in correlated channels. 209-213 - Carolin Huppert:
Required transmit power for broadcast systems with Tomlinson-Harashima-precoding. 214-218 - Amin Shokrollahi:
The development of Raptor codes. 219 - Yi Lu, Andrea Montanari, Balaji Prabhakar:
Counter Braids. 220-221 - Urs Niesen, Piyush Gupta, Devavrat Shah:
Cooperative multi-hop schemes for arbitrary wireless networks. 222-226 - Nicholas J. A. Harvey, Jelani Nelson, Krzysztof Onak:
Streaming algorithms for estimating entropy. 227-231 - James S. Freudenberg, Richard H. Middleton:
Feedback control performance over a noisy communication channel. 232-236 - Ion Matei, Nuno C. Martins, John S. Baras:
Optimal state estimation for discrete-time Markovian Jump Linear Systems, in the presence of delayed output observations. 237-242 - Sekhar Tatikonda:
Cooperative control under communication constraints. 243-246 - Andrew R. Barron, Cong Huang, Jonathan Q. Li, Xi Luo:
MDL, penalized likelihood, and statistical risk. 247-257 - Jorma Rissanen:
Optimal estimation of families of models. 258 - Peter Grunwald, Steven de Rooij, Tim van Erven:
The Catch-Up Phenomenon. 259-260 - Ioan Tabus, Gergely Korodi:
Genome compression using normalized maximum likelihood models for constrained Markov sources. 261-265 - Alvaro Martín, Gadiel Seroussi, Marcelo J. Weinberger:
Enumerative coding for tree sources. 266-267 - Ioannis Kontoyiannis:
Counting the primes using entropy. 268 - Jerzy Konorski, Wojciech Szpankowski:
What is information? 269-270 - Boris Ryabko:
Compression-based methods for nonparametric density estimation, on-line prediction, regression and classification for time series. 271-275 - Tommi Mononen, Petri Myllymäki:
Computing the NML for Bayesian forests via matrices and generating polynomials. 276-280 - Daniil Ryabko, Boris Ryabko:
On hypotheses testing for ergodic processes. 281-283 - Teemu Roos:
Monte Carlo estimation of minimax regret with an application to MDL model selection. 284-288 - Andrey Gruzin:
Type II error exponent for identity test of Markov processes. 289-291 - Rafael Martínez, Manuel Cebrián, Francisco de Borja Rodríguez, David Camacho:
Contextual information retrieval based on algorithmic information theory and statistical outlier detection. 292-297 - André F. T. Martins, Pedro M. Q. Aguiar, Mário A. T. Figueiredo:
Tsallis kernels on measures. 298-302 - Mokshay Madiman:
On the entropy of sums. 303-307 - Emanuele Grossi, Marco Lops:
Joint sequential detection and estimation of Markov targets. 308-312 - Joseph J. Boutros, Gilles Zémor, Albert Guillen i Fabregas, Ezio Biglieri:
Full-diversity product codes for block erasure and block fading channels. 313-317 - Todd P. Coleman, Negar Kiyavash:
Practical codes for queueing channels: An algebraic, state-space, message-passing approach. 318-322 - Cen Tjhai, Martin Tomlinson, Markus Grassl:
Chains of cyclic codes, Construction X and incremental redundancy. 323-327 - Frédérique E. Oggier, Kirill Morozov:
A practical scheme for string commitment based on the Gaussian channel. 328-332 - Claude Carlet:
Lower bounds on the higher order nonlinearities of Boolean functions and their applications to the inverse function. 333-337 - Steven T. Dougherty, Sihem Mesnager, Patrick Solé:
Secret-sharing schemes based on self-dual codes. 338-342 - Tuncer C. Aysal, Mehmet E. Yildiz, Anna Scaglione:
Broadcast gossip algorithms. 343-347 - Aydin Sezgin, Arogyaswami Paulraj, Eduard A. Jorswieck:
Where to place interferers in a wireless network. 348-352 - André Fonseca dos Santos, Wolfgang Rave, Gerhard P. Fettweis:
Blind turbo multipath channel estimation of PAM signals exploiting multilevel codes. 353-357 - Graeme Smith, John A. Smolin:
Degenerate quantum codes and the quantum channel capacity problem. 358-359 - Renato Renner:
Extracting classical randomness in a quantum world. 360-363 - William Matthews, Andreas J. Winter:
On the Chernoff distance for asymptotic LOCC discrimination of bipartite quantum states. 364-367 - Graeme Smith, John A. Smolin:
Additive extensions of a quantum channel. 368-372 - Igor Bjelakovic, Holger Boche:
Classical capacities of compound quantum channels. 373-377 - Ashley Montanaro:
A lower bound on the probability of error in quantum state discrimination. 378-380 - Aram W. Harrow, Debbie W. Leung:
An exponential separation between the entanglement and communication capacities of a bipartite unitary interaction. 381-385 - Howard Barnum, Oscar C. O. Dahlsten, Matthew Leifer, Ben Toner:
Nonclassicality without entanglement enables bit commitment. 386-390 - Clarice Dias de Albuquerque, Reginaldo Palazzo Júnior, Eduardo Brandani da Silva:
Construction of topological quantum codes on compact surfaces. 391-395 - Markus Grassl, Martin Rötteler:
Non-additive quantum codes from Goethals and Preparata codes. 396-400 - Daniel J. J. Versfeld, Hendrik C. Ferreira, Albertus S. J. Helberg:
Efficient packet erasure decoding by transforming the systematic generator matrix of an RS code. 401-405 - Shashi Kiran Chilappagari, Anantha Raman Krishnan, Bane Vasic:
LDPC codes which can correct three errors under iterative decoding. 406-410 - Marcin Sikora, Daniel J. Costello Jr.:
Supercode heuristics for tree search decoding. 411-415 - Shrinivas Kudekar, Nicolas Macris:
Proof of replica formulas in the high noise regime for communication using LDGM codes. 416-420 - Hideki Yagi, Toshiyasu Matsushima, Shigeichi Hirasawa:
Error control codes for parallel channel with correlated errors. 421-425 - Ling Cheng, Hendrik C. Ferreira, Khmaies Ouahada:
k-bit grouping moment balancing templates for spectral shaping codes. 426-430 - Filip Paluncic, Willem A. Clarke, Hendrik C. Ferreira:
Partitioned moment balancing template and the influence of partition distribution thereon. 431-435 - Walid Hachem, Philippe Loubaton, Jamal Najim:
On the fluctuations of the mutual information of large dimensional MIMO channels. 436-439 - Randa Zakhour, David Gesbert:
Adaptive feedback rate control in MIMO broadcast systems. 440-444 - Miguel R. D. Rodrigues, Fernando Pérez-Cruz, Sergio Verdú:
Multiple-input multiple-output Gaussian channels: Optimal covariance for non-Gaussian inputs. 445-449
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 2025-12-09 23:23 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:
