IEEE Transactions on Information Theory, Volume 28

Volume 28, Number 1, January 1982

• John C. Kieffer:
  Sliding-block coding for weakly continuous channels. 2-10
  
• David L. Neuhoff, Paul C. Shields:
  Indecomposable finite state channels and primative approximation. 11-18
  
• Harold Vincent Poor:
  The rate-distortion function on classes of sources determined by spectral capacities. 19-25
  
• John C. Kieffer:
  Characterizations of d -total boundedness for classes of B sources. 26-35
  
• Giuseppe Longo, Guglielmo Galasso:
  An application of informational divergence to Huffman codes. 36-42
  
• Tor Aulin, Carl-Erik W. Sundberg:
  On the minimum Euclidean distance for a class of signal space codes. 43-54
  
• Gottfried Ungerboeck:
  Channel coding with multilevel/phase signals. 55-66
  
• Stamatis Cambanis, Muhammad K. Habib:
  Finite sampling approximations for non-band-limited signals. 67-73
  
• Joel M. Morris:
  On worst case interference for M-ary signaling with correlation receivers. 74-83
  
• Saleem A. Kassam, George V. Moustakides, Jung Gil Shin:
  Robust detection of known signals in asymmetric noise. 84-91
  

• Imre Csiszár, János Körner:
  Feedback does not affect the reliability function of a DMC at rates above capacity. 92-93
  
• Frans M. J. Willems:
  The feedback capacity region of a class of discrete memoryless multiple access channels. 93-95
  
• Vasant K. Prabhu:
  Modified Chernoff bounds for PAM systems with noise and interference. 95-100
  
• G. Prati, Robert M. Gagliardi:
  Block encoding and decoding for the optical PPM channel. 100-105
  
• Neal C. Gallagher Jr., James A. Bucklew:
  Properties of minimum mean squared error block quantizers. 105-107
  
• J. Pieter M. Schalkwijk:
  The binary multiplying channel--A coding scheme that operates beyond Shannon's inner bound region. 107-110
  
• Teofilo C. Ancheta Jr.:
  Duality for the group-coset probability ratio. 110-111
  
• Jaakko Astola:
  An Elias-type bound for Lee codes over large alphabets and its application to perfect codes. 111-113
  
• Vera Pless:
  23 does not divide the order of the group of a (72, 36, 16) doubly even code. 113-117
  
• Siri Krishan Wasan:
  On codes over Z_m. 117-120
  
• Klaus Winkelmann:
  An improved strategy for a counterfeit coin problem. 120-122
  
• Yoram Baram:
  Identifying nonstationary measurement noise in linear systems. 122-123
  
• D. G. Mead:
  Comment on 'An improved strategy for a counterfeit coin problem' by Winkelmann, K.. 122-
  

• Leonidas Georgiadis:
  A collision resolution protocol utilizing energy detectors (M.S. Thesis abstr.). 124
  
• Bing-Hwang Juang:
  Vector quantization for linear prediction voice coding (Ph.D. Thesis abstr.). 124
  

Volume 28, Number 2, March 1982

• Robert M. Gray:
  Editorial. 127-128
  

• Stuart P. Lloyd:
  Least squares quantization in PCM. 129-136
  
• Donald J. Newman:
  The hexagon theorem. 137-138
  
• Paul L. Zador:
  Asymptotic quantization error of continuous signals and the quantization dimension. 139-148
  
• Toby Berger:
  Minimum entropy quantizers and permutation codes. 149-156
  
• Allen Gersho:
  On the structure of vector quantizers. 157-166
  
• N. Thomas Gaarder, David S. Slepian:
  On optimal finite-state digital transmission systems. 167-186
  
• Alexander V. Trushkin:
  Sufficient conditions for uniqueness of a locally optimal quantizer for a class of convex error weighting functions. 187-198
  
• David Pollard:
  Quantization and the method of k -means. 199-204
  
• John C. Kieffer:
  Exponential rate of convergence for Lloyd's method I. 205-210
  
• John H. Conway, Neil J. A. Sloane:
  Voronoi regions of lattices, second moments of polytopes, and quantization. 211-226
  
• John H. Conway, Neil J. A. Sloane:
  Fast quantizing and decoding and algorithms for lattice quantizers and codes. 227-231
  
• Kerry D. Rines, Neal C. Gallagher Jr.:
  The design of two-dimensional quantizers using prequantization. 232-238
  
• James A. Bucklew, Gary L. Wise:
  Multidimensional asymptotic quantization theory with r th power distortion measures. 239-247
  
• John C. Kieffer:
  Stochastic stability for feedback quantization schemes. 248-254
  

• M. R. Garey, David S. Johnson, Hans S. Witsenhausen:
  The complexity of the generalized Lloyd - Max problem. 255-256
  
• Robert M. Gray, Ehud D. Karnin:
  Multiple local optima in vector quantizers. 256-261
  

• Basil S. Maglaris, Mischa Schwartz:
  Optimal fixed frame multiplexing in integrated line- and packet-switched communication networks. 263-272
  
• Gerard J. Foschini:
  Equilibria for diffusion models of pairs of communicating computers - Symmetric case. 273-284
  
• Roberto Garcia-Muñoz, David L. Neuhoff:
  Strong universal source coding subject to a rate-distortion constraint. 285-295
  
• William G. Bath, V. David VandeLinde:
  Robust memoryless quantization for minimum signal distortion. 296-306
  
• Renato M. Capocelli:
  A decision procedure for finite decipherability and synchronizability of multivalued encodings. 307-317
  
• Stephen K. Jones, Ralph K. Cavin III, William M. Reed:
  Analysis of error-gradient adaptive linear estimators for a class of stationary dependent processes. 318-329
  
• David M. Mandelbaum:
  Decoding of erasures and errors for certain RS codes by decreased redundancy. 330-335
  

• R. S. Bucy:
  Distortion rate theory and filtering. 336-340
  
• Dimitris Anastassiou, David J. Sakrison:
  Some results regarding the entropy rate of random fields. 340-343
  
• Abbas A. El Gamal, Max H. M. Costa:
  The capacity region of a class of deterministic interference channels. 343-346
  
• Edgar N. Gilbert, Clyde L. Monma: Multigram codes. 346-
• Jorma Rissanen:
  Tight lower bounds for optimum code length. 348-349
  
• K. R. Matis, James W. Modestino:
  Reduced-search soft-decision trellis coding of linear block codes. 349-355
  
• Farhad Hemmati:
  A large class of nonlinear shift register sequences. 355-359
  
• Carl W. Helstrom:
  Bayes-cost reduction algorithm in quantum hypothesis testing. 359-366
  
• T. E. McCannon, Neal C. Gallagher Jr., D. Minoo-Hamedani, Gary L. Wise:
  On the design of nonlinear discrete-time predictors. 366-371
  
• Ben-Zion Bobrovsky, Moshe Zakai:
  Asymptotic a priori estimates for the error in the nonlinear filtering problem. 371-376
  
• Peter A. S. Metford, Simon Haykin, Desmond P. Taylor:
  An innovations approach to discrete-time detection theory. 376-380
  
• Don R. Halverson, Gary L. Wise:
  On the performance of a nonparametric detection scheme for dependent data. 380-384
  
• Harold J. Kushner, Hai Huang:
  Diffusion approximations for the analysis of digital phase locked loops. 384-390
  

• Paul Mermelstein:
  Review of 'Spoken Language Generation and Understanding' (Simon, J.C., Ed.; 1980). 391-
  
• Jean Conan:
  Structural properties of convolutional codes: An algorithmic approach with application to linear multivariable system theory (Ph.D. Thesis abstr.). 393
  
• Prakash Narayan:
  The cutoff-rate region for multiple-access communication systems (D.Sc. Thesis abstr.). 393
  

Volume 28, Number 3, May 1982

• Mart L. Molle:
  On the capacity of infinite population multiple access protocols. 396-401
  
• Rene L. Cruz, Bruce E. Hajek:
  A new upper bound to the throughput of a multi-access broadcast channel. 402-405
  
• G. Robert Redinbo:
  On the design of mean-square error channel coding systems using cyclic codes. 406-413
  
• William L. Root:
  Coding for a class of nonprobabilistic channels with nonzero memory. 414-421
  
• Bruce E. Hajek:
  Information-singularity and recoverability of random processes. 422-429
  
• Rudolf Ahlswede, Gunter Dueck:
  Good codes can be produced by a few permutations. 430-442
  
• Jerry D. Gibson, Thomas R. Fischer:
  Alphabet-constrained data compression. 443-456
  
• Jørn Justesen:
  Information rates and power spectra of digital codes. 457-472
  
• Gianfranco Cariolaro, Gianfranco L. Pierobon, Silvano Pupolin:
  Spectral analysis of variable-length coded digital signals. 473-481
  
• John J. Kormylo, Jerry M. Mendel:
  Maximum likelihood detection and estimation of Bernoulli - Gaussian processes. 482-488
  
• Jacob Burbea, Calyampudi Radhakrishna Rao:
  On the convexity of some divergence measures based on entropy functions. 489-495
  
• Jeffrey S. Leon:
  Computing automorphism groups of error-correcting codes. 496-510
  
• W. Cary Huffman:
  Automorphisms of codes with applications to extremal doubly even codes of length 48. 511-521
  
• Demetre C. Voukalis:
  A new series of concatenated codes subject to matrix type-B codes. 522-530
  

• Jitendra K. Tugnait:
  Global identification of continuous-time-systems with unknown noise covariance. 531-536
  
• Abbas A. El Gamal, Mohammad R. Aref:
  The capacity of the semideterministic relay channel. 536-
  
• Vera Pless, John G. Thompson:
  17 does not divide the order of the group of a (72, 36, 16) doubly even code. 537-541
  
• Daniel M. Gordon:
  Minimal permutation sets for decoding the binary Golay codes. 541-543
  
• Marcel J. E. Golay:
  The merit factor of long low autocorrelation binary sequences. 543-549
  
• Anthony Ephremides, Royce O. Snyder:
  Modeling of high error rate binary communication channels. 549-555
  
• Alexander V. Trushkin:
  Comment on 'Design of absolutely optimal quantizers for a wide class of distortion measures' by Sharma, D.K.. 555-
  
• Carl W. Helstrom:
  Comment on 'The capacity of the photon counting channel' by Pierce, J.R., et al.. 556-
  

• Michael A. Kaplan:
  Review of 'A Second Course in Stochastic Processes' (Karlin, S., and Taylor, H.M.; 1981). 557
  
• Neil J. A. Sloane:
  Review of 'Advances in Computer System Security' (Turn, R.; 1981). 557
  
• Michael A. Kaplan:
  Review of 'Protocols and Techniques for Data Communication Networks' (Kuo, F.F., Ed.; 1981). 558
  

Volume 28, Number 4, July 1982

• Carlos R. P. Hartmann, Pramod K. Varshney, Kishan G. Mehrotra, Carl L. Gerberich:
  Application of information theory to the construction of efficient decision trees. 565-577
  
• Dov Andelman, James A. Reeds:
  On the cryptanalysis of rotor machines and substitution - permutation networks. 578-584
  
• Imre Csiszár:
  Linear codes for sources and source networks: Error exponents, universal coding. 585-592
  
• Philippe Delsarte, Philippe Piret:
  Algebraic constructions of Shannon codes for regular channels. 593-599
  
• Solomon W. Golomb, Herbert Taylor:
  Two-dimensional synchronization patterns for minimum ambiguity. 600-604
  
• Stamatis Cambanis, Elias Masry:
  Truncation error bounds for the cardinal sampling expansion of band-limited signals. 605-611
  
• Wolfgang Engels, Wolfgang Splettstösser:
  On Walsh differentiable dyadically stationary random processes. 612-618
  
• Thomas H. Kerr:
  False alarm and correct detection probabilities over a time interval for restricted classes of failure detection algorithms. 619-630
  
• On-Ching Yue:
  Maximum likelihood combining for noncoherent and differentially coherent frequency-hopping multiple-access systems. 631-638
  
• Benjamin Friedlander:
  A recursive maximum likelihood algorithm for ARMA spectral estimation. 639-645
  

• Kenneth M. Mackenthun Jr.:
  An easily implementable universal code for the binary source. 646-648
  
• Michael Rodeh:
  A fast test for unique decipherability based on suffix trees. 648-651
  
• Richard A. Flower:
  Communications via updates of shared memory. 651-655
  
• Lois W. Hawkes:
  Information retrieval using the standard array of an (n, k) linear code. 655-658
  
• Nimal Ekanayake, Thiang Tjhung Tjhung:
  On ternary phase-shift keyed signaling. 658-660
  
• Stephen G. Wilson, J. H. Highfill III, Chung-Dyi Hsu:
  Error bounds for multi-h phase codes. 660-665
  
• Sirpa Ernvall:
  When does the modular distance induce a metric in the binary case?. 665-668
  
• Clay S. Brice, Larry C. Andrews:
  New expressions for the pdf and cdf of the filtered output of an analog cross correlator. 668-677
  
• Julia Abrahams:
  The zero-crossing problem for some nonstationary Gaussian processes. 677-678
  
• Dimitri Kazakos:
  Spectral distance measures between continuous-time vector Gaussian processes. 679-681
  
• Dimitri Kazakos:
  Signal detection under mismatch. 681-684
  

Volume 28, Number 5, September 1982

• In Memorium: Jacob Wolfowitz. 687-690

• Bruce E. Hajek:
  Information of partitions with applications to random access communications. 691-700
  
• David L. Neuhoff, R. Kent Gilbert:
  Causal source codes. 701-713
  
• Ingemar Ingemarsson, Donald T. Tang, C. K. Wong:
  A conference key distribution system. 714-719
  
• Dimitri Kazakos:
  Statistical discrimination using inaccurate models. 720-728
  
• Louis A. Liporace:
  Maximum likelihood estimation for multivariate observations of Markov sources. 729-734
  
• Harold Vincent Poor:
  Signal detection in the presence of weakly dependent noise--I: Optimum detection. 735-743
  
• Harold Vincent Poor:
  Signal detection in the presence of weakly dependent noise--II: Robust detection. 744-752
  
• Frank M. Hsu:
  Square root Kalman filtering for high-speed data received over fading dispersive HF channels. 753-763
  
• Philippe Piret:
  Comma free error correcting codes of variable length, generated by finite-state encoders. 764-774
  

• Thomas J. Ferguson:
  Generalized T-user codes for multiple-access channels. 775-778
  
• Jaakko Astola:
  Concatenated codes for the Lee metric. 778-779
  
• Kinichiroh Tokiwa, Tatsuo Sugimura, Masao Kasahara, Toshihiko Namekawa:
  New decoding algorithm for Reed-Muller codes. 779-787
  
• Akira Shiozaki:
  Construction for binary asymmetric error-correcting codes. 787-789
  
• Geoffrey Mason:
  On simplex-type binary codes. 789-790
  
• Tai-Yang Hwang, Sheng Uei Guan:
  Generalized minimum distance decoding on majority logic decodable codes. 790-792
  
• Chin-Long Chen:
  Formulas for the solutions of quadratic equations over GF(2^m). 792-794
  
• David G. Daut, James W. Modestino, Lee D. Wismer:
  New short constraint length convolutional code constructions for selected rational rates. 794-800
  
• Glen G. Langdon Jr., Jorma Rissanen:
  A simple general binary source code. 800-803
  
• Hirosuke Yamamoto:
  Wyner-Ziv theory for a general function of the correlated sources. 803-807
  
• Charles L. Byrne, Raymond M. Fitzgerald:
  Time-limited sampling theorems for band-limited signals. 807-809
  
• Wolfgang Splettstösser:
  Sampling approximation of continuous functions with multidimensional domain. 809-814
  
• Ian F. Blake, Jon W. Mark:
  A note on complex sequences with low correlations. 814-816
  
• Matt Wax:
  The joint estimation of differential delay, Doppler, and phase. 817-820
  

• João Bosco da Mota Alves:
  Extraction of the Gaussian message from non- Gaussian signals using a time-varying filter (D.Sc. Thesis abstr. in Portuguese). 821
  
• Athanasios Aridgides:
  Cutoff rate evaluation of digital communication systems (Ph.D. Thesis abstr.). 821
  

Volume 28, Number 6, November 1982

• Imre Csiszár:
  On the error exponent of source-channel transmission with a distortion threshold. 823-827
  
• Amiram H. Kaspi, Toby Berger:
  Rate-distortion for correlated sources with partially separated encoders. 828-840
  
• Aydano B. Carleial:
  Multiple-access channels with different generalized feedback signals. 841-850
  
• Abbas A. El Gamal, Thomas M. Cover:
  Achievable rates for multiple descriptions. 851-857
  
• John Douglas Olsen, Robert A. Scholtz, Lloyd R. Welch:
  Bent-function sequences. 858-864
  
• Abraham Lempel, Martin L. Cohn:
  Maximal families of bent sequences. 865-868
  
• Elwyn R. Berlekamp:
  Bit-serial Reed - Solomon encoders. 869-874
  
• Abraham Lempel, Gadiel Seroussi, Jacob Ziv:
  On the power of straight- line computations in finite fields. 875-879
  
• Hatsukazu Tanaka, Alberto Leon-Garcia:
  Efficient run-length encodings. 880-889
  
• Uzi Padan:
  Adaptive digital matched filters. 890-904
  
• Ivan Vrana:
  On a direct method of analysis and synthesis of the SPRT. 905-910
  
• Sawasd Tantaratana, Harold Vincent Poor:
  Asymptotic efficiencies of truncated sequential tests. 911-923
  
• William A. Gardner:
  Structural characterization of locally optimum detectors in terms of locally optimum estimators and correlators. 924-932
  

• Ernst Henze:
  The solution of the general equation for public key distribution systems. 933
  
• Abraham Lempel, Martin L. Cohn:
  Look-ahead coding for input- restricted channels. 933-937
  
• Efren F. Abaya, Gary L. Wise:
  On the existence of optimal quantizers. 937-940
  
• Robert D. Short II, John P. Toomey:
  Detection and estimation of frequency-random signals. 940-946
  
• Dimitri Kazakos:
  Distance measures and estimation performance bounds for continuous-time data. 946-951
  
• Sergio Verdú:
  Comment on 'Anomalous behavior of receiver output SNR as a predictor of signal detection performance exemplified for quadratic receivers and incoherent fading Gaussian channels' by Gardner, W.A.. 952-953
  
• David A. Castañon:
  Reverse-time diffusion processes. 953-956
  
• John E. Shore:
  Cross-entropy minimization given fully decomposable subset and aggregate constraints. 956-961
  
• Jacob Burbea, Calyampudi Radhakrishna Rao:
  On the convexity of higher order Jensen differences based on entropy functions. 961-963
  
• Tarald O. Kvålseth:
  Some informational properties of the lognormal distribution. 963-966
  
• William M. Kantor:
  Independent pairs of good self-dual codes. 966-967
  
• Roland G. Wilson:
  The acceptance of information, its subjective cost and the measurement of distortion. 967-971
  
• Attilio J. Rainal:
  Optimal detection of FM clicks. 971-973
  
• Leonard E. Miller, Jhong S. Lee:
  Bandpass correlator analysis for general input assumptions. 973-977
  
• Anthony J. Weiss, Ehud Weinstein:
  Composite bound on the attainable mean square error in passive time-delay estimation from ambiguity prone signals. 977-979
  

• Michael Joseph Miller:
  Automatic-repeat-request systems for error control in digital transmission (Ph.D. Thesis abstr.). 979
  
• Rushdi H. Muammar:
  Frequency-hopped multilevel frequency shift keying spread spectrum for mobile radio communication systems (Ph.D. Thesis abstr.). 979
  

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