IEEE Transactions on Information Theory, Volume 27

Volume 27, Number 1, January 1981

• Imre Csiszár, János Körner:
  Graph decomposition: A new key to coding theorems. 5-11
  
• Jorma Rissanen, Glen G. Langdon Jr.:
  Universal modeling and coding. 12-22
  
• Yosihiko Ogata:
  On Lewis' simulation method for point processes. 23-30
  
• Yasuo Matsuyama, Robert M. Gray:
  Universal tree encoding for speech. 31-42
  
• Shih-Chun Chang, Jack K. Wolf:
  On the T-user M-frequency noiseless multiple-access channel with and without intensity information. 41-48
  
• Te Sun Han, Kingo Kobayashi:
  A new achievable rate region for the interference channel. 49-60
  
• John R. Pierce, Edward C. Posner, Eugene R. Rodemich:
  The capacity of the photon counting channel. 61-76
  
• Richard G. Ogier, Eugene Wong:
  Recursive linear smoothing of two-dimensional random fields. 77-83
  
• Elias Masry, Stamatis Cambanis:
  Consistent estimation of continuous-time signals from nonlinear transformations of noisy samples. 84-96
  
• Dimitri Kazakos:
  New convergence bounds for Bayes estimators. 97-98
  
• David C. Farden:
  Stochastic approximation with correlated data. 105-113
  

• Pierre R. Chevillat:
  N-user trellis coding for a class of multiple-access channels. 114-120
  
• Abbas A. El Gamal, Edward C. van der Meulen:
  A proof of Marton's coding theorem for the discrete memoryless broadcast channel. 120-122
  
• Te Sun Han:
  The capacity region for the deterministic broadcast channel with a common message. 122-125
  
• Philippe Delsarte, Philippe Piret:
  Bounds and constructions for binary asymmetric error-correcting codes. 125-128
  
• Torleiv Kløve:
  Upper bounds on codes correcting asymmetric errors. 128-131
  
• Ben-Zion Bobrovsky, Moshe Zakai:
  On lower bounds for the nonlinear filtering problem. 131-132
  
• Joel M. Morris:
  On single-sample robust detection of known signals with additive unknown-mean amplitude-bounded random interference - II: The randomized decision rule solution. 132-136
  
• Bal Kishan Dass, Sunil Kumar Muttoo:
  Comments on 'Error-locating codes - A new concept in error control' by J. K. Wolf and B. Elspas. 136-
  
• Nimal Ekanayake, Desmond P. Taylor:
  Correction to 'CPSK Signaling over Hard Limited Channels in Additive Gaussian Noise and Intersymbol Interference'. 137-138
  

• Deborah J. Bergstrand:
  New uniqueness proofs for the (5, 8, 24), (5, 6, 12), and related Steiner systems (Ph.D. Thesis abstr.). 139
  
• Samiresh C. Bose:
  Two-dimensional smoothing of a vector Laplacian random field with application to geodesy (Ph.D. Thesis abstr.). 139
  
• George R. Davis:
  Exploration techniques for the evaluation of digital communications equipment (Ph.D. Thesis abstr.). 139
  
• Roberto Garcia-Muñoz:
  Coding for a class of sources (Ph.D. Thesis abstr.). 140
  
• Yalçin Tanik:
  A study of the LMS adaptive filter and two new methods for convergence rate improvement (Ph.D. Thesis abstr.). 140
  
• Suryanarayana V. Varanasi:
  Statistical analysis of zero-crossing sampling digital fading phase-locked loops (Ph.D. Thesis abstr.). 140
  

Volume 27, Number 2, March 1981

• Nicholas Pippenger:
  Bounds on the performance of protocols for a multiple-access broadcast channel . 145-151
  
• Keith Jarett, Thomas M. Cover:
  Asymmetries in relativistic information flow. 152-159
  
• Kon S. Leung, Lloyd R. Welch:
  Erasure decoding in burst-error channels. 160-167
  
• I. M. Boyarinov, G. L. Katsman:
  Linear unequal error protection codes. 168-175
  
• Jeffrey S. Leon, Vera Pless, Neil J. A. Sloane:
  On ternary self-dual codes of length 24. 176-180
  
• Hideki Imai, Hiroshi Fujiya:
  Generalized tensor product codes. 181-186
  
• Laurence B. Milstein:
  Maximum-likelihood estimation of the angular position and extent of a target. 187-198
  
• Raphail E. Krichevsky, Victor K. Trofimov:
  The performance of universal encoding. 199-206
  
• James A. Bucklew:
  Companding and random quantization in several dimensions. 207-211
  
• Johann-Heinrich Jahn:
  Coding of arbitrarily varying multiuser channels. 212-226
  

• Kenneth M. Mackenthun Jr.:
  Noiseless coding of error detection information. 227-230
  
• Pierre A. Humblet:
  Generalization of Huffman coding to minimize the probability of buffer overflow. 230-232
  
• Gunter Dueck:
  A note on the multiple access channel with correlated sources. 232-235
  
• Dennis R. Morgan:
  Analysis of digital random numbers generated from serial samples of correlated Gaussian noise. 235-239
  
• P. E. Cheng, R. J. Serfling:
  Asymptotic mean integrated squared errors of some nonparametric density estimators. 239-242
  
• Saleem A. Kassam:
  Robust hypothesis testing for bounded classes of probability densities. 242-247
  
• Jitendra K. Tugnait:
  Asymptotic stability of the MMSE linear filter for systems with uncertain observations. 247-250
  
• Mats L. Cedervall, Carl-Erik W. Sundberg:
  A class of perfect block codes for the binary channel associated with differentially encoded PSK signals with coherent detection. 250-254
  
• Chin-Long Chen:
  High-speed decoding of BCH codes. 254-256
  
• Tai-Yang Hwang:
  A relation between the row weight and column weight distributions of a matrix. 256-257
  
• Torleiv Kløve: A lower bound for A(n, 4, w). 257-
• Vijay K. Bhargava, George Young, A. K. Bhargava:
  A characterization of a (56, 28) extremal self-dual code. 258-260
  
• Saligram G. S. Shiva, Paul E. Allard, Gérald E. Séguin:
  A class of composite codes. 260-262
  
• Pramod K. Varshney:
  Combined quantization-detection of uncertain signals. 262-265
  

• Nader Mehravari:
  The straddle algorithm for conflict resolution in multiple access channels (M.S. Thesis abstr.). 266-
  

Volume 27, Number 3, May 1981

• Lee D. Davisson, Robert J. McEliece, Michael B. Pursley, Mark S. Wallace:
  Efficient universal noiseless source codes. 269-279
  
• Cliff B. Jones:
  An efficient coding system for long source sequences. 280-291
  
• Thomas M. Cover, Cyril S. K. Leung:
  An achievable rate region for the multiple-access channel with feedback. 292-298
  
• Hirosuke Yamamoto:
  Source coding theory for cascade and branching communication systems. 299-307
  
• Robert J. Fontana, Robert M. Gray, John C. Kieffer:
  Asymptotically mean stationary channels. 308-316
  
• James W. Sennott, Linn I. Sennott:
  A queueing model for analysis of a bursty multiple-access communication channel. 317-321
  
• Thomas H. E. Ericson:
  Modulation by means of linear periodic filtering. 322-326
  
• Neil J. A. Sloane:
  Tables of sphere packings and spherical codes. 327-338
  
• Roland G. Wilson:
  Orthogonal multilevel pseudorandom sequences and impulse sequences derived from them. 339-342
  

• Bradley W. Dickinson:
  Properties and applications of Gaussian autoregressive processes in detection theory. 343-347
  
• Takeshi Hashimoto, Suguru Arimoto:
  A hierarchy of codes for memoryless channels. 348-350
  
• Shigeichi Hirasawa, Masao Kasahara, Yasuo Sugiyama, Toshihiko Namekawa:
  An improvement of error exponents at low rates for the generalized version of concatenated codes. 350-352
  
• Ezio Biglieri:
  The computational cutoff rate of channels having memory. 352-357
  
• John B. Anderson:
  Simulated error performance of multi-h phase codes. 357-362
  
• László Györfi:
  The rate of convergence of k_n-NN regression estimates and classification rules. 362-364
  
• Wlodzimierz Greblicki:
  Asymptotic efficiency of classifying procedures using the Hermite series estimate of multivariate probability densities. 364-366
  
• Jorge I. Galdos:
  A rate distortion theory lower bound on desired function filtering error. 366-368
  
• William A. Gardner:
  Design of nearest prototype signal classifiers. 368-372
  
• Panayota Papantoni-Kazakos:
  Sliding block encoders that are rho-bar continuous functions of their input. 372-376
  
• Dimitris Anastassiou, David J. Sakrison:
  A probability model for simple closed random curves. 376-381
  
• Panlop Zeephongsekul:
  Almost total information convergence of order alpha for a sequence of point processes. 381-383
  
• Choon Peng Tan:
  On the entropy of the Malay language. 383-384
  

• Peter E. Caines:
  Review of 'Linear Systems' (T. Kailath, 1980). 385
  
• Neil J. A. Sloane:
  Review of 'Projective Geometries over Finite Fields' (J. W. P. Hirschfeld, 1979). 385-
  
• Aurel A. Lazar:
  Optimal information processing using counting point process observations (Ph.D. Thesis abstr.). 387
  
• Kou-Hu Tzou:
  Digital decoding of convolutional codes (Thesis abstr.). 387
  
• Mark D. Vanstrum:
  An algorithm for optimal linear map (M.S. Thesis abstr.). 387-
  

Volume 27, Number 4, July 1981

• Robert J. McEliece:
  Practical codes for photon communication. 393-397
  
• Rudolf Ahlswede, Imre Csiszár:
  To get a bit of information may be as hard as to get full information. 398-408
  
• Thomas M. Cover, Robert J. McEliece, Edward C. Posner:
  Asynchronous multiple-access channel capacity. 409-413
  
• Prakash Narayan, Donald L. Snyder:
  The two-user cutoff rate for an asynchronous and a synchronous multiple-access channel are the same. 414-419
  
• Thomas H. E. Ericson, Ingemar Ingemarsson:
  A two-way communication problem with application to information retrieval. 420-430
  
• Lee D. Davisson, Giuseppe Longo, Andrea Sgarro:
  The error exponent for the noiseless encoding of finite ergodic Markov sources. 431-437
  
• Patrick L. Brockett, Perry D. Haaland, Arnold Levine:
  Information theoretic analysis of questionnaire data. 438-445
  
• Patrick Dewilde, Harry Dym:
  Schur recursions, error formulas, and convergence of rational estimators for stationary stochastic sequences. 446-461
  
• Mark G. Karpovsky:
  Weight distribution of translates, covering radius, and perfect codes correcting errors of given weights. 462-471
  
• John E. Shore, Rodney W. Johnson:
  Properties of cross-entropy minimization. 472-482
  
• Jan M. Van Campenhout, Thomas M. Cover:
  Maximum entropy and conditional probability. 483-488
  
• Jhong S. Lee, Robert H. French, Yoon K. Hong:
  Error performance of differentially coherent detection of binary DPSK data transmission on the hard-limiting satellite channel. 489-497
  

• A. F. M. Smith, Udi E. Makov:
  Unsupervised learning for signal versus noise. 498-500
  
• George E. Kokolakis:
  Bayesian classification and classification performance for independent distributions. 500-502
  
• John H. Park Jr.:
  Two-user dispersive communication channels. 502-505
  
• Motoaki Ohkubo:
  A strong outer bound to the capacity region for multiple access channels. 505-508
  
• Abbas A. El Gamal:
  The capacity of the physically degraded Gaussian broadcast channel with feedback. 508-511
  
• Andrew C. Goris, Jerry D. Gibson:
  Incremental tree coding of speech. 511-516
  
• James George Dunham, Robert M. Gray:
  Joint source and noisy channel trellis encoding. 516-519
  
• Wolfgang Mauersberger:
  An analytic function describing the error performance of optimum quantizers. 519-521
  
• R. J. Webster:
  Comments on 'Anomalous behavior of receiver output SNR as a predictor of signal detection performance exemplified for quadratic receivers and incoherent fading Gaussian channels' by W. A. Gardner. 521-522
  
• Julia Abrahams, John B. Thomas:
  Some comments on conditionally Markov and reciprocal Gaussian processes. 523-525
  
• T. Mimaki, Masami Tanabe, D. Wolf:
  The multipeak property of the distribution densities of the level-crossing intervals of a Gaussian random process. 525-527
  
• Yasuichi Horibe:
  Entropy and an optimal random number transformation. 527-529
  
• James R. Schatz:
  The second order Reed-Muller code of length 64 has covering radius 18. 529-530
  

Volume 27, Number 5, September 1981

• Robert Michael Tanner:
  A recursive approach to low complexity codes. 533-547
  
• Tor Helleseth, Henk C. A. van Tilborg:
  A new class of codes meeting the Griesmer bound. 548-555
  
• Shojiro Sakata:
  On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals. 556-564
  
• John C. Kieffer:
  A method for proving multiterminal source coding theorems. 565-569
  
• Kenko Uchida:
  Optimal coding in two-user white Gaussian channels with feedback. 570-576
  
• James A. Bucklew:
  Upper bounds to the asymptotic performance of block quantizers. 577-580
  
• Odile Macchi, Louis L. Scharf:
  A dynamic programming algorithm for simultaneous phase estimation and data decoding on random-phase channels. 581-595
  
• Sawasd Tantaratana, John B. Thomas:
  A class of nonparametric sequential tests. 596-606
  
• Salvatore D. Morgera:
  Structured estimation, II: Multivariate probability density estimation. 607-621
  
• Robert D. Short II, Keinosuke Fukunaga:
  The optimal distance measure for nearest neighbor classification. 622-626
  
