default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDITW 2005: Rotorua, New Zealand
- Michael J. Dinneen, Ulrich Speidel, Desmond P. Taylor:
Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW 2005, Rotorua, New Zealand, August 29 - September 1, 2005. IEEE 2005 - Abdelaziz Amraoui, Rüdiger L. Urbanke, Andrea Montanari:
Finite-length scaling of irregular LDPC code ensembles. 6-10 - Irina E. Bocharova, Boris D. Kudryashov, Rolf Johannesson:
BEAST decoding - asymptotic complexity. 11-15 - Dhammika Bokolamulla, Tor M. Aulin:
Symbol-by-symbol detection of space-time coded continuous phase modulated signals over fast Rayleigh fading channels. 16-19 - Ling Cheng, Hendrik C. Ferreira
:
Rate-compatible path-pruned convolutional codes and their applications on channels with insertion, deletion and substitution errors. 20-25 - Gérard D. Cohen, Alexander Vardy:
Duality between packings and coverings of the Hamming space. 26-28 - Todd P. Coleman, Emin Martinian, Michelle Effros, Muriel Médard:
Interference management via capacity-achieving codes for the deterministic broadcast channel. 29-33 - Sueli I. R. Costa, Sandra A. Santos, João E. Strapasson:
Fisher information matrix and hyperbolic geometry. 34-36 - Gregory Cresp, Hans-Jürgen Zepernick, Hai Huyen Dam:
Periodic Oppermann sequences for spread spectrum systems. 37-41 - Justin Dauwels, Sascha Korl, Hans-Andrea Loeliger:
Steepest descent as message passing. 42-46 - Mostafa El-Khamy, Haris Vikalo, Babak Hassibi:
Bounds on the performance of sphere decoding of linear block codes. 47-51 - Ravi-Kiran Gopalan, Oliver M. Collins:
Asymptotically optimum detection for large wireless networks with fading. 52-57 - T. Aaron Gulliver, Matthew Geoffrey Parker:
The multivariate merit factor of a Boolean function. 58-62 - Sándor Györi:
Bounds on signature coding for fast frequency hopping with asynchronous access. 63-67 - Peter Harremoës:
Maximum entropy and the Edgeworth expansion. 68-71 - Tor Helleseth, Alexander Kholosha:
New monomial bent functions over the finite fields of odd characteristic. 72-76 - Robin Horan, Cen Jung Tjhai, Martin Tomlinson, Marcel Ambroze, Mohammed Zaki Ahmed:
A finite-field transform domain construction of binary low-density parity-check codes. 77-81 - David M. Horan, Richard A. Guinee:
Correlation analysis of random number sequences based on pseudo random binary sequence generation. 82-85 - Hua Hu, Duanyi Xu, Guosheng Qi:
Capacity of M-ary 2-D RLL constraints for optical recording channels. 86-89 - Jørn Justesen, Tom Høholdt, Johann Hjaltason:
Iterative list decoding. 90-93 - Vladimir A. Kazakov, Miguel Sánchez-Meraz:
A new method of the codeword reception of systematic codes. 94-97 - Michael Kerner, Ofer Amrani:
Viterbi algorithm motives in turbo decoding. 98-102 - Ramin Khalili, Kavé Salamatian:
On the capacity of erasure relay channel: multi-relay case. 103-107 - Naoto Kobayashi, Toshiyasu Matsushima, Shigeichi Hirasawa:
A note on a decoding algorithm of codes on graphs with small loops. 108-112 - Stavros Konstantinidis:
Computing the Levenshtein distance of a regular language. 113-116 - Moon Ho Lee, Kenneth Finlayson:
A simple element inverse jacket transform coding. 117-119 - Chih-Yin Lin, Chen-Hwa Song:
Generalized signature delegation algorithm. 120-122 - Zihuai Lin, Tor Aulin:
A new trellis source encoding method and its application on joint source and channel coding. 123-127 - Brian Lucena, Ioannis Kontoyiannis:
Filtering: the case for "noisier" data. 128-130 - Geert Van Meerbergen, Marc Moonen, Hugo De Man:
Soft-in soft-out Reed-Solomon decoding using critically subsampled filterbanks. 131-136 - Ralf R. Müller, Giuseppe Caire, Raymond Knopp:
Multiuser diversity in delay-limited cellular wideband systems. 137-141 - Arul D. Murugan, Hesham El Gamal, Mohamed Oussama Damen, Giuseppe Caire:
A unif0ed framework for tree search decoding: rediscovering sequential decoding. 142-146 - Masahiro Nakamura:
Ergodic theorems for algorithmically random sequences. 147-150 - Anders Nilsson, Tor M. Aulin:
The mutual information constellation. 151-156 - Yasutada Oohama:
Explicit expression of the interval algorithm for random number generation based on number systems. 157-161 - Rasika R. Perera, Tony S. Pollock, Thushara D. Abhayapala:
Mutual information of non-coherent Rayleigh fading channels with Gaussian input. 162-165 - Henry D. Pfister:
Finite-length analysis of a capacity-achieving ensemble for the binary erasure channel. 166-170 - Mohammad M. Rashid, Tsutomu Kawabata:
Theoretical analysis of a zero-redundancy estimator with a finite window for memoryless source. 171-175 - Bassem Sakkour:
Decoding of second order Reed-Muller codes with a large number of errors. 176-178 - Amir J. Salomon, Ofer Amrani:
On decoding product lattices. 179-182 - Hans Georg Schaathun, Marcel Fernandez-Muñoz:
Boneh-Shaw fingerprinting and soft decision decoding. 183-186 - Georg Schmidt, Vladimir R. Sidorenko, Martin Bossert:
Interleaved Reed-Solomon codes in concatenated code designs. 187-191 - Mathini Sellathurai, Tharmalingam Ratnarajah:
Achieving MIMO channel capacity using multirate layered space-time coding architectures. 192-196 - Gil I. Shamir, Kai Xie:
Design of non-systematic turbo codes for universal source controlled channel decoding. 197-201 - Gil I. Shamir:
Bounds on the entropy of patterns of I.I.D. sequences. 202-206 - Vladimir Sidorenko, Georg Schmidt, Ernst M. Gabidulin, Martin Bossert, Valentin B. Afanassiev:
On polyalphabetic block codes. 207-210 - Kazuyoshi Suzuki, Toshihiko Kashiyama, Eiji Fujiwara:
Complex M-spotty byte error control codes. 211-215 - Wojciech Szpankowski:
Analytic algorithmics, combinatorics, and information theory. 216 - Hayato Takahashi:
Bayesian approach to a definition of random sequences with respect to parametric models. 217-220 - Alberto Tarable, Sergio Benedetto:
Further results on mapping functions. 221-225 - Frederik Vanhaverbeke, Marc Moeneclaey:
Capacity loss in CDMA systems due to the constraint of scalability. 226-231 - Sergio Verdú:
Universal estimation of information measures. 232 - Paul M. B. Vitányi:
Universal similarity. 238-243 - Jos H. Weber, Khaled A. S. Abdel-Ghaffar:
Stopping set analysis for Hamming codes. 244-247 - Yongzhuang Wei, Yu-pu Hu:
A construction of resilient functions with satisfying synthetical cryptographic criteria. 248-252 - Ming Xiao, Tor M. Aulin:
Serially concatenated continuous phase modulation with low density generator matrix codes: property, optimization and performance analysis. 253-257 - Ming Xiao, Tor M. Aulin:
On performance bounds for serially concatenated codes with the general inner code and interleaver. 258-262 - Jia Yang, Ulrich Speidel:
String parsing-based similarity detection. 263-267 - Hidetoshi Yokoo:
Universal lossless data embedding without explicit compression. 268-272 - Lingqi Zeng, Lan Lan, Ying Yu Tai, Shu Lin, Khaled A. S. Abdel-Ghaffar:
Construction of LDPC codes for AWGN and binary erasure channels based on finite fields. 273-276 - Wufei Zhang, Christian Koller, Andrew W. Eckford, Daniel J. Costello Jr., Thomas E. Fuja, Gil I. Shamir:
Estimation and decoding strategies for channels with abruptly changing statistics. 277-
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-12-11 20:31 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:
