default search action
ITW 2001: Cairns, Australia
- Proceedings of the 2001 IEEE Information Theory Workshop, ITW 2001, Cairns International Hotel, Cairns, Australia, September 2-7, 2001. IEEE 2001, ISBN 0-7803-7119-4
- Brendan J. Frey, Ralf Koetter, Nemanja Petrovic:
"Codes" on images and iterative phase unwrapping. 9-11 - Brian M. Kurkoski, Paul H. Siegel, Jack K. Wolf:
Message-passing decoders and their application to storage systems. 12-13 - Jan L. Fan:
Constrained coding and soft iterative decoding. 18-20 - Krishna R. Narayanan, Jing Li, Costas N. Georghiades:
Product accumulate codes: properties and performance. 21-23 - Jilei Hou, Paul H. Siegel, Laurence B. Milstein, Henry D. Pfister:
Design of low-density parity-check codes for bandwidth efficient modulation. 24-26 - Ingmar Land, Peter A. Hoeher:
Using the mean reliability as a design and stopping criterion for turbo codes. 27-29 - Michael L. Honig, Yakun Sun:
Performance of iterative multiuser decision-feedback receivers. 30-32 - Joachim Hagenauer, Rainer Bauer:
The turbo principle in joint source channel decoding of variable length codes. 33-35 - Giuseppe Caire, Antonia M. Tulino, Ezio Biglieri:
Iterative multiuser joint detection and parameter estimation: a factor-graph approach. 36-38 - Ryuji Kohno, Robert Morelos-Zaragoza:
On interference cancellation and iterative techniques. 39-41 - Benjamin M. Zaidel, Shlomo Shamai, Sergio Verdú:
Random CDMA in the multiple cell uplink environment: the effect of fading on various receivers. 42-44 - Michael Moher:
Methods and limits of iterative multiuser decoding. 45-47 - Dinesh Rajan, Ashutosh Sabharwal, Behnaam Aazhang:
Impact of multiple access on uplink scheduling. 48-50 - Matthias Brehler, Mahesh K. Varanasi:
Low-dimensional spreading matrices for multiuser space-time modulation. 51-53 - Alexander Lampe, Marco Breiling:
Asymptotic analysis of widely linear MMSE multiuser detection-complex vs real modulation. 55-57 - Zhenning Shi, Christian Schlegel:
Joint decoding of serially concatenated coded CDMA: iterative schedule study. 58-60 - Claude Berrou, Michel Jézéquel, Catherine Douillard, Sylvie Kerouédan:
The advantages of non-binary turbo codes. 61-63 - Wei Xiang, S. Adrian Barbulescu, Steven S. Pietrobon:
Unequal error protection applied to JPEG image transmission using turbo codes. 64-66 - Lance C. Pérez:
Time varying convolutional codes revisited. 67-69 - Peter C. Massey, Daniel J. Costello Jr.:
New low-complexity turbo-like codes. 70-72 - Stéphane Y. Le Goff, Faisal Obaid Al-Ayyan:
On the design of bit-interleaved turbo-coded modulation. 73-75 - Li Ping, Baoming M. Bai, Kwok Wa Leung:
Concatenated tree codes and related schemes. 76-78 - Vladimir B. Balakirsky, A. J. Han Vinck:
Constructions of specific permutation codes for multi-user communication. 79-81 - Akisato Kimura, Tomohiko Uyematsu:
Weak variable-length Slepian-Wolf coding with linked encoders for mixed sources. 82-84 - Ganesan Umanesan, Eiji Fujiwara:
A class of systematic t/B-error correcting codes for semiconductor memory systems. 85-86 - Yasutada Oohama:
Coding for relay channels with confidential messages. 87-89 - Sarah J. Johnson, Steven R. Weller:
Regular low-density parity-check codes from combinatorial designs. 90-92 - Hiroshi Kamabe, Tatsunori Ichihashi:
Three directional spectral null constraints for two-dimensional storage devices. 93-95 - Phillip Benachour, Patrick Guy Farrell, Bahram Honary:
Direct sum construction of DC-free adder channel codes. 96-98 - Bahram Verdú:
Fading channels in the power limited regime. 99-100 - Pallav Sudarshan, Brian L. Hughes:
On the spectral efficiency of CDMA with multiple antennas. 101-103 - Predrag B. Rapajic:
Information capacity of a multipath mobile communication channel with large number of receiving antennas. 104-106 - Arnab Das, Prakash Narayan:
Capacities of time-varying multiple-access channels with side information. 107 - Nicolae Chiurtu, Bixio Rimoldi, Emre Telatar:
Dense multiple antenna systems. 108-109 - Amos Lapidoth, Stefan M. Moser:
On the fading number of multi-antenna systems. 110-111 - Zhihong Hong, Brian L. Hughes:
Robust space-time codes for time-selective fading. 112-114 - Yongzhe Xie, Costas N. Georghiades:
Some results on channel estimation and detection for space-time OFDM systems. 116-118 - Alex J. Grant, Christian Schlegel:
Differential turbo space-time coding. 120-122 - Jinhong Yuan, Branka Vucetic, Zhuo Chen, Welly Firmanto:
Design of space-time turbo TCM on fading channels. 123-125 - Hans-Andrea Loeliger:
Analog decoding and beyond. 126-127 - Matthias Mörz, Andrew Schaefer, Elke Offer, Joachim Hagenauer:
Analog decoders for high rate convolutional codes. 128-130 - Chris Winstead, Chris J. Myers, Christian Schlegel, Reid R. Harrison:
Analog decoding of product codes. 131-133 - John B. Anderson:
Transient and convergence properties of the BCJR decoder via a linear system model. 135-137 - Antoine Valembois, Marc P. C. Fossorier:
Generation of binary vectors that optimize a given weight function with application to soft-decision decoding. 138-140 - Osamu Uchida:
Maximum generating rate of the variable-length nonuniform random number. 141-143 - Ralf R. Müller:
A random matrix model for the antenna array channel with decaying power delay profile. 144-146 - Pascal O. Vontobel, Dieter-Michael Arnold:
An upper bound on the capacity of channels with memory and constraint input. 147-149 - Jens Baltersee, Gunnar Fock, Heinrich Meyr:
Achievable rate of MIMO channels with data-aided channel estimation. 150-152 - Fredrik Brännström, Tor M. Aulin, Lars K. Rasmussen:
Capacity considerations for trellis code multiple access systems. 153-155 - Yoram Gronich, Ram Zamir:
The effect of distortion on the MDL model. 156-157 - Mérouane Debbah, Walid Hachem, Philippe Loubaton, Marc de Courville:
MMSE analysis of certain large isometric random precoded systems. 158-160
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.