IEEE Transactions on Information Theory, Volume 38, 1992

Volume 38, Number 1, January 1992

• Roger S. Cheng, Sergio Verdú:
  The effect of asynchronism on the total capacity of Gaussian multiple-access channels. 2-13
  
• Te Sun Han, Sergio Verdú:
  New results in the theory of identification via channels. 14-25
  
• Ta-Hsin Li:
  Blind identification and deconvolution of linear systems driven by binary random sequences. 26-38
  
• Patrick A. Kelly, William L. Root:
  Stability in linear estimation. 39-49
  
• Emily C. Martin, H. Vincent Poor:
  On the asymptotic efficiencies of robust detectors. 50-60
  
• Jacob Ziv, Neri Merhav:
  Estimating the number of states of a finite-state source. 61-65
  
• Eli Plotnik, Marcelo J. Weinberger, Jacob Ziv:
  Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm. 66-72
  
• Hidetoshi Yokoo:
  Improved variations relating the Ziv-Lempel and Welch-type algorithms for sequential data compression. 73-81
  
• Franz Hlawatsch:
  Regularity and unitarity of bilinear time-frequency signal representations. 82-94
  
• Michael Unser, Akram Aldroubi, Murray Eden:
  Polynomial spline signal approximations: Filter design and asymptotic equivalence with Shannon's sampling theorem. 95-103
  
• Philippe Delsarte, Yves V. Genin:
  On a generalization of the Szegö-Levinson recurrence and its application in lossless inverse scattering. 104-110
  
• Jørn Justesen, Knud J. Larsen, Helge Elbrønd Jensen, Tom Høholdt:
  Fast decoding of codes from algebraic plane curves. 111-119
  
• Markus Antweiler, Leopold Bömer:
  Complex sequences over GF(p^M) with a two-level autocorrelation function and a large linear span. 120-130
  

• Peter H. A. Vogel:
  On the rate distortion function of sources with incomplete statistics. 131-135
  
• Neri Merhav, David L. Neuhoff:
  Variable-to-fixed length codes provide better large deviations performance than fixed-to-variable length codes. 135-140
  
• Cheng-Chang Lu, James George Dunham:
  A universal model based on minimax average divergence. 140-144
  
• Dietrich Manstetten:
  Tight bounds on the redundancy of Huffman codes. 144-151
  
• Zhongxing Ye, Toby Berger:
  A new method to estimate the critical distortion of random fields. 152-157
  
• Elisabeth Gassiat, Fabrice Monfront, Yves Goussard:
  On simultaneous signal estimation and parameter identification using a generalized likelihood approach. 157-162
  
• Moula Cherikh, Paul B. Kantor:
  Counterexamples in distributed detection. 162-165
  
• Leandros Tassiulas, Anthony Ephremides:
  Jointly optimal routing and scheduling in packet radio networks. 165-168
  
• Augustus J. E. M. Janssen:
  The Zak transform and some counterexamples in time-frequency analysis. 168-171
  
• Xiaolin Wu:
  On convergence of Lloyd's method I. 171-174
  
• David Hertz:
  Simple bounds on the extreme eigenvalues of Toeplitz matrices. 175-176
  
• Yong Liu, Steven D. Blostein:
  Optimality of the sequential probability ratio test for nonstationary observations. 177-182
  
• Ljubomir J. Buturovic:
  On the minimal dimension of sufficient statistics. 182-186
  
• Carl W. Helstrom:
  Distribution of the sum of two sine waves and Gaussian noise. 186-191
  
• Harold N. Ward:
  A bound for divisible codes. 191-194
  
• Zhen Zhang, Chiaming Lo:
  Lower bounds on t[n, k] from linear inequalities. 194-197
  
• Zhi Chen, Pingzhi Fan, Jin Fan:
  On the constructions of multiple-burst error-correcting codes. 197-200
  
• Khaled A. S. Abdel-Ghaffar:
  On unit constraint-length convolutional codes. 200-206
  
• Patric R. J. Östergård:
  Further results on (k, t)-subnormal covering codes. 206-210
  
• Jitendra K. Tugnait:
  Comments on 'New criteria for blind deconvolution of nonminimum phase systems (channels)'. 210-213
  
• Ofir Shalvi, Ehud Weinstein: Authors' Reply to Comments on 'New criteria for blind deconvolution of nonminimum phase systems (channels)'. 212-
• John T. Barnett, Benjamin Kedem: Authors' Reply to Comments on 'Zero-crossing rates of functions of Gaussian processes'. 213-
• Gary L. Wise:
  Comments on 'Zero-crossing rates of functions of Gaussian processes'. 213-
  

• Ramesh R. Rao: Review of 'Computer Communications: A First Course' (Walrand, J.; 1991). 214-

Volume 38, Number 2, March 1992

• Frank R. Kschischang, Subbarayan Pasupathy:
  Some ternary and quaternary codes and associated sphere packings. 227-246
  
• Tjalling J. Tjalkens, Frans M. J. Willems:
  A universal variable-to-fixed length source code based on Lawrence's algorithm. 247-253
  
• Hossam M. H. Shalaby, Adrian Papamarcou:
  Multiterminal detection with zero-rate data compression. 254-267
  
• Ping Wah Wong, Jack Koplowitz:
  Chain codes and their linear reconstruction filters. 268-280
  
• G. David Forney Jr.:
  Trellis shaping. 281-300
  
• M. Vedat Eyuboglu, G. David Forney Jr.:
  Trellis precoding: Combined coding, precoding and shaping for intersymbol interference channels. 301-314
  
• Jorma Rissanen, Terry P. Speed, Bin Yu:
  Density estimation by stochastic complexity. 315-323
  
• Hisashi Ito, Shun-ichi Amari, Kingo Kobayashi:
  Identifiability of hidden Markov information sources and their minimum degrees of freedom. 324-333
  
• José M. F. Moura, Nikhil Balram:
  Recursive structure of noncausal Gauss-Markov random fields. 334-354
  
• Peter Willett, Douglas J. Warren:
  The suboptimality of randomized tests in distributed and quantized detection systems. 355-361
  
• Yeheskel E. Dallal, Shlomo Shamai:
  Performance bounds for noncoherent detection under Brownian phase noise. 362-379
  
• Marcelo J. Weinberger, Jacob Ziv, Abraham Lempel:
  On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences. 380-385
  
• Georgios B. Giannakis, Michail K. Tsatsanis:
  A unifying maximum-likelihood view of cumulant and polyspectral measures for non-Gaussian signal classification and estimation. 386-406
  
• Renato M. Capocelli, Alfredo De Santis, Luisa Gargano, Ugo Vaccaro:
  On the construction of statistically synchronizable codes. 407-414
  

• Thomas R. Fischer, Min Wang:
  Entropy-constrained trellis-coded quantization. 415-426
  
• Thomas R. Fischer:
  On the rate-distortion efficiency of subband coding. 426-428
  
• Ram Zamir, Meir Feder:
  On universal quantization by randomized uniform/lattice quantizers. 428-436
  
• Meir Feder:
  A note on the competitive optimality of the Huffman code. 436-439
  
• Renato M. Capocelli, Alfredo De Santis:
  On the redundancy of optimal codes with limited word length. 439-445
  
• Michael R. Frey:
  Capacity of the L-p, norm-constrained Poisson channel. 445-450
  
• Kurt L. Kosbar, Andreas Polydoros:
  A lower-bound for the error-variance of maximum-likelihood delay estimates of discontinuous pulse waveforms. 451-457
  
• John B. Hampshire II, John W. Strohbehn:
  Tobit maximum-likelihood estimation for stochastic time series affected by receiver saturation. 457-469
  
• Guillermo E. Atkin, Ramon A. Khalona:
  Steiner system signal sets over the Gaussian channel. 469-472
  
• Gregory Poltyrev:
  Coding for a degraded memory under a partial modification of records. 473-477
  
• François Rodier:
  On the spectra of the duals of binary BCH codes of designed distance delta=9. 478-479
  
• Torleiv Kløve:
  Optimal codes for error detection. 479-489
  
• H. Shahri, Kenneth K. Tzeng:
  On error-and-erasure decoding of cyclic codes. 489-496
  
• Vanessa R. Job:
  M-adic residue codes. 496-501
  
• Han-Ping Tsai:
  Existence of certain extremal self-dual codes. 501-504
  
• Arne Dür:
  A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes. 504-509
  
• Noga Alon, Jehoshua Bruck, Joseph Naor, Moni Naor, Ron M. Roth:
  Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. 509-516
  
• Dieter Schomaker, Michael Wirtz:
  On binary cyclic codes of odd lengths from 101 to 127. 516-518
  
• Juriaan Simonis: On generator matrices of codes. 516-
• Zhi Chen, Pingzhi Fan, Jin Fan:
  Disjoint difference sets, difference triangle sets, and related codes. 518-522
  

• Gregory J. Pottie: Review of 'Introduction to Trellis-Coded Modulation with Applications' (Biglieri, E., et al.; 1991). 523-528

• Ingrid Daubechies, Stéphane Mallat, Alan S. Willsky: Introduction to the special issue on wavelet transforms and multiresolution signal analysis. 529-532

• Jelena Kovacevic, Martin Vetterli:
  Nonseparable multidimensional perfect reconstruction filter banks and wavelet bases for Rⁿ. 533-555
  
• Karlheinz Gröchenig, W. R. Madych:
  Multiresolution analysis, Haar bases, and self-similar tilings of Rⁿ. 556-568
  
• Olivier Rioul, Pierre Duhamel:
  Fast algorithms for discrete and continuous wavelet transforms. 569-586
  
• Eero P. Simoncelli, William T. Freeman, Edward H. Adelson, David J. Heeger:
  Shiftable multiscale transforms. 587-607
  
• Niels Juul Munch:
  Noise reduction in tight Weyl-Heisenberg frames. 608-616
  
• Stéphane Mallat, Wen Liang Hwang:
  Singularity detection and processing with wavelets. 617-643
  
• Nathalie Delprat, Bernard Escudié, Philippe Guillemain, Richard Kronland-Martinet, Philippe Tchamitchian, Bruno Torrésani:
  Asymptotic wavelet and Gabor analysis: Extraction of instantaneous frequencies. 644-664
  
• Benjamin Friedlander, Boaz Porat:
  Performance analysis of transient detectors based on a class of linear data transforms. 665-673
  
• Roland G. Wilson, Andrew D. Calway, Edward R. S. Pearson:
  A generalized wavelet transform for Fourier analysis: The multiresolution Fourier transform and its application to image and audio signal analysis. 674-690
  
• Alan C. Bovik, Nanda Gopal, Tomas Emmoth, Alfredo Restrepo:
  Localized measurement of emergent image frequencies by Gabor wavelets. 691-712
  
• Ronald R. Coifman, M. Victor Wickerhauser:
  Entropy-based algorithms for best basis selection. 713-718
  
• Ronald A. DeVore, Björn D. Jawerth, Bradley J. Lucier:
  Image compression through wavelet transform coding. 719-746
  
• Ahmed H. Tewfik, Deepen Sinha, Paul Jorgensen:
  On the optimal choice of a wavelet for signal representation. 747-765
  
• Michèle Basseville, Albert Benveniste, Kenneth C. Chou, Stuart A. Golden, Ramine Nikoukhah, Alan S. Willsky:
  Modeling and estimation of multiresolution stochastic processes. 766-784
  
• Gregory W. Wornell, Alan V. Oppenheim:
  Wavelet-based representations for a class of self-similar signals with application to fractal modulation. 785-800
  
• Pierre Moulin, Joseph A. O'Sullivan, Donald L. Snyder:
  A method of sieves for multiresolution spectrum estimation and radar imaging. 801-813
  
• André Barbé:
  A level-crossing-based scaling dimensionality transform applied to stationary Gaussian processes. 814-823
  
• Xiaowei Yang, Kuansan Wang, Shihab A. Shamma:
  Auditory representations of acoustic signals. 824-839
  
• Dennis M. Healy Jr., John B. Weaver:
  Two applications of wavelet transforms in magnetic resonance imaging. 840-860
  

• Peder A. Olsen, Kristian Seip:
  A note on irregular discrete wavelet transforms. 861-863
  
• Michael Unser, Akram Aldroubi, Murray Eden:
  On the asymptotic convergence of B-spline wavelets to Gabor functions. 864-872
  
• Hans Volkmer:
  On the regularity of wavelets. 872-876
  
• David Colella, Christopher Heil:
  The characterization of continuous, four-coefficient scaling functions and wavelets. 876-881
  
• Gilbert G. Walter:
  A sampling theorem for wavelet subspaces. 881-884
  
• Augustus J. E. M. Janssen:
  The Smith-Barnwell condition and nonnegative scaling functions. 884-886
  
• Langford B. White:
  The wide-band ambiguity function and Altes' Q-distribution: Constrained synthesis and time-scale filtering. 886-892
  
• Mordechai Frisch, Hagit Messer:
  The use of the wavelet transform in the detection of an unknown transient signal. 892-897
  
• Philippe Delsarte, Benoit M. Macq, Dirk T. M. Slock:
  Signal-adapted multiresolution transform for image coding. 897-904
  
• Ahmed H. Tewfik, M. Kim:
  Correlation structure of the discrete wavelet coefficients of fractional Brownian motion. 904-909
  
• Patrick Flandrin:
  Wavelet analysis and synthesis of fractional Brownian motion. 910-917
  
• Shubha Kadambe, Gloria Faye Boudreaux-Bartels:
  Application of the wavelet transform for pitch detection of speech signals. 917-924
  

Volume 38, Number 3, May 1992

• Jiantian Wu, Daniel J. Costello Jr.:
  New multilevel codes over GF(q). 933-939
  
• Nguyen Q. A, László Györfi, James L. Massey:
  Constructions of binary constant-weight cyclic codes and cyclically permutable codes. 940-949
  
• Jørn M. Jensen:
  Cyclic concatenated codes with constacyclic outer codes. 950-959
  
• Daniel Augot, Pascale Charpin, Nicolas Sendrier:
  Studying the locator polynomials of minimum weight codewords of BCH codes. 960-973
  
• Irving S. Reed, Trieu-Kien Truong, Xuemin Chen, Xiaowei Yin:
  The algebraic decoding of the (41, 21, 9) quadratic residue code. 974-986
  
• John B. Anderson:
  Sequential decoding based on an error criterion. 987-1001
  
• Marcelo J. Weinberger, Abraham Lempel, Jacob Ziv:
  A sequential algorithm for the universal coding of finite memory sources. 1002-1014
  
• Ning He, Federico Kuhlmann, Andres Buzo:
  Multiloop sigma-delta quantization. 1015-1028
  
• Timo Koski, Stamatis Cambanis:
  On the statistics of the error in predictive coding for stationary Ornstein-Uhlenbeck processes. 1029-1040
  
• Michael L. Honig, Kenneth Steiglitz:
  Maximizing the output energy of a linear channel with a time- and amplitude-limited input. 1041-1052
  
• Salvatore D. Morgera:
  The role of abstract algebra in structured estimation theory. 1053-1065
  
• Rick S. Blum, Saleem A. Kassam:
  Optimum distributed detection of weak signals in dependent sensors. 1066-1079
  
• Sawasd Tantaratana, Asis Nasipuri:
  Two-stage Wilcoxon detectors using conditional tests. 1080-1090
  
• Eimear M. Goggin:
  Convergence of filters with applications to the Kalman-Bucy case. 1091-1100
  
• Serdar Boztas, Roger Hammons, P. Vijay Kumar:
  4-phase sequences with near-optimum correlation properties. 1101-1113
  

• Santosh S. Venkatesh:
  Robustness in neural computation: Random graphs and sparsity. 1114-1119
  
• A. Robert Calderbank, Matthew Klimesh:
  Balanced codes and nonequiprobable signaling. 1119-1122
  
• John F. Humphreys:
  Algebraic decoding of the ternary (13, 7, 5) quadratic residue code. 1122-1125
  
• Gui Liang Feng, Kenneth K. Tzeng, Victor K.-W. Wei:
  On the generalized Hamming weights of several classes of cyclic codes. 1125-1130
  
• Albert M. Roseiro, Jonathan L. Hall, Joseph E. Adney, Marvin Siegel:
  The trace operator and redundancy of Goppa codes. 1130-1133
  
• Tor Helleseth, Torleiv Kløve, Øyvind Ytrehus:
  Generalized Hamming weights of linear codes. 1133-1140
  
• Xing Chao-Ping:
  When are two geometric Goppa codes equal? 1140-1142
  
• Dusan B. Jevtic:
  Disjoint uniquely decodable codebooks for noiseless synchronized multiple-access adder channels generated by integer sets. 1142-1146
  
• Tsutomu Kawabata, Raymond W. Yeung:
  The structure of the I-measure of a Markov chain. 1146-1149
  
• T. Aaron Gulliver:
  Serf-reciprocal polynomials and generalized Fermat numbers. 1149-1154
  
• Klaus Huber:
  Solving equations in finite fields and some results concerning the structure of GF(p^m). 1154-1162
  
• Khaled Ben Letaief, John S. Sadowsky:
  Computing bit-error probabilities for avalanche photodiode receivers by large deviations theory. 1162-1169
  
• Peter F. Swaszek:
  Unrestricted multistage vector quantizers. 1169-1174
  
• Dimitris Nicolas Politis:
  Moving average processes and maximum entropy. 1174-1177
  
• N. Parker Willis, Yoram Bresler:
  Norm variance of minimax interpolation. 1177-1181
  
• Ron M. Roth: Author's Reply to Comments on 'Maximum-rank array codes and their application to crisscross error correction'. 1183-
• Ernst M. Gabidulin:
  Comments on 'Maximum-rank array codes and their application to crisscross error correction'. 1183-
  
• Tuvi Etzion: Correction to 'New lower bounds for asymmetric and unidirectional codes' (Nov 91 1696-1704). 1183-
• Takeshi Hashimoto:
  Correction to 'Source coding for average rate and average distortion: A new variable-length coding theorems' (Nov 83 785-792). 1184-1185
  

Volume 38, Number 4, July 1992

• Eytan Modiano, Anthony Ephremides:
  Communication complexity of secure distributed computation in the presence of noise. 1193-1202
  
• Peter Vanroose, Edward C. van der Meulen:
  Uniquely decodable codes for deterministic relay channels. 1203-1212
  
• Brian H. Marcus, Ron M. Roth:
  Improved Gilbert-Varshamov bound for constrained systems. 1213-1221
  
• Carlos J. Moreno, Oscar Moreno:
  Exponential sums and Goppa codes: II. 1222-1229
  
• Vinay A. Vaishampayan, Nariman Farvardin:
  Joint design of block source codes and modulation signal sets. 1230-1248
  
• Kenneth Rose, Eitan Gurewitz, Geoffrey Fox:
  Vector quantization by deterministic annealing. 1249-1257
  
• Meir Feder, Neri Merhav, Michael Gutman:
  Universal prediction of individual sequences. 1258-1270
  
• Yali Amit, Michael I. Miller:
  Large deviations for the asymptotics of Ziv-Lempel codes for 2-D Gibbs fields. 1271-1275
  
• Paul H. Algoet, Brian H. Marcus:
  Large deviation theorems for empirical types of Markov chains constrained to thin sets. 1276-1291
  
• Michael I. Miller, Joseph A. O'Sullivan:
  Entropies and combinatorics of random branching processes and context-free languages. 1292-1310
  
• Iickho Song, Saleem A. Kassam:
  Locally optimum rank detection of correlated random signals in additive noise. 1311-1322
  
• Adam Krzyzak:
  Global convergence of the recursive kernel regression estimates with applications in classification and nonlinear system estimation. 1323-1338
  

• Ira S. Moskowitz, Allen R. Miller:
  The channel capacity of a certain noisy timing channel. 1339-1344
  
• John A. Gubner:
  On the capacity region of the discrete additive multiple-access arbitrarily varying channel. 1344-1347
  
• Jay N. Livingston:
  Shaping using variable-size regions. 1347-1353
  
• Paul Camion, Bernard Courteau, André Montpetit:
  Weight distribution of cosets of 2-error-correcting binary BCH codes of length 15, 63 and 255. 1353-1357
  
• Tuvi Etzion:
  Optimal codes for correcting single errors and detecting adjacent errors. 1357-1360
  
• Vladimir V. Chepyzhov, Ben J. M. Smeets, Kamil Sh. Zigangirov:
  The free distance of fixed convolutional rate 2/4 codes meets the Costello bound. 1360-1366
  
• T. Aaron Gulliver, Vijay K. Bhargava:
  Nine good rate (m-1)/pm quasi-cyclic codes. 1366-1369
  
• T. Aaron Gulliver, Vijay K. Bhargava:
  Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4). 1369-1374
  
• Ara Patapoutian, P. Vijay Kumar:
  The (d, k) subdoce of a linear block code. 1375-1382
  
• Alexander Barg, Ilya Dumer:
  On computing the weight spectrum of cyclic codes. 1382-1386
  
• Ephraim Feig, Shmuel Winograd:
  On the multiplicative complexity of discrete cosine transforms. 1387-1391
  
• Chein-I Chang, Laurence B. Wolfe:
  Source matching problems revisited. 1391-1395
  
• W. Cary Huffman:
  On extremal self-dual ternary codes of lengths 28 to 40. 1395-1400
  
• Boris Ryabko:
  A fast on-line adaptive code. 1400-1404
  
• Solomon W. Golomb:
  The T₄ and G₄ constructions for Costas arrays. 1404-1406
  
• Branislav M. Popovic:
  Generalized chirp-like polyphase sequences with optimum correlation properties. 1406-1409
  
• Shyh-Chang Liu, John J. Komo:
  Nonbinary Kasami sequences over GF(p). 1409-1412
  
• Jacques Wolfmann:
  Almost perfect autocorrelation sequences. 1412-1418
  
• Stephan V. Schell, William A. Gardner:
  The Cramér-Rao lower bound for directions of arrival of Gaussian cyclostationary signals. 1418-1422
  
• Carl W. Helstrom:
  Computing the generalized Marcum Q-function. 1422-1428
  
• Venugopal V. Veeravalli: Comments on 'Decentralized sequential detection' by H.R. Hashemi and I.B. Rhodes. 1428-
• Fan R. K. Chung, Jawad A. Salehi, Victor K.-W. Wei: Correction to 'Optical orthogonal codes: Design, analysis, and applications' (May 89 595-604). 1429-

• Toby Berger: Review of 'Entropy and Information Theory' (Gray, R.M.; 1990). 1430-

Volume 38, Number 5, September 1992

• Andrew R. Barron, László Györfi, Edward C. van der Meulen:
  Distribution estimation consistent in total variation and in two types of information divergence. 1437-1454
  
• David M. Goblirsch, Nariman Farvardin:
  Switched scalar quantizers for hidden Markov sources. 1455-1473
  
• P. Vijay Kumar, Victor K.-W. Wei:
  Minimum distance of logarithmic and fractional partial m-sequences. 1474-1482
  
• Luc Knockaert:
  Stability of linear predictors and numerical range of shift operators in normed spaces. 1483-1486
  
• Wlodzimierz Greblicki:
  Nonparametric identification of Wiener systems. 1487-1493
  
• Shlomo Shamai, Sergio Verdú:
  Worst-case power-constrained noise for binary-input channels. 1494-1511
  
• Sang Ju Park, Robert M. Gray:
  Sigma-delta modulation with leaky integration and constant input. 1512-1533
  
• Alon Orlitsky:
  Average-case interactive communication. 1534-1547
  
• Dejan E. Lazic, Vojin Senk:
  A direct geometrical method for bounding the error exponent for any specific family of channel codes - I: Cutoff rate lower bound for block codes. 1548-1559
  

• Jeffrey L. Anderson:
  On minimal decoding sets for the extended binary Golay code. 1560-1561
  
• Andrew B. Nobel, Aaron D. Wyner:
  A recurrence theorem for dependent processes with applications to data compression. 1561-1564
  
• Mahesh C. Bhandari, M. S. Garg:
  Optimum codes of dimension 3 and 4 over GF(4). 1564-1567
  
• Shigeo Akashi:
  A relation between Kolmogorov-Prokhorov's condition and Ohya's fractal dimensions. 1567-1570
  
• Stefan M. Dodunekov, Jan E. M. Nilsson:
  Algebraic decoding of the Zetterberg codes. 1570-1573
  
• Carlos Munuera:
  On the main conjecture on geometric MDS codes. 1573-1577
  
• Alexander V. Nazin, Boris T. Polyak, Alexandre B. Tsybakov:
  Optimal and robust kernel algorithms for passive stochastic approximation. 1577-1583
  
• Julia Abrahams, Marc J. Lipman:
  Zero-redundancy coding for unequal code symbol costs. 1583-1586
  
• Jan W. M. Bergmans:
  Effect of binary modulation codes with rate R=1/N on equivalent discrete-time models for channels with intersymbol interference. 1587-1592
  
• Zhen Zhang, Xiang-Gen Xia:
  New lower bounds for binary codes of asymmetric distance two. 1592-1597
  
• Ofer Zeitouni, Jacob Ziv, Neri Merhav:
  When is the generalized likelihood ratio test optimal? 1597-1602
  
• Khalid Sayood, Sangsin Na:
  Recursively indexed quantization of memoryless sources. 1602-1609
  
• Francesco Fabris:
  Variable-length-to-variable-length source coding: A greedy step-by-step algorithm. 1609-1617
  
• Nitin H. Vaidya, Dhiraj K. Pradhan:
  A new class of bit- and byte-error control codes. 1617-1623
  
• Colin D. Frank:
  Comments on 'Evaluating distance spectra and performance bounds of trellis codes on channels with intersymbol interference' by C. Schlegel. 1623-1625
  

• Hendrik C. Ferreira: Review of 'Coding Techniques for Digital Recorders' (Schouhamer-Immink, K.A.; 1991). 1626-

Volume 38, Number 6, November 1992

• Yoram Baram, Dror Salée:
  Lower bounds on the capacities of binary and ternary networks storing sparse random vectors. 1633-1647
  
• Zhen Zhang, Chiaming Lo:
  Linear inequalities for covering codes: Part II: Triple covering inequalities. 1648-1662
  
• S. C. Porter, Ba-Zhong Shen, Ruud Pellikaan:
  Decoding geometric Goppa codes using an extra place. 1663-1676
  
• Chi-Chao Chao, Robert J. McEliece, Laif Swanson, Eugene R. Rodemich:
  Performance of binary block codes at low signal-to-noise ratios. 1677-1687
  
• Charles T. Retter:
  Gaps in the binary weight distributions of Reed-Solomon codes. 1688-1697
  
• Miroslaw Pawlak:
  On the reconstruction aspects of moment descriptors. 1698-1708
  
• Yariv Ephraim, Neri Merhav:
  Lower and upper bounds on the minimum mean-square error in composite source signal estimation. 1709-1724
  
• Imre Csiszár:
  Arbitrarily varying channels with general alphabets and states. 1725-1742
  
• Elvino S. Sousa:
  Performance of a spread spectrum packet radio network link in a Poisson field of interferers. 1743-1754
  
• Xiaolin Wu:
  Image coding by adaptive tree-structured segmentation. 1755-1767
  
• László Gerencsér:
  AR(infty) estimation and nonparametric stochastic complexity. 1768-1778
  
• Yossef Steinberg, Ofer Zeitouni:
  On tests for normality. 1779-1787
  

• Kenjiro Yanagi:
  Necessary and sufficient condition for capacity of the discrete time Gaussian channel to be increased by feedback. 1788-1791
  
• A. Robert Calderbank, Gregory J. Pottie:
  Upper bounds for small trellis codes. 1791-1795
  
• Rumen N. Daskalov, Stoyan N. Kapralov:
  New minimum distance bounds for certain binary linear codes. 1795-1796
  
• G. David Forney Jr.:
  On the Hamming distance properties of group codes. 1797-1801
  
• Masakatu Morii, Masao Kasahara:
  Generalized key-equation of remainder decoding algorithm for Reed-Solomon codes. 1801-1807
  
• J. Chen, P. Owsley:
  A burst-error-correcting algorithm for Reed-Solomon codes. 1807-1812
  
• Ming Jia, Anader Benyamin-Seeyar, Tho Le-Ngoc:
  Exact lower bounds on the codelength of three-step permutation-decodable cyclic codes. 1812-1817
  
• B. Sundar Rajan, M. U. Siddiqi:
  Transform domain characterization of Abelian codes. 1817-1821
  
• Anders Bjært Sørensen:
  Weighted Reed-Muller codes and algebraic-geometric codes. 1821-1826
  
• Hervé Chabanne:
  Permutation decoding of Abelian codes. 1826-1829
  
• Han-Ping Tsai:
  Existence of some extremal self-dual codes. 1829-1833
  
• Branko Radosavljevic, Erdal Arikan, Bruce E. Hajek:
  Sequential decoding of low-density parity-check codes by adaptive reordering of parity checks. 1833-1839
  
• Edgar N. Gilbert, T. T. Kadota:
  The Lempel-Ziv algorithm and message complexity. 1839-1842
  
• Wentian Li:
  Random texts exhibit Zipf's-law-like word frequency distribution. 1842-1845
  
• Marie-José Montpetit, David Haccoun, Gilles Deslauriers:
  A branching process analysis of the stack algorithm for variable channel conditions. 1845-1848
  

Last update Tue May 21 19:48:21 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page