default search action
ITW 2011: Paraty, Brazil
- 2011 IEEE Information Theory Workshop, ITW 2011, Paraty, Brazil, October 16-20, 2011. IEEE 2011, ISBN 978-1-4577-0438-3
- Jean-Claude Belfiore:
Lattice codes for the compute-and-forward protocol: The flatness factor. 1-4 - Nirmal Fernando, Yi Hong
, Emanuele Viterbo
Flip-OFDM for optical wireless communications. 5-9 - Lakshmi Prasad Natarajan, K. Pavan Srinath, B. Sundar Rajan:
Generalized distributive law for ML decoding of STBCs. 10-14 - Yuxin Chen, Yonina C. Eldar, Andrea J. Goldsmith:
Approaching the capacity of sampled analog channels. 15-19 - Amin Emad, Jun Shen, Olgica Milenkovic:
Symmetric group testing and superimposed codes. 20-24 - Farzaneh Khajouei, Mahdy Zolghadr, Negar Kiyavash:
An algorithmic approach for finding deletion correcting codes. 25-29 - Frédérique E. Oggier, Anwitaman Datta
Self-Repairing Codes for distributed storage - A projective geometric construction. 30-34 - Yuichi Kaji:
The expected write deficiency of index-less flash codes and their improvement. 35-39 - Ryan Gabrys, Eitan Yaakobi, Lara Dolecek, Paul H. Siegel, Alexander Vardy
Non-binary WOM-codes for multilevel flash memories. 40-44 - Andrew Thangaraj
Quasicyclic MDS codes for distributed storage with efficient exact repair. 45-49 - Stefano Maranò
Embedding information flows into renewal traffic. 50-54 - Hervé Chabanne, Gérard D. Cohen, Jean-Pierre Flori, Alain Patey:
Non-malleable codes from the wire-tap channel. 55-59 - Igor Bjelakovic, Holger Boche, Jochen Sommerfeld:
Capacity results for compound wiretap channels. 60-64 - László Czap, Vinod M. Prabhakaran, Christina Fragouli, Suhas N. Diggavi:
Secret message capacity of erasure broadcast channels with feedback. 65-69 - Yanfei Yan, Cong Ling, Jean-Claude Belfiore:
Secrecy gain of trellis codes: The other side of the union bound. 70-74 - Naira Grigoryan, Ashot N. Harutyunyan
On multiple hypothesis testing with rejection option. 75-79 - K. Raj Kumar, Amir Hesam Salavati, Amin Shokrollahi:
Exponential pattern retrieval capacity with non-binary associative memory. 80-84 - Arash Einolghozati, Mohsen Sardari, Faramarz Fekri
Capacity of diffusion-based molecular communication with ligand receptors. 85-89 - Roman V. Belavkin
Mutation and optimal search of sequences in nested Hamming spaces. 90-94 - Paulo Rogério Scalassara
Voice pathology detection with predictable component analysis and wavelet decomposition model. 95-99 - Kumar Viswanatha, Emrah Akyol
A strictly improved achievable region for multiple descriptions using combinatorial message sharing. 100-104 - Kumar Viswanatha, Emrah Akyol
An optimal transmit-receive rate tradeoff in Gray-Wyner network and its relation to common information. 105-109 - Yiwei Song, Natasha Devroye:
A lattice compress-and-forward scheme. 110-114 - Peng Zhong, Mai Vu:
Decode-forward and compute-forward coding schemes for the two-way relay channel. 115-119 - Shurui Huang, Aditya Ramamoorthy:
An achievable region for the double unicast problem based on a minimum cut analysis. 120-124 - Hassan Tavakoli
Optimal rate for irregular LDPC codes in binary erasure channel. 125-129 - Roope Vehkalahti
Reducing complexity with less than minimum delay space-time lattice codes. 130-134 - Roope Vehkalahti
Diversity-multiplexing gain tradeoff: A tool in algebra? 135-139 - Ayan Sengupta, Siddhartha Brahma, Ayfer Özgür
Graph-based codes for Quantize-Map-and-Forward relaying. 140-144 - Luis Salamanca, Pablo M. Olmos, Juan José Murillo-Fuentes
MAP decoding for LDPC codes over the binary erasure channel. 145-149 - Lilya Budaghyan, Claude Carlet, Tor Helleseth:
On bent functions associated to AB functions. 150-154 - Branislav M. Popovic:
Quasi-orthogonal supersets. 155-159 - Khmaies Ouahada
Spectral shaping codes with even length permutation sequences. 160-164 - Daniel Panario
Ambiguity and deficiency of permutations from finite fields. 165-169 - José R. Ortiz-Ubarri, Oscar Moreno, Andrew Z. Tirkel
Three-dimensional periodic optical orthogonal code for OCDMA systems. 170-174 - Po-Ning Chen
Ultra-small block-codes for binary discrete memoryless channels. 175-179 - Anatoly Khina
State-dependent channels with composite state information at the encoder. 180-184 - François Simon:
On the capacity of noisy computations. 185-189 - Haim H. Permuter
Continuous-time directed information and its role in communication. 190-194 - Reza Khosravi-Farsani, Farokh Marvasti:
Capacity bounds for multiuser channels with non-causal channel state information at the transmitters. 195-199 - Thomas J. Riedl, Todd P. Coleman, Andrew C. Singer
Finite block-length achievable rates for queuing timing channels. 200-204 - Farzad Farhadzadeh, Sviatoslav Voloshynovskiy
Information-theoretic analysis of content based identification for correlated data. 205-209 - Anne-Maria Ernvall-Hytönen, Camilla Hollanti:
On the eavesdropper's correct decision in Gaussian and fading wiretap channels using lattice codes. 210-214 - Rosemberg Silva, Pierre-Louis Cayrel, Richard Lindner:
A lattice-based batch identification scheme. 215-219 - Antonio C. de A. Campello, Grasiele C. Jorge, Sueli I. R. Costa
Decoding q-ary lattices in the Lee metric. 220-224 - Marinês Guerreiro, Raul Antonio Ferraz, César Polcino Milies:
Minimal codes in binary abelian group algebras. 225-228 - Daniel Augot, Morgan Barbier, Alain Couvreur:
List-decoding of binary Goppa codes up to the binary Johnson bound. 229-233 - Giuliano Gadioli La Guardia:
Asymmetric quantum generalized Reed-Solomon codes. 234-236 - Kohtaro Tadaki:
Robustness of statistical mechanical interpretation of algorithmic information theory. 237-241 - Gianfranco L. Cariolaro, Alberto Vigato:
Helstrom's theory on quantum binary decision revisited. 242-246 - Franklin de Lima Marquezino
Quantum search algorithms on hierarchical networks. 247-251 - Mamdouh Abbara, Jean-Pierre Tillich:
Quantum turbo codes with unbounded minimum distance and excellent error-reducing performance. 252-256 - Eirik Rosnes:
Iterative soft decoding of binary linear codes using a generalized Tanner graph. 257-261 - Yuval Cassuto, Amin Shokrollahi:
On-line fountain codes for semi-random loss channels. 262-266 - H. V. Beltrão Neto, Werner Henkel
Multi-edge framework for unequal error protecting LT codes. 267-271 - Kaveh Mahdaviani, Masoud Ardakani, Chintha Tellambura:
Annotated raptor codes. 272-276 - Vahid Aref, Rüdiger L. Urbanke:
Universal rateless codes from coupled LT codes. 277-281 - Jean-Charles Faugère, Valérie Gauthier-Umaña
A distinguisher for high rate McEliece cryptosystems. 282-286 - Takenobu Seito, Junji Shikata:
Information-theoretically secure key-insulated key-agreement. 287-291 - Rosemberg Silva, Antonio C. de A. Campello, Ricardo Dahab
LWE-based identification schemes. 292-296 - Oleksiy J. Koval, Svyatoslav Voloshynovskiy
Identification in desynchronization channels. 297-301 - Felipe Cinelli Barbosa, Max H. M. Costa:
A tree construction method of nested cyclic codes. 302-305 - Fanny Parzysz, Mai Vu, François Gagnon
A half-duplex relay coding scheme optimized for energy efficiency. 306-310 - Samar Agnihotri, Sidharth Jaggi, Minghua Chen
Amplify-and-forward in wireless relay networks. 311-315 - Bryan Larish, George F. Riley:
An information theoretic approach for determining the minimum number of sensors in a wireless sensor network. 316-320 - Lucila Helena Allan Leskow, Reginaldo Palazzo Júnior:
Binary arithmetic coding for time-varying sources based on the Maskit boundary. 321-324 - Morteza Varasteh, Hamid Behroozi:
Optimal HDA codes for sending a Gaussian source over a Gaussian channel with bandwidth compression in the presence of an interference. 325-329 - Georg Böcherer, Rudolf Mathar:
Operating LDPC codes with zero shaping gap. 330-334 - H. V. Beltrão Neto, Werner Henkel
Multi-edge type unequal error protecting low-density parity-check codes. 335-339 - Dariush Divsalar, Lara Dolecek:
Ensemble analysis of pseudocodewords of protograph-based non-binary LDPC codes. 340-344 - Ludovic Danjean, David Declercq, Shiva Kumar Planjery, Bane Vasic:
On the selection of finite alphabet iterative decoders for LDPC codes on the BSC. 345-349 - David G. M. Mitchell, Roxana Smarandache, Daniel J. Costello Jr.:
Quasi-cyclic LDPC codes based on pre-lifted protographs. 350-354 - Dieter Duyck, Joseph Jean Boutros, Marc Moeneclaey:
Precoding for coded communication on block fading channels and cooperative communications. 355-359 - Alex Alvarado
High SNR bounds for the BICM capacity. 360-364 - J. Nicholas Laneman, Brian P. Dunn:
Communications overhead as the cost of constraints. 365-369 - Flávio du Pin Calmon, Muriel Médard, Michelle Effros:
Equivalent models for multi-terminal channels. 370-374 - Georg Tauböck
A maximum entropy theorem for complex-valued random vectors, with implications on capacity. 375-379 - João Paulo Carvalho Lustosa da Costa, Florian Roemer
Subspace based multi-dimensional model order selection in colored noise scenarios. 380-384 - Svyatoslav Voloshynovskiy
Sign-magnitude decomposition of mutual information with polarization effect in digital identification. 385-389 - Dominik Schulz, Jochen Seitz, João Paulo Carvalho Lustosa da Costa:
Widely linear SIMO filtering for hypercomplex numbers. 390-395 - Mohammad Ali Khojastepour, Alireza Salehi-Golsefidi, Sampath Rangarajan:
Towards an optimal beamforming algorithm for physical layer multicasting. 395-399 - Anatoly Khina
Incremental coding over MIMO channels. 400-404 - Jintai Ding:
Algebraic solvers for certain lattice-related problems. 405-409 - Vadim Lyubashevsky:
Search to decision reduction for the learning with errors over rings problem. 410-414 - Nicolas Sendrier:
The tightness of security reductions in code-based cryptography. 415-419 - Song-Nam Hong
Quantized compute and forward: A low-complexity architecture for distributed antenna systems. 420-424 - Nadia Fawaz
A converse for the wideband relay channel with physically degraded broadcast. 425-429 - Gerhard Kramer
On message lengths for noisy network coding. 430-431 - Hieu T. Do, Tobias J. Oechtering
Capacity bounds for the Z channel. 432-436 - Badri N. Vellambi
Communicating degraded message sets over multi-access channels with degraded encoder state information. 437-441 - Or Ordentlich, Uri Erez:
Interference alignment at finite SNR for time-invariant channels. 442-446 - Guy Bresler, Dustin Cartwright
Feasibility of interference alignment for the MIMO interference channel: The symmetric square case. 447-451 - Sibi Raj B. Pillai:
On the capacity of multiplicative multiple access channels with AWGN. 452-456 - Victoria Kostina
Fixed-length lossy compression in the finite blocklength regime: Gaussian source. 457-461 - Ebad Ahmed, Aaron B. Wagner:
Lossy source coding with Byzantine adversaries. 462-466 - Paul W. Cuff, Lei Zhao:
Coordination using implicit communication. 467-471 - Mikihiko Nishiara:
Achievability of maximum decoding rate on sequential coding. 472-475 - Mohsen Sardari, Ahmad Beirami, Faramarz Fekri
On the network-wide gain of memory-assisted source coding. 476-480 - Xiao Ma, Shancheng Zhao, Kai Zhang, Baoming Bai:
Kite codes over groups. 481-485 - Marcelo Muniz Silva Alves
A standard form for generator matrices with respect to the Niederreiter-Rosenbloom-Tsfasman metric. 486-489 - Jerry Anderson Pinheiro, Marcelo Firer:
MacWilliams-type identity in poset-block spaces. 490-494 - Francisco J. R. Ruiz, Fernando Pérez-Cruz
Zero-error codes for the noisy-typewriter channel. 495-497 - Qiwen Wang, Sidharth Jaggi, Shuo-Yen Robert Li:
Binary error correcting network codes. 498-502 - James S. Plank
XOR's, lower bounds and MDS codes for storage. 503-507 - Carl H. Heymann, Hendrik C. Ferreira
A Knuth-based RDS-minimizing multi-mode code. 508-512 - Zhongwei Si, Mattias Andersson, Ragnar Thobaben, Mikael Skoglund:
Rate-compatible LDPC convolutional codes for capacity-approaching hybrid ARQ. 513-517 - Eran Pisek, Dinesh Rajan, Joseph R. Cleveland:
Gigabit rate low-power LDPC decoder. 518-522 - Prasad Krishnan, B. Sundar Rajan:
On network coding for acyclic networks with delays. 523-527 - Christian Koller, Martin Haenggi
On the optimal block length for joint channel and network coding. 528-532 - Bernhard Haeupler
Optimality of network coding with buffers. 533-537 - Nima Torabkhani, Badri N. Vellambi
Exact modeling of the performance of random linear network coding in finite-buffer networks. 538-542 - João Luiz Rebelatto
Full-diversity network coding for two-user cooperative communications. 543-547 - Galen Reeves, Naveen Goela, Nebojsa Milosavljevic, Michael Gastpar:
A compressed sensing wire-tap channel. 548-552 - Mikko Vehkaperä
Analysis of MMSE estimation for compressive sensing of block sparse signals. 553-557 - A. Robert Calderbank, Sina Jafarpour, Maria Nastasescu:
Covering radius and the Restricted Isometry Property. 558-562 - Shweta Agrawal, Sriram Vishwanath:
Secrecy using compressive sensing. 563-567 - Ryosuke Matsushita, Toshiyuki Tanaka:
Critical compression ratio of iterative reweighted l1 minimization for compressed sensing. 568-572 - Abhinav Ganesan, Teja Damodaram Bavirisetti, Prasad Krishnan, B. Sundar Rajan:
A generalized network alignment for three-source three-destination multiple unicast networks with delays. 573-577 - Nikolaos Pappas
Relay-assisted multiple access with multi-packet reception capability and simultaneous transmission and reception. 578-582 - Ramanan Subramanian, Ingmar Land, Badri N. Vellambi
Error propagation and the achievable throughput-delay trade-off in wireless networks. 583-587 - Yash Deshpande, Sibi Raj B. Pillai, Bikash Kumar Dey:
On the sum capacity of multiaccess block-fading channels with individual side information. 588-592 - Matthew S. Nokleby, Behnaam Aazhang:
Unchaining from the channel: Cooperative computation over multiple-access channels. 593-597 - Nikolaos Pappas
Optimal utilization of a cognitive shared channel with a rechargeable primary source node. 598-602 - Neri Merhav:
Threshold effects in parameter estimation as phase transitions in statistical physics. 603-607 - Jorge F. Silva, Patricio Parada:
Sufficient conditions for the convergence of the Shannon differential entropy. 608-612 - Jorge F. Silva, Milan S. Derpich
Necessary and sufficient conditions for zero-rate density estimation. 613-617 - Daniel G. Silva
An immune-inspired information-theoretic approach to the problem of ICA over a Galois field. 618-622 - Kevin Luo, Ramy H. Gohary, Halim Yanikomeroglu
On the generalization of decode-and-forward and compress-and-forward for Gaussian relay channels. 623-627 - Mahdi Zamanighomi, Mohammad Javad Emadi, Farhad Shirani Chaharsooghi
Multiple access channel with correlated channel states and cooperating encoders. 628-632 - Terence H. Chan
2-Dimensional interval algorithm. 633-637 - Bernardo Machado David, Anderson C. A. Nascimento
Efficient fully simulatable oblivious transfer from the McEliece assumptions. 638-642 - Nicolás Carrasco, Jean-Marie Le Bars, Alfredo Viola:
Enumerative encoding of correlation immune Boolean functions. 643-647 - Carlos Aguilar Melchor, Philippe Gaborit, Julien Schrek:
A new zero-knowledge code based identification scheme with reduced communication. 648-652 - Siu-Wai Ho
On the separation of encryption and compression in secure distributed source coding. 653-657 - Ali Zibaeenejad
Key agreement in state-dependent channels with non-causal side information. 658-662 - Shrinivas Kudekar, Tom Richardson, Rüdiger L. Urbanke:
Existence and uniqueness of GEXIT curves via the Wasserstein metric. 663-667 - Michael Lentmaier, Gerhard P. Fettweis:
Coupled LDPC codes: Complexity aspects of threshold saturation. 668-672 - Amites Sarkar, Martin Haenggi
Percolation in the secrecy graph: Bounds on the critical probability and impact of power constraints. 673-677 - Joffrey Villard, Pablo Piantanida, Shlomo Shamai
Hybrid digital/analog schemes for secure transmission with side information. 678-682 - Filip Paluncic, Theo G. Swart
A note on non-binary multiple insertion/deletion correcting codes. 683-687 - Asie Abolpour, Mohammad-Reza Sadeghi
Extended bit-flipping algorithm for solving sparse linear systems of equations modulo p. 688-692 - V. C. da Rocha
New cyclically permutable codes. 693-697 - Amin Aminzadeh Gohari
Generating dependent random variables over networks. 698-702 - Yimin Pang, Thomas Honold:
Towards the capacity region of multiplicative linear operator broadcast channels. 703-707 - Yuanpeng Liu, Elza Erkip
Completion time in multi-access channel: An information theoretic perspective. 708-712 - Rafael F. Wyrembelski, Holger Boche:
Bidirectional broadcast channels with common and confidential messages. 713-717 - Fuchun Lin, Frédérique E. Oggier:
Secrecy gain of Gaussian wiretap codes from unimodular lattices. 718-722 - Chung Chan
Linear perfect secret key agreement. 723-726
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-01-02 18:24 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: