default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDITW 2006: Punta del Este, Uruguay
- Gadiel Seroussi, Alfredo Viola:
2006 IEEE Information Theory Workshop, ITW 2006, Punta del Este, Uruguay, March 13-17, 2006. IEEE 2006, ISBN 1-4244-0036-8 - Daniel P. Palomar, Sergio Verdú:
Lautum Information. 1-5 - Kaushik Chakraborty, Prakash Narayan:
Reliable Communication over an Optical Fading Channel. 6-10 - Yossef Steinberg
:
Coding for Channels with Rate-Limited Side Information at the Decoder. 11-13 - Gerhard Wunder, Thomas Michel:
Delay-limited OFDM broadcast capacity region and impact of system parameters. 14-18 - Xavier Boyen:
A Promenade through the New Cryptography of Bilinear Pairings. 19-23 - Nicolas Gisin, Sandu Popescu, Valerio Scarani, Stefan Wolf, Jürg Wullschleger:
Oblivious Transfer and Quantum Channels. 24-26 - Antonio Cafure, Guillermo Matera, Ariel Waissbein:
Inverting bijective polynomial maps over finite fields. 27-31 - Venkatesan Guruswami:
List Decoding in Average-Case Complexity and Pseudorandomness. 32-36 - Ralf Kötter:
On optimal weight assignmnents for multivariate interpolation list-decoding. 37-41 - Alexei Ashikhmin:
Fidelity of a Quantum ARQ Protocol. 42-46 - Tuvi Etzion:
Perfect Codes in the Johnson Schemes. 47-51 - Mung Chiang, Steven H. Low, A. Robert Calderbank, John C. Doyle:
Layering As Optimization Decomposition: Framework and Examples. 52-56 - Ao Tang, Jiantao Wang, Steven H. Low, Mung Chiang:
Equilibrium of Heterogeneous Congestion Control Protocols. 57-61 - Michelle Effros, Tracey Ho, Sukwon Kim:
A Tiling Approach to Network Code Design for Wireless Networks. 62-66 - Kyomin Jung, Devavrat Shah:
Fast Gossip via Non-reversible Random Walk. 67-71 - Nicolò Cesa-Bianchi, Gábor Lugosi, Gilles Stoltz:
Regret Minimization Under Partial Monitoring. 72-76 - Tsachy Weissman:
Compound Sequential Decisions Against the Well-Informed Antagonist. 77-81 - Dean P. Foster, Sham M. Kakade:
Calibration via Regression. 82-86 - András György, Tamás Linder, Gábor Lugosi:
The Shortest Path Problem in the Bandit Setting. 87-91 - Alberto Apostolico, Yongwook Choi:
Compressing with Collapsible Tries. 92-96 - Philippe Jacquet:
Control of mobile ad hoc networks. 97-101 - Brigitte Vallée:
Statistics for dynamical sources. 102-106 - Joachim von zur Gathen, Jamshid Shokrollahi:
Fast arithmetic for polynomials over F2in hardware. 107-111 - Horacio Tapia-Recillas:
Some Results on Codes over Galois Rings. 112-115 - Matthieu R. Bloch, Andrew Thangaraj, Steven W. McLaughlin, Jean-Marc Merolla:
LDPC-based Gaussian key reconciliation. 116-120 - Josep Cotrina, Marcel Fernandez, Jordi Casademont:
Families of traceability codes based on the Chinese Remainder Theorem. 121-125 - Julio César López-Hernández, Ricardo Dahab:
New Point Compression Algorithms for Binary Curves. 126-130 - Soheil Mohajer, Payam Pakzad, Ali Kakhbod:
Tight Bounds on the Redundancy of Huffman Codes. 131-135 - Deniz Gündüz, Elza Erkip:
Distortion Exponent of MIMO Fading Channels. 136-140 - Joseph A. O'Sullivan, Naveen Singla, M. Brandon Westover:
Successive Refinement for Pattern Recognition. 141-145 - Jack Keil Wolf:
On Coding for 2-D Storage Systems. 146-149 - Junsheng Han, Paul H. Siegel, Patrick Lee:
On the Probability of Undetected Error for Over-Extended Reed-Solomon Codes. 150-154 - Emina Soljanin, Nedeljko Varnica, Philip Whiting:
Punctured vs Rateless Codes for Hybrid ARQ. 155-159 - Andrea Montanari, David Tse:
Analysis of Belief Propagation for Non-Linear Problems: The Example of CDMA (or: How to Prove Tanaka's Formula). 160-164 - Payam Pakzad, Amin Shokrollahi:
Design Principles for Raptor Codes. 165-169 - Andrew Brown, Amin Shokrollahi:
Some graph products and their expansion properties. 170-174 - Pascal O. Vontobel, Ralf Koetter:
Bounds on the Threshold of Linear Programming Decoding. 175-179 - Jon Feldman:
Using Many Machines to Handle an Enormous Error-Correcting Code. 180-182 - Hui Jin, Tom Richardson:
A New Fast Density Evolution. 183-187 - Axel Huebner, Daniel J. Costello Jr.:
On the Design of S-type Permutors for Double Serially Concatenated Convolutional Codes. 188-192 - Chris T. K. Ng, Ivana Maric, Andrea J. Goldsmith, Shlomo Shamai, Roy D. Yates:
Iterative and One-shot Conferencing in Relay Channels. 193-197 - Gerhard Kramer, Michael Gastpar:
Dependence Balance and the Gaussian Multiaccess Channel with Feedback. 198-202 - Peter Berlin, Bixio Rimoldi, Emre Telatar:
A Simple Derivation of Burnashev's Reliability Function. 203-205 - Sergio D. Servetto:
Backward Channels in Multiterminal Source Coding. 206-210 - Kamal Jain, Vijay V. Vazirani, Gideon Yuval:
On the Coding Advantage of Multiple Unicast Sessions in Undirected Graphs. 211 - Rudolf Ahlswede:
Another diametric theorem in Hamming spaces: optimal group anticodes. 212-216 - Sachin Agarwal, Ari Trachtenberg:
Approximating the number of differences between remote sets. 217-221 - Hui Jin, Rajiv Laroia, Tom Richardson:
Superposition by Position. 222-226 - Suhas N. Diggavi, David N. C. Tse:
On opportunistic codes and broadcast codes with degraded message sets. 227-231 - Jacob Ziv, Neri Merhav:
On Context - Tree Prediction of Individual Sequences. 232-236 - Jan Poland:
Online Learning with Universal Model and Predictor Classes. 237-241 - Alon Orlitsky, Narayana P. Santhanam, Krishnamurthy Viswanathan, Junan Zhang:
Theoretical and Experimental Results on Modeling Low Probabilities. 242-246 - Daniel Marco, Michelle Effros:
A Partial Solution for Lossless Source Coding with Coded Side Information. 247-251 - Cheng Chang, Anant Sahai:
The error exponent with delay for lossless source coding. 252-256 - Ioannis Kontoyiannis:
Entropy Estimation: Simulation, Theory and a Case Study. 257 - Krishnan Eswaran, Michael Gastpar:
On The Significance Of Binning In A Scaling-law Sense. 258-262 - Emin Martinian, Martin J. Wainwright:
Low-density constructions for lossy compression, binning, and coding with side information. 263-264 - Luca G. Tallini, Samir Elmougy, Bella Bose:
On Hybrid ARQ Protocol schemes over the m( ≥ 2)-ary Asymmetric Channel. 265-269 - Vladimir D. Tonchev:
Code Synchronization, Cyclotomy, and Finite Geometry. 270-274 - Rogério Monteiro de Siqueira, Sueli I. Rodrigues Costa:
Upper bounds for a Commutative Group Code. 275-277 - Leonid A. Bassalygo, Stefan M. Dodunekov, Tor Helleseth, Victor A. Zinoviev:
On a new q-ary combinatorial analog of the binary Grey-Rankin bound and codes meeting this bound. 278-282 - Bartolomeu F. Uchôa Filho, Richard Demo Souza, Cecilio Pimentel:
On the Behavior of the Distance Spectrum of Convolutional Codes under a Minimal Trellis Complexity Measure. 283-287 - Chris T. K. Ng, J. Nicholas Laneman, Andrea J. Goldsmith:
The Role of SNR in Achieving MIMO Rates in Cooperative Systems. 288-292 - Laura Cottatellucci, Mérouane Debbah, Ralf R. Müller:
Linear Multiuser Detection for Asynchronous CDMA Systems: Chip Pulse Design and Time Delay Distribution. 293-297 - Jordi Diaz, Osvaldo Simeone, Oren Somekh, Yeheskel Bar-Ness:
Scaling Law of the Sum-Rate for Multi-Antenna Broadcast Channels with Deterministic or Selective Binary Feedback. 298-301 - Rui A. Costa, João Barros:
On the Capacity of Small-World Networks. 302-306 - Salim Y. El Rouayheb, Costas N. Georghiades, Alexander Sprintson:
Network Coding in Minimal Multicast Networks. 307-311 - Nicolas Macris:
On the relation between MAP and BP GEXIT functions of low density parity check codes. 312-316 - Ryoji Ikegaya, Kenta Kasai, Tomoharu Shibuya, Koichi Sakaniwa:
The Block Error Probability of Detailedly Represented Irregular LDPC Code Ensembles under Maximum Likelihood Decoding. 317-321 - Camilla Hollanti, Jyrki T. Lahtonen:
A New Tool: Constructing STBCs from Maximal Orders in Central Simple Algebras. 322-326 - David B. Smith, Leif W. Hanlen:
Novel Unitary Space-Time Signal Design. 327-331 - Joel B. Predd, Sanjeev R. Kulkarni, H. Vincent Poor:
Distributed Kernel Regression: An Algorithm for Training Collaboratively. 332-336 - Omolabake A. Adenle, William J. Fitzgerald:
Bayesian Model Selection for Independent Factor Analysis. 337-341 - Juan Miguel Medina, Bruno Cernuschi-Frías:
Random series in Lp(X, Σ , μ ) using Unconditional Basic Sequences: A result on almost sure almost everywhere convergence. 342-344 - Lei Zhou, Shidong Zhou, Yan Yao:
Non-coherent Mutual Information of the Multipath Rayleigh Fading Channel in the Low SNR Regime. 345-349 - Elwyn R. Berlekamp:
Combinatorial Games. 350 - Jorma Rissanen:
Information and Complexity in Statistical Modeling. 351
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-09-19 23:31 CEST 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:
