Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIEEE Transactions on Information Theory, Volume 47, 2001
Volume 47, Number 1, January 2001
- Vladimir I. Levenshtein:
Efficient reconstruction of sequences. 2-22
- Howard M. Heys
:
Information leakage of Feistel ciphers. 23-35 - Iwan M. Duursma:
Preparata codes through lattices. 36-44 - Norifumi Kamiya:
On algebraic soft-decision decoding algorithms for BCH codes. 45-58 - Ilya Dumer:
Soft-decision decoding using punctured codes. 59-71 - Chunxuan Ye, Raymond W. Yeung:
Some basic properties of fix-free codes. 72-87 - Andrew Turpin, Alistair Moffat:
On-line adaptive canonical prefix coding with bounded compression loss. 88-98 - Ram Zamir, Kenneth Rose:
Natural type selection in adaptive lossy compression. 99-111 - Takeshi Hashimoto:
Block-definition approaches to source coding with a fidelity citerion. 112-125 - En-Hui Yang, Zhen Zhang:
The redundancy of source coding with a fidelity criterion - Part II: Coding at a fixed rate level with unknown statistics. 126-145 - Zoran Cvetkovic, Martin Vetterli:
On simple oversampled A/D conversion in L2(IR). 146-154 - Helmut Bölcskei, Franz Hlawatsch:
Noise reduction in oversampled filter banks using predictive quantization. 155-172 - Muhammad K. Habib:
Digital representations of operators on band-limited random signals. 173-177 - Ioannis Ch. Paschalidis, Spyridon Vassilaras:
On the estimation of buffer overflow probabilities from measurements. 178-191 - Christopher King, Mary Beth Ruskai:
Minimal entropy of states emerging from noisy quantum channels. 192-209 - Uri Erez, Ram Zamir:
Error exponents of modulo-additive noise channels with side information at the transmitter. 210-218 - Andrea J. Goldsmith, Michelle Effros:
The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise. 219-240 - Pramod Viswanath, David N. C. Tse, Venkat Anantharam:
Asymptotically optimal water-filling in vector multiple-access channels. 241-267 - Ralf R. Müller:
Multiuser receivers for randomly spread signals: Fundamental limits with and without decision-feedback. 268-283 - Wei Luo, Anthony Ephremides:
Indecomposable error sequences in multiuser detection. 284-294 - Artur Russ, Mahesh K. Varanasi:
Noncoherent multiuser detection for nonlinear modulation over the Rayleigh-fading channel. 295-307 - Suhas N. Diggavi:
On achievable performance of spatial diversity fading channels. 308-325
- Alexey Fedotov, Boris Ryabko:
The estimated cost of a search tree on binary words. 326-329 - Po-Ning Chen, Fady Alajaji:
Csiszár's cutoff rates for arbitrary discrete sources. 330-338 - Zhiyi Chi:
The first-order asymptotic of waiting times with distortion between stationary processes. 338-347 - Chaoping Xing:
Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds. 347-352 - Warwick de Launey, Daniel M. Gordon:
A remark on Plotkin's bound. 352-355 - Tim Blackmore, Graham H. Norton:
On a family of Abelian codes and their state complexities. 355-361 - Alexander Barg, Jørn Justesen, Christian Thommesen:
Concatenated codes with fixed inner code and random outer code. 361-365 - Christian Weiß, Christian Bettstetter, Sven Riedel:
Code construction and decoding of parallel concatenated tail-biting codes. 366-386 - Jon-Lark Kim:
New extremal self-dual codes of lengths 36, 38, and 58. 386-393 - Vwani P. Roychowdhury, Farrokh Vatan:
Bounds for the weight distribution of weakly self-dual codes. 393-396 - YoungJu Choie, Namshik Kim:
The complete weight enumerator of type II codes over Z2m and Jacobi forms. 396-399 - Steven T. Dougherty, Keisuke Shiromoto:
Maximum distance codes over rings of order 4. 400-404 - Mitsuru Hamada:
The burst weight distributions of maximum-hamming-distance-separable codes. 404-406 - Anne Canteaut:
On the weight distributions of optimal cosets of the first-order Reed-Muller codes. 407-413 - Tsonka Stefanova Baicheva:
On the covering radius of ternary negacyclic codes with length up to 26. 413-416 - Alexander A. Davydov, Patric R. J. Östergård:
Linear codes with covering radius R = 2, 3 and codimension tR. 416-421 - Pascale Charpin, Aimo Tietäväinen, Victor A. Zinoviev:
On binary cyclic codes with codewords of weight three and binary sequences with the trinomial property. 421-425 - Thomas W. Cusick, Guang Gong:
A conjecture on binary sequences with the "Trinomial property". 426-427 - Cunsheng Ding, Tor Helleseth, Halvard Martinsen:
New families of binary sequences with optimal three-level autocorrelation. 428-433 - Bruce E. Moision, Alon Orlitsky, Paul H. Siegel:
On codes that avoid specified differences. 433-442 - Kenji Nakagawa:
On the optimal Markov chain of IS simulation. 442-446 - Wei Shi, Thomas W. Sun, Richard D. Wesel:
Quasi-convexity and optimal binary fusion for distributed detection with identical sensors in generalized Gaussian noise. 446-450 - George V. Moustakides, H. Vincent Poor:
On the relative error probabilities of linear multiuser detectors. 450-456 - Sundeep Rangan, Vivek K. Goyal:
Recursive consistent estimation with bounded noise. 457-464 - Yann Meurisse, Jean Pierre Delmas:
Bounds for sparse planar and volume arrays. 464-468 - Alfredo De Santis, Antonio Giorgio Gaggia, Ugo Vaccaro:
Bounds on entropy in a guessing game. 468-473 - Rudolf Ahlswede, Peter Löber:
Quantum data processing. 474-478
- Christoph Haslach, A. J. Han Vinck:
Correction to "A decoding algorithm with restrictions for array codes". 479
Volume 47, Number 2, February 2001
- Brendan J. Frey, Ralf Koetter, G. David Forney Jr., Frank R. Kschischang, Robert J. McEliece, Daniel A. Spielman:
Introduction to the special issue on codes on graphs and iterative algorithms. 493-497
- Frank R. Kschischang, Brendan J. Frey, Hans-Andrea Loeliger:
Factor graphs and the sum-product algorithm. 498-519 - G. David Forney Jr.:
Codes on graphs: Normal realizations. 520-548 - Stuart Geman, Kevin Kochanek:
Dynamic programming and the graphical representation of error-correcting codes. 549-568 - Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman:
Efficient erasure correcting codes. 569-584 - Michael Luby, Michael Mitzenmacher, Mohammad Amin Shokrollahi, Daniel A. Spielman:
Improved low-density parity-check codes using irregular graphs. 585-598 - Thomas J. Richardson, Rüdiger L. Urbanke:
The capacity of low-density parity-check codes under message-passing decoding. 599-618 - Thomas J. Richardson, Mohammad Amin Shokrollahi, Rüdiger L. Urbanke:
Design of capacity-approaching irregular low-density parity-check codes. 619-637 - Thomas J. Richardson, Rüdiger L. Urbanke:
Efficient encoding of low-density parity-check codes. 638-656 - Sae-Young Chung, Thomas J. Richardson, Rüdiger L. Urbanke:
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation. 657-670 - Hesham El Gamal, A. Roger Hammons Jr.:
Analyzing the turbo decoder using the Gaussian approximation. 671-686 - Matthew C. Davey, David J. C. MacKay:
Reliable communication over channels with insertions, deletions, and substitutions. 687-698 - Dakshi Agrawal, Alexander Vardy:
The turbo decoding algorithm and its phase trajectories. 699-722 - Assaf Sella, Yair Be'ery:
Convergence analysis of turbo decoding of product codes. 723-735 - Yair Weiss, William T. Freeman:
On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs. 736-744 - Paat Rusmevichientong, Benjamin Van Roy:
An analysis of belief propagation on the turbo decoding graph with Gaussian densities. 745-765 - Brendan J. Frey, Ralf Koetter, Alexander Vardy:
Signal-space characterization of iterative decoding. 766-781 - David Burshtein, Gadi Miller:
Expander graph arguments for message-passing algorithms. 782-790 - Li Ping, Keying Wu:
Concatenated tree codes: A low-complexity, high-performance approach. 791-799 - Li Ping, Xiaoling Huang, Nam Phamdo:
Zigzag codes and concatenated zigzag codes. 800-807 - Robert Michael Tanner:
Minimum-distance bounds by graph analysis. 808-821 - Amir H. Banihashemi, Frank R. Kschischang:
Tanner graphs for group block codes and lattices: Construction and complexity. 822-834
- Gilles Zémor:
On expander codes. 835-837 - Hans-Andrea Loeliger, Felix Lustenberger, Markus Helfenstein, Felix Tarköy:
Probability propagation and decoding in analog VLSI. 837-843 - Andrew P. Worthen, Wayne E. Stark:
Unified design of iterative receivers using factor graphs. 843-849
Volume 47, Number 3, March 2001
- 2000 Information theory society paper award. IEEE Trans. Inf. Theory 47(3): 857 (2001)
- Yonina C. Eldar, G. David Forney Jr.:
On quantum detection and the square-root measurement. 858-872 - Alexander J. Grant, Bixio Rimoldi, Rüdiger L. Urbanke, Philip A. Whiting:
Rate-splitting multiple access for discrete memoryless channels. 873-890 - Mehdi Alasti, Kamran Sayrafian-Pour, Anthony Ephremides, Nariman Farvardin:
Multiple description coding in networks with congestion problem. 891-902 - Alon Orlitsky, James R. Roche:
Coding for computing. 903-917 - Luis A. Lastras, Toby Berger:
All sources are nearly successively refinable. 918-926 - Masayuki Goto, Toshiyasu Matsushima, Shigeichi Hirasawa:
An analysis of the difference of code lengths between two-step codes based on MDL principle and Bayes codes. 927-944 - Onur G. Guleryuz, Michael T. Orchard:
On the DPCM compression of Gaussian autoregressive sequences. 945-956 - Dennis Hui, David L. Neuhoff:
Asymptotic analysis of optimal fixed-rate uniform scalar quantization. 957-977 - Haralabos C. Papadopoulos, Gregory W. Wornell, Alan V. Oppenheim:
Sequential signal encoding from noisy measurements using quantizers with dynamic bias control. 978-1002 - Sony Akkarakaran, P. P. Vaidyanathan:
Results on principal component filter banks: Colored noise suppression and existence issues. 1003-1020 - Mamoru Hoshi, Te Sun Han:
Interval algorithm for homophonic coding. 1021-1031 - Jovan Dj. Golic:
Edit distances and probabilities for correlation attacks on clock-controlled combiners with memory. 1032-1041 - Jessica Staddon, Douglas R. Stinson, Ruizhong Wei:
Combinatorial properties of frameproof and traceability codes. 1042-1049 - Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:
Estimates of the distance distribution of codes and designs. 1050-1061 - Qi Wang, Lei Wei:
Graph-based iterative decoding algorithms for parity-concatenated trellis codes. 1062-1074 - Donald Geman, Bruno Jedynak:
Model-based classification trees. 1075-1082 - Lifang Li, Andrea J. Goldsmith:
Capacity and optimal resource allocation for fading broadcast channels - Part I: Ergodic capacity. 1083-1102 - Lifang Li, Andrea J. Goldsmith:
Capacity and optimal resource allocation for fading broadcast channels - Part II: Outage capacity. 1103-1127 - Junshan Zhang, Edwin K. P. Chong, David N. C. Tse:
Output MAI distributions of linear MMSE multiuser receivers in DS-CDMA systems. 1128-1144 - Predrag Spasojevic, Costas N. Georghiades:
Complementary sequences for ISI channel estimation. 1145-1152 - Younggyun Kim, Jaekyun Moon:
Signal space detection for recording channels with jitter noise. 1153-1165
- Ron M. Roth, Paul H. Siegel, Jack K. Wolf:
Efficient coding schemes for the hard-square model. 1166-1176 - Andrew Thangaraj, Steven W. McLaughlin:
Quantum codes from cyclic codes over GF(4m). 1176-1178 - Markus Grassl:
New binary codes from a chain of cyclic codes. 1178-1181 - Ruhua He, Irving S. Reed, Trieu-Kien Truong, Xuemin Chen:
Decoding the (47, 24, 11) quadratic residue code. 1181-1186 - Antonio Cossidente, Alessandro Siciliano:
A geometric construction of an optimal [67, 9, 30] binary code. 1187-1189 - Peter Kazakov:
Fast calculation of the number of minimum-weight words of CRC codes. 1190-1195 - Victor V. Zyablov, Sergo Shavgulidze, Rolf Johannesson:
On the error exponent for woven convolutional codes with inner warp. 1195-1199 - Pål K. Frenger, Pål Orten, Tony Ottosson:
Comments and additions to recent papers on new convolutional codes. 1199-1201 - Tolga M. Duman, Erozan M. Kurtas:
Performance bounds for high rate linear codes over partial-response channels. 1201-1205 - Robert J. McEliece, Claude Le Dantec, Philippe Piret:
Permutations preserving divisibility. 1206-1207 - Pierre Loidreau, Nicolas Sendrier:
Weak keys in the McEliece public-key cryptosystem. 1207-1211 - Daniele Micciancio:
The hardness of the closest vector problem with preprocessing. 1212-1215 - Yuliang Zheng, Xian-Mo Zhang:
On plateaued functions. 1215-1223 - Bruce J. McKenzie, Timothy C. Bell:
Compression of sparse matrices by blocked rice coding. 1223-1230 - Amir Dembo, Ioannis Kontoyiannis:
Critical behavior in lossy source coding. 1230-1236 - Paolo Carbone, Dario Petri:
Marginal probability density function of granular quantization error in uniform quantizers. 1237-1242 - Houcem Gazzah, Phillip A. Regalia, Jean Pierre Delmas:
Asymptotic eigenvalue distribution of block Toeplitz matrices and application to blind SIMO channel identification. 1243-1251 - Yariv Ephraim, William J. J. Roberts:
On preprocessing for mismatched classification of Gaussian signals. 1251-1256 - Yi Li, Philip M. Long, Aravind Srinivasan:
The one-inclusion graph algorithm is near-optimal for the prediction model of learning. 1257-1261
Volume 47, Number 4, May 2001
- Ezio Biglieri, Giuseppe Caire, Giorgio Taricco:
Limiting performance of block-fading channels with multiple antennas. 1273-1289 - Ibrahim C. Abou-Faycal, Mitchell D. Trott, Shlomo Shamai:
The capacity of discrete-time memoryless Rayleigh-fading channels. 1290-1301 - Shlomo Shamai, Sergio Verdú:
The impact of frequency-flat fading on the spectral efficiency of CDMA. 1302-1327 - Stephen V. Hanly, David N. C. Tse:
Resource pooling and effective bandwidths in CDMA networks with multiuser receivers and spatial diversity. 1328-1351 - Eugene Visotsky, Upamanyu Madhow:
Noncoherent multiuser detection for CDMA systems with nonlinear modulation: A non-Bayesian approach. 1352-1367 - Qing Yan, Rick S. Blum:
Distributed signal detection under the Neyman-Pearson criterion. 1368-1377 - Xiang-Gen Xia:
Dynamic range of the detectable parameters for polynomial phase signals using multiple-lag diversities in high-order ambiguity functions. 1378-1384 - Michael L. Stein:
Local stationarity and simulation of self-affine intrinsic random functions. 1385-1390 - Richard G. Baraniuk, Patrick Flandrin, Augustus J. E. M. Janssen, Olivier J. J. Michel:
Measuring time-Frequency information content using the Rényi entropies. 1391-1409 - Yossef Steinberg, Neri Merhav:
Identification in the presence of side information with application to watermarking. 1410-1422 - Brian Chen, Gregory W. Wornell:
Quantization index modulation: A class of provably good methods for digital watermarking and information embedding. 1423-1443 - Navin Kashyap,