• Rangasami L. Kashyap, Ramalingam Chellappa:
  Stochastic models for closed boundary analysis: Representation and reconstruction. 627-637
  

• Wieger J. Reitsema:
  A lower bound on the free distance of convolutional codes related to cyclic codes. 638-639
  
• Cornelius Roos:
  On t-constant codes and designs. 640-643
  
• Agnes Hui Chan, Richard A. Games:
  (n, k, t)-covering systems and error-trapping decoding. 643-646
  
• Teofilo C. Ancheta Jr.:
  An upper bound on the ratio of the probabilities of subgroups and cosets. 646-647
  
• Subhash C. Kak, Amitava Chatterjee: On decimal sequences. 647-
• T. E. McCannon, Neal C. Gallagher Jr.:
  On a class of random processes exhibiting optimal nonlinear one-step predictors. 652-656
  
• T. T. Kadota, Frank M. Labianca:
  A fourth-order homogeneous random field in oceanography. 656-658
  
• K. B. Lakshmanan:
  On Universal Codeword Sets. 659-662
  
• A. J. Estin, W. C. Daywitt:
  Evaluation of signal-plus-noise detection error in an envelope detector with logarithmic compression. 663-664
  
• Essam Khalaf Al-Hussaini, Khalaf El-Dab Ahmad:
  On the identifiability of finite mixtures of distributions. 664-668
  

• Alexander Drukarev:
  Error control using sequential decoding with repeat request (Ph.D. Thesis abstr.). 669
  
• Said M. Elnoubi:
  Efficient spectrum utilization in mobil radio communications systems (Ph.D. Thesis abstr.). 669-
  
• Lee D. Davisson:
  Review of 'Principles of Digital Communications and Coding' (A. J. Viterbi and J. K. Omura, 1979). 670-
  

Volume 27, Number 6, November 1981

• James W. Modestino, Vasudev Bhaskaran, John B. Anderson:
  Tree encoding of images in the presence of channel errors. 677-696
  
• Leon Biederman, Jim K. Omura, Pravin C. Jain:
  Decoding with approximate channel statistics for bandlimited nonlinear satellite channels. 697-707
  
• Robert M. Gray, Augustine H. Gray Jr., Guillermo Rebolledo, John E. Shore:
  Rate-distortion speech coding with a minimum discrimination information distortion measure. 708-720
  
• John C. Kieffer:
  Block coding for weakly continuous channels. 721-727
  
• Motoaki Ohkubo:
  Universal coding for multiple access channels. 728-734
  
• Elias Masry:
  The reconstruction of analog signals from the sign of their noisy samples. 735-745
  
• Peter A. Galko, Subbarayan Pasupathy:
  The mean power spectral density of Markov chain driven signals. 746-754
  
• Ning Hsing Lu, Bruce A. Eisenstein:
  Detection of weak signals in non-Gaussian noise. 755-771
  
• Joseph Hammer, Jennifer Seberry:
  Higher dimensional orthogonal designs and applications. 772-779
  

• Boris Ryabko:
  Comments on 'A source matching approach to finding minimax codes' by L. D. Davisson and A. Leon-Garcia. 780-781
  
• Wen-Chen Chen, Robert J. Fontana:
  On total boundedness for existence of weakly minimax universal codes. 781-784
  
• Robert J. Fontana:
  On universal coding for classes of composite and remote sources with memory. 784-786
  
• Hiroshi Sato:
  The capacity of the Gaussian interference channel under strong interference. 786-788
  
• László Györfi, István Kerekes:
  A block code for noiseless asynchronous multiple-access OR channel. 788-791
  
• León Vidaller Siso, B. Riera Garcia:
  On detection of a class of synchronization errors. 791-794
  
• Simeon C. Ntafos, S. Louis Hakimi:
  On the complexity of some coding problems. 794-796
  
• F. Jessie MacWilliams, Judith B. Seery:
  The weight distributions of some minimal cyclic codes. 796-806
  
• Guy Pasquier:
  A binary extremal doubly even self-dual code (64, 32, 12) obtained from an extended Reed-Solomon code over Fl6. 807-808
  
• Bernard Courteau, Gilles Fournier, Reine Fournier:
  A characterization of N-weight projective codes. 808-812
  
• Tadao Kasami:
  Comments on 'Determining the burst-correcting limit of cyclic codes' by H. J. Matt, and J. L. Massey. 812
  
• Jhong S. Lee, Robert H. French, Yoon K. Hong:
  Correction to 'Error Performance of Differentially Coherent Detection of Binary DPSK Data Transmission on the Hard-Limiting satellite Channel'. 812-
  

Last update Sat May 25 16:58:52 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page