default search action
ITW 2003: Paris, France
- Proceedings 2003 IEEE Information Theory Workshop, ITW 2003, La Sorbonne, Paris, France, 31 March - 4 April, 2003. IEEE 2003, ISBN 0-7803-7799-0
- Gérard Battail:
Replication decoding revisited. 1-5 - Jun Xu, Shu Lin, Ian F. Blake:
On products of graphs for LDPC codes. 6-9 - Ralf Koetter, Alexander Vardy
:
A complexity reducing transformation in algebraic list decoding of Reed-Solomon codes. 10-13 - Ilya Dumer
On recursive decoding with sublinear complexity for Reed-Muller codes. 14-17 - Alexei Ashikhmin, Simon Litsyn:
Simple MAP decoding of first order Reed-Muller and Hamming codes. 18-21 - Dongning Guo, Sergio Verdú:
Replica analysis of large-system CDMA. 22-25 - Tarik Muharemovic, Behnaam Aazhang:
Robust slope region for wideband CDMA with multiple antennas. 26-29 - Sau-Hsuan Wu, Urbashi Mitra, C.-C. Jay Kuo
Performance analysis of a class of multistage DS-CDMA receivers for multipath channels. 30-33 - Ateet Kapur, Mahesh Kumar Varanasi:
Improved signal design for bandwidth efficient multiple access. 34-37 - Shlomo Shamai, Avi Steiner:
Single user broadcasting in a MIMO channel. 38-41 - Rinat Kashaev
Linear matrix modulators from group representation theory. 42-45 - Firouz Behnamfar, Fady Alajaji, Tamás Linder:
Performance analysis of MAP decoded space-time orthogonal block codes for non-uniform sources. 46-49 - Andrej Stefanov, Elza Erkip
Cooperative space-time coding for wireless networks. 50-53 - Mathini Sellathurai
Approaching near-capacity on a multi-antenna channel using multirate encoding and successive decoding receivers. 54-57 - Daniel J. J. Versfeld
A Reed-Solomon decoding algorithm for correcting bursts of erasures in real-time data in packet switched networks. 58-61 - Morteza Esmaeili:
On the structure of the binary (18, 9, 6) linear code. 62-65 - Marcel Fernandez, Miguel Soriano
A generalization of traceability codes using ideal-based codes. 66-69 - Loïc Barnault, David Declercq:
Fast decoding algorithm for LDPC over GF(2q). 70-73 - Yannick Saouter
Decoding M-binary turbo codes by the dual method. 74-77 - Carey Radebaugh, Ralf Koetter, Clint Powell:
Wheel codes: turbo-like codes on graphs of small order. 78-81 - Shirish S. Karande, Hayder Radha:
Partial Reed Solomon codes for erasure channels. 82-85 - Paul Cotae:
Distributive iterative method for minimizing generalized total square correlation of CDMA systems. 86-89 - Mérouane Debbah, Philippe Loubaton, Marc de Courville:
The spectral efficiency of linear precoders. 90-93 - Vincent K. N. Lau:
Optimal transmission design for MIMO block fading channels with feedback capacity constraint. 94-98 - Abdelkader Medles, Samuli Visuri, Dirk T. M. Slock:
On MIMO capacity for various types of partial channel knowledge at the transmitter. 99-102 - Aydin Sezgin
Analysis of mapping strategies for turbo-coded space-time block codes. 103-106 - Djordje Tujkovic:
Constituent code optimization for space-time turbo coded modulation based on distance spectrum and iterative decoding convergence. 107-110 - Christian Schlegel, Zhenning Shi:
Performance and complexity of CDMA iterative multiuser detection. 111-114 - Sándor Györi:
Signature coding over multiple access OR channel. 115-118 - Fanxin Zeng
An algorithm for cycle and add property of m-sequence. 119-122 - Simon Huettinger, Johannes B. Huber:
Performance estimation for concatenated coding schemes. 123-126 - Edward A. Ratzer, David J. C. MacKay:
Sparse low-density parity-check codes for channels with cross-talk. 127-130 - Marcus Marrow, Jack K. Wolf:
Iterative detection of 2-dimensional ISI channels. 131-134 - Jean Cardinal, Gilles Van Assche:
Construction of a shared secret key using continuous variables. 135-138 - Stelvio Cimato
Contrast optimal colored visual cryptography schemes. 139-142 - Amparo Fúster-Sabater, Dolores de la Guía-Martínez:
Simple cellular automata-based linear models for the shrinking generator. 143-146 - Claude Carlet:
On the algebraic thickness and non-normality of Boolean functions. 147-150 - Fabien Galand, Grigory Kabatiansky:
Information hiding by coverings. 151-154 - Benoît Libert, Jean-Jacques Quisquater:
A new identity based signcryption scheme from pairings. 155-158 - Joachim von zur Gathen, Amin Shokrollahi, Igor E. Shparlinski
An authentication scheme based on roots of sparse polynomials. 159-162 - Carlo Blundo
A flaw in a self-healing key distribution scheme. 163-166 - David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge L. Villar
An IND-CPA cryptosystem from Demytko's primitive. 167-170 - Jianhong Zhang, Xiaofeng Chen, Yumin Wang:
Security analysis of the improved group signature. 171-174 - Katsuyuki Okeya, Kouichi Sakurai:
A multiple power analysis breaks the advanced version of the randomized addition-subtraction chains countermeasure against side channel attacks. 175-178 - Eric Brier, Philippe Langevin:
Classification of Boolean cubic forms of nine variables. 179-182 - Catherine Lamy
Optimised constructions for variable-length error correcting codes. 183-186 - M. P. F. dos Santos, Willem A. Clarke, Hendrik C. Ferreira
Correction of insertions/deletions using standard convolutional codes and the Viterbi decoding algorithm. 187-190 - Gerhard Wunder, Simon Litsyn:
On the statistical distribution of the crest-factor of codes in OFDM transmission. 191-194 - Cenk Toker
Space-time block coding for four transmit antennas with closed loop feedback over frequency selective fading channels. 195-198 - Lu Zhao, Lutz Lampe, Johannes B. Huber:
Study of bit-interleaved coded space-time modulation with different labeling. 199-202 - Marco Chiani
The distribution of eigenvalues for correlated Wishart matrices applied to optimum combining with unequal power interferers and noise. 203-205 - Antoine O. Berthet
Space-time BICM versus space-time trellis code for MIMO block fading multipath AWGN channel. 206-209 - Badri Varadarajan, John R. Barry:
Optimization of full-rate full-diversity linear space-time codes using the union bound. 210-213 - G. David Forney Jr.:
Syndrome realizations of linear codes and systems. 214-217 - Pascal O. Vontobel
Factor graphs and dynamical electrical networks. 218-221 - Sekhar Chandra Tatikonda:
Convergence of the sum-product algorithm. 222-225 - Andrew Schaefer, Matthias Mörz, Joachim Hagenauer, Arvind Sridharan, Daniel J. Costello Jr.:
Analog rotating ring decoder for an LDPC convolutional code. 226-229 - James A. McGowan, Robert C. Williamson:
Loop removal from LDPC codes. 230-233 - Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein:
A coset weight count that proves that the simplex codes are not optimal for error correction. 234-237 - Trieu-Kien Truong, Yaotsu Chang, Irving S. Reed, Ruhua He, Chong-Dao Lee, Y. H. Chen:
Algebraic decoding of (79, 40, 15) quadratic residue code using inverse-free Berlekamp-Massey algorithm. 238-244 - Vitaly Skachek, Ron M. Roth:
Generalized minimum distance iterative decoding of expander codes. 245-248 - Ruoheng Liu, Predrag Spasojevic
Punctured turbo code ensembles. 249-252 - Neil J. A. Sloane, Ronald H. Hardin, Philippe Cara:
Spherical designs in four dimensions. 253-258 - YoungJu Choie
Codes, lattices and modular forms. 259-262 - Frédérique E. Oggier, Eva Bayer-Flückiger, Emanuele Viterbo
New algebraic constructions of rotated cubic lattice constellations for the Rayleigh fading channel. 263-266 - Jean-Claude Belfiore, Ghaya Rekaya:
Quaternionic lattices for space-time coding. 267-270 - Uri Erez, Simon Litsyn, Ram Zamir:
Lattices which are good for (almost) everything. 271-274 - Joachim Hagenauer, Norbert Görtz:
The turbo principle in joint source-channel coding. 275-278 - Michael Gastpar, Bixio Rimoldi:
Source-channel communication with feedback. 279-282 - Andres Kwasinski, Vinay Chande, Nariman Farvardin:
Delay-constrained joint source-channel coding using incremental redundancy with feedback. 283-286 - Zhe Wang, Xiaolin Wu:
MAP decoding of variable length code with substitution, insertion and deletion. 287-290 - Giuseppe Caire, Shlomo Shamai, Sergio Verdú:
A new data compression algorithm for sources with memory based on error correcting codes. 291-295 - Isabel Deslauriers, Jan Bajcsy:
Serial turbo coding for data compression and the Slepian-Wolf problem. 296-299 - Catherine Lamy, François-Xavier Bergot:
Lower bounds on the existence of binary error-correcting variable-length codes. 300-303 - Jun Muramatsu
Low density parity check matrices for coding of multiple access networks. 304-307 - Matteo Albanese, Arnaldo Spalvieri:
Reduced complexity ordered statistics decoding algorithm for MDS codes. 308-311 - Carlos Barrios Vicente, Jos H. Weber:
Dynamic Chase decoding algorithm. 312-315 - Olgica Milenkovic, Bane Vasic:
Asymptotic analysis of A* maximum-likelihood decoding with reliability reordering. 316-319 - Jiangxin Chen, Paul H. Siegel:
On the symmetric information rate of two-dimensional finite state ISI channels. 320-323 - Antonia M. Tulino
Capacity of antenna arrays with space, polarization and pattern diversity. 324-327 - Philippe Loubaton, Walid Hachem:
Asymptotic analysis of reduced rank Wiener filters. 328-331 - Ofir Shalvi, Naftali Sommer, Meir Feder:
Signal codes. 332-336 - Venceslav Kafedziski:
Linear coding of continuous-amplitude sources over SISO and MIMO FIR channels with ergodic coefficients. 337-340 - Adriel Kind, Alex J. Grant
Very-high rate space-time coding. 341-344 - Christoph Windpassinger, Robert F. H. Fischer:
Low-complexity near-maximum-likelihood detection and precoding for MIMO systems using lattice reduction. 345-348 - Xavier Mestre, Javier R. Fonollosa
Effect of fading correlation on the asymptotic open-loop and closed-loop capacity of MIMO systems. 349-352 - Eduard A. Jorswieck
Behavior of outage probability in MISO systems with no channel state information at the transmitter. 353-356 - Mohamed Oussama Damen, Hesham El Gamal:
On the diversity-vs-rate tradeoff in MIMO systems. 357-360
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-03 23:15 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: