IEEE Transactions on Information Theory, Volume 35

Volume 35, Number 1, January 1989

• Te Sun Han, Kingo Kobayashi:
  Exponential-type error probabilities for multiterminal hypothesis testing. 2-14
  
• Rudolf Ahlswede, Gunter Dueck:
  Identification via channels. 15-29
  
• Rudolf Ahlswede, Gunter Dueck:
  Identification in the presence of feedback-A discovery of new capacity formulas. 30-36
  
• Thomas M. Cover, Sandeep Pombra:
  Gaussian feedback capacity. 37-43
  
• Andries P. Hekstra, Frans M. J. Willems:
  Dependence balance bounds for single-output two-way channels. 44-53
  
• Frans M. J. Willems:
  Universal data compression and repetition times. 54-58
  
• Anthony Kuh, Bradley W. Dickinson:
  Information capacity of associative memories. 59-68
  
• Jovan Dj. Golic:
  On the linear complexity of functions of periodic GF(q) sequences. 69-75
  
• Chi-Yung Chang, Kung Yao:
  Systolic array processing of the Viterbi algorithm. 76-86
  
• Gregory J. Pottie, Desmond P. Taylor:
  Multilevel codes based on partitioning. 87-98
  
• Richard A. Brualdi, Vera Pless, Richard M. Wilson:
  Short codes with a given coveting radius. 99-109
  
• Heeralal Janwa:
  Some new upper bounds on the covering radius of binary linear codes. 110-122
  
• Ruxandra Lupas, Sergio Verdú:
  Linear multiuser detectors for synchronous code-division multiple-access channels. 123-136
  
• Thomas R. Fischer:
  Geometric source coding and vector quantization. 137-145
  
• Costas N. Georghiades:
  On the synchronizability and detectability of random PPM sequences. 146-156
  
• Costas N. Georghiades:
  Some optimal and suboptimal receivers deriving information from nonsynchronized Poisson data. 157-165
  
• Zvi Rosberg, Nachum Shacham:
  Resequencing delay and buffer occupancy under the selective-repeat ARQ. 166-173
  

• Héctor J. Sussmann:
  On the number of memories that can be perfectly stored in a neural net with Hebb weights. 174-178
  
• Te Sun Han, Kingo Kobayashi:
  The strong converse theorem for hypothesis testing. 178-180
  
• Guan-Zhong Dai, Jerry M. Mendel:
  Maximum a posteriori estimation of multichannel Bernoulli-Gaussian sequences. 181-183
  
• William J. Park Jr., John J. Komo:
  Relationships between m -sequences over GF(q) and GF(qm). 183-186
  
• Ludwig Staiger:
  On the weight distribution of linear codes having dual distance d' geq k. 186-188
  
• Khaled A. S. Abdel-Ghaffar:
  Some convolutional codes whose free distances are maximal. 188-191
  
• Renato M. Capocelli:
  Comments and additions to 'Robust transmission of unbounded strings using Fibonacci representations' by A. Apostolico and A.S. Fraenkel. 191-193
  
• Abdelkader Mokkadem:
  Estimation of the entropy and information of absolutely continuous random variables. 193-196
  
• Patrick Flandrin:
  On the spectrum of fractional Brownian motions. 197-199
  
• Tangül Ü. Basar, Tamer Basar:
  Optimum linear causal coding schemes for Gaussian stochastic processes in the presence of correlated jamming. 199-202
  
• Mireille Régnier, Philippe Jacquet:
  New results on the size of tries. 203-205
  
• Habong Chung, P. Vijay Kumar:
  A new general construction for generalized bent functions. 206-209
  
• Ramón Gutiérrez, Mariano J. Valderrama:
  On the Gaussian characterization of certain second-order processes with specified covariance. 210-211
  
• Arne Dür: Correction to 'On the Computation of the Performance Probabilities for Block Codes with a Bounded-Distance Decoding Rule'. 211-

Volume 35, Number 2, March 1989

• Shun-ichi Amari, Te Sun Han:
  Statistical inference under multiterminal rate restrictions: A differential geometric approach. 217-227
  
• Toby Berger, Raymond W. Yeung:
  Multiterminal source encoding with one distortion criterion. 228-236
  
• Toby Berger, Raymond W. Yeung:
  Multiterminal source encoding with encoder breakdown. 237-244
  
• Andrew M. Fraser:
  Information and entropy in strange attractors. 245-262
  
• Garry M. Jacyna, Erick R. Malaret:
  Classification performance of a Hopfield neural network based on a Hebbian-like learning rule. 263-280
  
• Philip A. Chou:
  The capacity of the Kanerva associative memory. 281-298
  
• Philip A. Chou, Tom D. Lookabaugh, Robert M. Gray:
  Optimal pruning with applications to tree-structured source coding and modeling. 299-315
  
• Gerald R. Benitz, James A. Bucklew:
  Asymptotically optimal quantizers for detection of I.I.D. data. 316-325
  
• Neri Merhav, Jacob Ziv:
  Estimating with partial statistics the parameters of ergodic finite Markov sources. 326-333
  
• Yonina Rosen, Boaz Porat:
  The second-order moments of the sample covariances for time series with missing observations. 334-341
  
• Yonina Rosen, Boaz Porat:
  Optimal ARMA parameter estimation based on the sample covariances for data with missing observations. 342-349
  
• Harry L. Hurd:
  Nonparametric time series analysis for periodically correlated processes. 350-359
  
• Shuyuan He, Benjamin Kedem:
  Higher order crossings spectral analysis of an almost periodic random sequence in noise. 360-370
  
• Jong-Seon No, P. Vijay Kumar:
  A new family of binary pseudorandom sequences having optimal periodic correlation properties and large linear span. 371-379
  
• Zhi-Dong Bai, Paruchuri R. Krishnaiah, Lin-Cheng Zhao:
  On rates of convergence of efficient detection criteria in signal processing with white noise. 380-388
  
• David A. Shnidman:
  The calculation of the probability of detection and the generalized Marcum Q-function. 389-400
  
• Michael Gutman:
  Asymptotically optimal classification for multiple tests with empirically observed statistics. 401-408
  
• Wlodzimierz Greblicki, Miroslaw Pawlak:
  Nonparametric identification of Hammerstein systems. 409-418
  
• Lineu C. Barbosa:
  Maximum likelihood sequence estimators: A geometric view. 419-427
  
• Guillermo E. Atkin, Ian F. Blake:
  Performance of multitone FFH/MFSK systems in the presence of jamming. 428-435
  
• Utpal Mukherji:
  A periodic scheduling problem in flow control for data communication networks. 436-443
  
• Paul C. van Oorschot, Scott A. Vanstone:
  A geometric approach to root finding in GF(q^m). 444-453
  

• Carlisle M. Adams, Henk Meijer:
  Security-related comments regarding McEliece's public-key cryptosystem. 454-455
  
• John B. Anderson, Kumar Balachandran:
  Decision depths of convolutional codes. 455-459
  
• Pil Joong Lee:
  There are many good periodically time-varying convolutional codes. 460-463
  
• Carlo M. Monti, Gianfranco L. Pierobon:
  Codes with a multiple spectral null at zero frequency. 463-472
  
• Norman P. Secord, Rudolf de Buda:
  Demodulation of a Gosset lattice code having a spectral null at DC. 472-477
  
• Dusan B. Jevtic, Hasan S. Alkhatib:
  Frequency-hopping codes for multiple-access channels: A geometric approach. 477-481
  
• Philippe Delsarte, Yves V. Genin:
  An extension of the split Levinson algorithm and its relatives to the joint process estimation problem. 482-485
  

Volume 35, Number 3, May 1989

• Hanoch Lev-Ari, Sydney R. Parker, Thomas Kailath:
  Multidimensional maximum-entropy covariance extension. 497-508
  
• H. R. Hashemi, Ian B. Rhodes:
  Decentralized sequential detection. 509-520
  
• Rakesh K. Bansal, Panayota Papantoni-Kazakos:
  Outlier-resistant algorithms for detecting a change in a stochastic process. 521-535
  
• Donald L. Snyder, Joseph A. O'Sullivan, Michael I. Miller:
  The use of maximum likelihood estimation for forming images of diffuse radar targets from delay-Doppler data. 536-548
  
• Michael D. Rawn:
  On nonuniform sampling expansions using entire interpolating functions, and on the stability of Bessel-type sampling expansions. 549-557
  
• Santosh S. Venkatesh, Demetri Psaltis:
  Linear and logarithmic capacities in associative neural networks. 558-568
  
• Tomás Feder:
  Reliable computation by networks in the presence of noise. 569-571
  
• Hirosuke Yamamoto:
  Coding theorem for secret sharing communication systems with two noisy channels. 572-578
  
• A. Robert Calderbank, Mark A. Herro, Vivek P. Telang:
  A multilevel approach to the design of DC-free line codes. 579-583
  
• Gui Liang Feng, Kenneth K. Tzeng:
  A generalized Euclidean algorithm for multisequence shift-register synthesis. 584-594
  
• Fan R. K. Chung, Jawad A. Salehi, Victor K. Wei:
  Optical orthogonal codes: Design, analysis, and applications. 595-604
  
• Sergio Verdú:
  Multiple-access channels with memory with and without frame synchronism. 605-619
  
• Ezio Biglieri, Michele Elia, Letizia Lopresti:
  The optimal linear receiving filter for digital transmission over nonlinear channels. 620-625
  
• Frank R. Kschischang, Mart L. Molle:
  The helical window token ring. 626-636
  
• Izhak Rubin, Zsehong Tsai:
  Message delay analysis of multiclass priority TDMA, FDMA, and discrete-time queueing systems. 637-647
  
• Martin I. Reiman, Alan Weiss:
  Light traffic derivatives via likelihood ratios. 648-654
  

• Ron M. Roth, Abraham Lempel:
  A construction of non-Reed-Solomon type MDS codes. 655-657
  
• T. G. Harbour:
  Binary cyclic [n, k] codes used for simultaneous t EC and SBD (corresp.). 657-659
  
• Marat V. Burnashev, Ezio Biglieri:
  Bounds on the minimum distance of trellis codes. 659-662
  
• Antonio Restivo:
  A note on multiset decipherable codes. 662-663
  
• Gábor Simonyi:
  On write-unidirectional memory codes. 663-669
  
• Peter Grassberger:
  Estimating the information content of symbol sequences and efficient codes. 669-675
  
• Yuval Bistritz, Hanoch Lev-Ari, Thomas Kailath:
  Immittance-domain Levinson algorithms. 675-682
  
• Mordechai Segal, Ehud Weinstein:
  A new method for evaluating the log-likelihood gradient, the Hessian, and the Fisher information matrix for linear dynamic systems. 682-687
  
• Nabil Ali Ahmed, D. V. Gokhale:
  Entropy expressions and their estimators for multivariate distributions. 688-692
  
• Kenneth J. Kerpez:
  The power spectral density of maximum entropy charge constrained sequences. 692-695
  
• Robert L. Burr:
  Iterative convex I-projection algorithms for maximum entropy and minimum cross-entropy computations. 695-698
  
• Frank K. Hwang, Y. C. Yao:
  A generalization of the monotonicity theorem in group testing with applications to random multiaccess channels. 698-700
  
• David E. Reed, Mark A. Wickert:
  Nonstationary moments of a random binary pulse train. 700-703
  

Volume 35, Number 4, July 1989

• Amir Dembo:
  On the capacity of associative memories with linear threshold functions. 709-720
  
• Venkat Anantharam:
  The optimal buffer allocation problem. 721-724
  
• John K. Karlof:
  Permutation codes for the Gaussian channel. 726-732
  
• Sergio Verdú:
  The capacity region of the symbol-asynchronous Gaussian multiple-access channel. 733-751
  
• Imre Csiszár, Prakash Narayan:
  Capacity and decoding rules for classes of arbitrarily varying channels. 752-769
  
• Manjunath V. Hegde, Wayne E. Stark, Demosthenis Teneketzis:
  On the capacity of channels with unknown interference. 770-783
  
• Wu Chou, Ping Wah Wong, Robert M. Gray:
  Multistage sigma-delta modulation. 784-796
  
• Jacobus H. Weber, Cornelis de Vroedt, Dick E. Boekee:
  Bounds and constructions for codes correcting unidirectional errors. 797-810
  
• Jørn Justesen, Knud J. Larsen, Helge Elbrønd Jensen, Allan Havemose, Tom Høholdt:
  Construction and decoding of a class of algebraic geometry codes. 811-821
  
• Charles T. Retter:
  Intersecting Goppa codes. 822-828
  
• Thammavarapu R. N. Rao, Kil-Hyun Nam:
  Private-key algebraic-code encryptions. 829-833
  
• John S. Sadowsky:
  A dependent data extension of Wald's identity and its application to sequential test performance computation. 834-842
  
• Alfred O. Hero III:
  Lower bounds on estimator performance for energy-invariant parameters of multidimensional Poisson processes. 843-858
  
• Gang George Yin:
  Asymptotic properties of an adaptive beam former algorithm. 859-867
  
• Abraham M. Hasofer, Shahaboddin Ghahreman:
  On the Slepian process of a random Gaussian trigonometric polynomial. 868-873
  
• Ramin Sadr, Mehrdad Shahshahani, William J. Hurd:
  Degradation of signal-to-noise ratio due to amplitude distortion. 874-878
  
• Torleiv Kløve:
  Bounds and construction for difference triangle sets. 879-886
  

• Amir Dembo:
  Simple proof of the concavity of the entropy power with respect to Gaussian noise. 887-888
  
• Philippe Piret:
  Two results on the permuting mailbox channel. 888-892
  
• Kenji Nakagawa, Fumio Kanaya:
  Geometric characterization of capacity-constraint function. 892-895
  
• Kar-Ming Cheung:
  More on the decoder error probability for Reed-Solomon codes. 895-900
  
• David M. Mandelbaum:
  Optimal type- B1 convolutional codes of rate 4/5. 900-
  
• Gary L. Mullen:
  Permutation polynomials and nonsingular feedback shift registers over finite fields. 900-902
  
• A. J. Han Vinck, Karel A. Post:
  On the influence of coding on the mean time to failure for degrading memories with defects. 902-906
  
• G. David Forney Jr.:
  A bounded-distance decoding algorithm for the Leech lattice, with generalizations. 906-909
  
• Robert F. Pawula, Stephen O. Rice:
  A note on Hansmann's 1934 family of distributions. 910-911
  
• Ning Zhang, Solomon W. Golomb:
  Sixty-phase generalized Barker sequences. 911-912
  
• Robert J. Elliott:
  Bilateral prediction. 912-917
  
• John S. Sadowsky:
  Robust large deviations performance analysis for large sample detectors. 917-920
  

Volume 35, Number 5, September 1989

• G. David Forney Jr., A. Robert Calderbank:
  Coset codes for partial response channels; or, coset codes with spectral nulls. 925-943
  
• John B. Anderson:
  Limited search trellis decoding of convolutional codes. 944-955
  
• Israel Bar-David, Shlomo Shamai:
  Information rates for magnetic recording channels with peak- and slope-limited magnetization. 956-962
  
• Jakov Snyders, Yair Be'ery:
  Maximum likelihood soft decoding of binary block codes and decoders for the Golay codes. 963-975
  
• Jehoshua Bruck, Mario Blaum:
  Neural networks, error-correcting codes, and polynomials over the binary n -cube. 976-987
  
• Imad Y. Hoballah, Pramod K. Varshney:
  An information theoretic approach to the distributed detection problem. 988-994
  
• Imad Y. Hoballah, Pramod K. Varshney:
  Distributed Bayesian signal detection. 995-1000
  
• Yariv Ephraim, Amir Dembo, Lawrence R. Rabiner:
  A minimum discrimination information approach for hidden Markov modeling. 1001-1013
  
• Neri Merhav, Michael Gutman, Jacob Ziv:
  On the estimation of the order of a Markov chain and universal data compression. 1014-1019
  
• Tom D. Lookabaugh, Robert M. Gray:
  High-resolution quantization theory and the vector quantizer advantage. 1020-1033
  
• Ilan Kessler, Moshe Sidi:
  Splitting algorithms in noisy channels with memory. 1034-1043
  
• Thomas K. Philips, Shivendra S. Panwar, Asser N. Tantawi:
  Connectivity properties of a packet radio network model. 1044-1047
  
• Sabah Alquaddoomi, Robert A. Scholtz:
  On the nonexistence of Barker arrays and related matters. 1048-1057
  
• Xi-Ren Cao:
  Estimates of performance sensitivity of a stochastic system. 1058-1068
  

• Soura Dasgupta, Anjan Ghosh, Robert Cuykendall:
  Convergence in neural memories. 1069-1072
  
• Amir Dembo:
  On Gaussian feedback capacity. 1072-1076
  
• Naftali Chayat, Shlomo Shamai:
  Extension of an entropy property for binary input memoryless symmetric channels. 1077-1079
  
• Shlomo Shamai, Israel Bar-David:
  Upper bounds on capacity for a constrained Gaussian channel. 1079-1084
  
• Renato M. Capocelli, Alfredo De Santis:
  Tight upper bounds on the redundancy of Huffman codes. 1084-1091
  
• Henk C. A. van Tilborg, Mario Blaum:
  On error-correcting balanced codes. 1091-1095
  
• Stephen Fratini:
  Error detection in a class of decimal codes. 1095-1098
  
• Hendrik C. Ferreira, D. A. Wright, Andre L. Nel:
  Hamming distance preserving mappings and trellis codes with constrained binary symbols. 1098-1103
  
• Lanh Tat Tran:
  Recursive density estimation under dependence. 1103-1108
  
• Neri Merhav:
  The estimation of the model order in exponential families. 1109-1114
  
• C. Bendjaballah, M. Charbit:
  Quantum communication with coherent states. 1114-1123
  
• Franco P. Preparata:
  Holographic dispersal and recovery of information. 1123-1124
  
• Michael Paterakis, Panayota Papantoni-Kazakos:
  A simple window random access algorithm with advantageous properties. 1124-1130
  
• M. Charbit, C. Bendjaballah, Carl W. Helstrom:
  Cutoff rate for the M-ary PSK modulation channel with optimal quantum detection. 1131-1133
  
• Michael W. Marcellin, Thomas R. Fischer:
  Encoding algorithms for complex approximations in Z[e^2{pi}i/8]. 1133-1136
  

• Aaron D. Wyner: Review of 'Principles and Practice of Information Theory' (Blahut, R.E.; 1987). 1137-

Volume 35, Number 6, November 1989

• Mats L. Cedervall, Rolf Johannesson:
  A fast algorithm for computing distance spectrum of convolutional codes. 1146-1159
  
• Chao-Ming Zeng, Federico Kuhlmann, Andres Buzo:
  Achievability proof of some multiuser channel coding theorems using backward decoding. 1160-1165
  
• Abraham Krieger, Elias Masry:
  Constrained adaptive filtering algorithms: Asymptotic convergence properties for dependent data. 1166-1176
  
• Masakatu Morii, Masao Kasahara, Douglas L. Whiting:
  Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields. 1177-1183
  
• Daniel Alpay, Patrick Dewilde, Harry Dym:
  On the existence and construction of solutions to the partial lossless inverse scattering problem with applications to estimation theory. 1184-1205
  
• Amir Dembo, Colin L. Mallows, Lawrence A. Shepp:
  Embedding nonnegative definite Toeplitz matrices in nonnegative definite circulant matrices, with application to covariance estimation. 1206-1212
  
• Qitu Zhang, Simon Haykin, Patrick C. Yip:
  Performance limits of the innovations-based detection algorithm. 1213-1222
  
• Michael D. Rawn:
  A stable nonuniform sampling expansion involving derivatives. 1223-1227
  
• Ruud Pellikaan:
  On a decoding algorithm for codes on maximal curves. 1228-1232
  
• John K. Goutsias:
  Mutually compatible Gibbs random fields. 1233-1249
  
• Aaron D. Wyner, Jacob Ziv:
  Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression. 1250-1258
  
• John C. Kieffer:
  Finite-state adaptive block to variable-length noiseless coding of a nonstationary information source. 1259-1263
  
• Thomas E. Fuja, Chris Heegard, Mario Blaum:
  Cross parity check convolutional codes. 1264-1276
  
• Mordechai Mushkin, Israel Bar-David:
  Capacity and coding for the Gilbert-Elliot channels. 1277-1290
  

• Antoine Lobstein, Gerhard J. M. van Wee:
  On normal and subnormal q-ary codes. 1291-1295
  
• Douglas A. Leonard, C. A. Rodger:
  Limiting error propagation in Viterbi decoding of convolutional codes. 1295-1299
  
• Mark G. Karpovsky, Prawat Nagvajara:
  Optimal codes for minimax criterion on error detection. 1299-1305
  
• Dennis R. Morgan:
  Comments on 'Convergence and performance analysis of the normalized LMS algorithm with uncorrelated Gaussian data' by M. Tarrab and A. Feuer. 1299-
  
• W. Edwin Clark, Larry A. Dunning, D. G. Rogers:
  The construction of some bit and byte error control codes using partial Steiner systems. 1305-1310
  
• Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro:
  An efficient algorithm for testing immutability of variable-length codes. 1310-1314
  
• Ron M. Roth, Abraham Lempel:
  On MDS codes via Cauchy matrices. 1314-1319
  
• Tak-Shing Peter Yum, Eric W. M. Wong:
  The scheduled-retransmission multiaccess (SRMA) protocol for packet satellite communication. 1319-1324
  
• Cornelis L. M. van Pul, Tuvi Etzion:
  New lower bounds for constant weight codes. 1324-1329
  
• Vera Pless:
  Extremal codes are homogeneous. 1329-1330
  
• Patrick Lee, Jack K. Wolf:
  A general error-correcting code construction for run-length limited binary channels. 1330-1335
  
• Hiroshi Kamabe:
  Minimum scope for sliding block decoder mappings. 1335-1340
  
• A. J. E. M. Janssen:
  Asymptotics of the Perron-Frobenius eigenvalue of nonnegative Hessenberg-Toeplitz matrices. 1340-1344
  
• Lennart Brynielsson: A short proof of the Xiao-Massey lemma. 1344-
• Markku K. Kaikkonen:
  A new four-error-correcting code of length 20. 1344-
  

Last update Thu May 23 19:38:50 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page