default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIEEE Transactions on Information Theory, Volume 20
Volume 20, Number 1, January 1974
- Aaron D. Wyner:
Recent results in the Shannon theory. 2-10 - Gregory J. Chaitin:
Information-theoretic computation complexity. 10-15 - Carl W. Helstrom, Robert S. Kennedy:
Noncommuting observables in quantum detection and estimation theory. 16-24 - Surapong Chirarattananon, Brian David Outram Anderson:
Stable fixed-lag smoothing of continuous time processes. 25-36 - Pravin C. Jain:
Error probabilities in binary angle modulation. 36-42 - John E. Savage:
Signal detection in the presence of multiple-access noise. 42-49 - Charles R. Cahn:
Phase tracking and demodulation with delay. 50-58 - Peter A. Franaszek:
A deterministic approach to variable-step delta modulation. 58-64 - Robert G. Gallager:
Tree encoding for symmetric sources with a distortion measure. 65-76 - Steven I. Krich, Toby Berger:
Coding for a delay-dependent fidelity criterion. 77-85 - Anthony M. Kerdock, F. Jessie MacWilliams, Andrew M. Odlyzko:
A new theorem about the Mattson-Solomon polynomial, and some applications. 85-89 - Abraham Lempel, Haim Greenberger:
Families of sequences with optimal Hamming-correlation properties. 90-94 - Ian F. Blake:
Configuration matrices of group codes. 95-100 - Gerald B. Lichtenberger:
A note on perfect predictability and analytic processes (Corresp.). 101-102 - Peter E. Caines, Jorma Rissanen:
Maximum likelihood estimation of parameters in multivariate Gaussian stochastic processes (Corresp.). 102-104 - Larry C. Palmer:
Coarse frequency estimation using the discrete Fourier transform (Corresp.). 104-109 - Michael M. Fitelson:
Asymptotic statistics of periodogram-type spectral estimates for the output of nonlinear devices (Corresp.). 109-111 - Joseph C. Hassab:
On the convergence interval of the power cepstrum (Corresp.). 111-112 - Neil J. Bershad, A. Joseph Rockmore:
On estimating signal-to-noise ratio using the sample correlation coefficient (Corresp.). 112-113 - P. J. Buxbaum:
Fixed-memory recursive filters (Corresp.). 113-115 - Ezio Biglieri:
On Glave's upper bound to the error probability for correlated digital signals (Corresp.). 115-119 - Barin Geoffrey Haskell:
Frame-to-frame coding of television pictures using two-dimensional Fourier transforms (Corresp.). 119-120 - R. B. Arps:
Bibliography on digital graphic image compression and quality (Corresp.). 120-122 - Imre Csiszár:
On the computation of rate-distortion functions (Corresp.). 122-124 - S. Smith:
A generalization of Huffman coding for messages with frequencies given by upper and lower bounds (Corresp.). 124-125 - Jean-Pierre Adoul:
Error intervals and cluster density in channel modeling (Corresp.). 125-129 - Harry T. Hsu:
A class of shortened cyclic codes for a compound channel (Corresp.). 129-131 - James L. Massey:
On the fractional weight of distinct binary n -tuples (Corresp.). 131 - Saligram G. S. Shiva, Stafford E. Tavares:
On binary majority-logic decodable codes (Corresp.). 131-133 - Stafford E. Tavares, Vijay K. Bhargava, Saligram G. S. Shiva:
Some rate- p/(p+1) quasi-cyclic codes (Corresp.). 133-135 - Walter Feit:
A self-dual even (96, 48, 16) code (Corresp.). 136-138 - Ian F. Blake:
Permutation codes for discrete channels (Corresp.). 138-140
Volume 20, Number 2, March 1974
- Thomas Kailath:
A view of three decades of linear filtering theory. 146-181 - M. Mohajeri:
A new estimator for an unknown signal imbedded in additive Gaussian noise. 181-189 - Jacob Binia:
On the Epsilon-entropy of certain Gaussian processes. 190-196 - Katalin Marton:
Error exponent for source coding with a fidelity criterion. 197-199 - Izhak Rubin:
Information rates and data-compression schemes for Poisson processes. 200-210 - John B. Anderson:
A stack algorithm for source coding with a fidelity criterion. 211-226 - Frederick Jelinek:
Upper bounds on sequential decoding performance parameters. 227-239 - Carlos R. P. Hartmann, James B. Ducey, Luther D. Rudolph:
On the structure of generalized finite-geometry codes. 240-252 - Chin-Long Chen:
An asymptotic bound on the distance of arithmetic codes. 253-254 - Jun-Ji Lee, David R. Smith:
Families of shift-register sequences with impulsive correlation properties. 255-261 - Bahaa E. A. Saleh:
Probability distribution of time of arrival of photoevents for a stationary optical field (Corresp.). 262-263 - Derek P. Atherton:
On the output autocorrelation function of a single-valued nonlinearity with signal plus noise as input (Corresp.). 263-265 - A. Steele, L. Skattebol:
Asymptotic expressions for the Fredholm determinant for state-variable covariance functions (Corresp.). 265-266 - Francis Castanie, Jean-Claude Hoffmann, Bernard Lacaze:
On the performance of a random reference correlator (Corresp.). 266-269 - Fred Russell Lawson, Clare D. McGillem:
The use of a high sampling rate and ternary quantization to improve the performance of the random reference correlator (Corresp.). 269-271 - William A. Gardner:
A simple solution to smoothing, filtering, and prediction problems using series representations (Corresp.). 271-274 - Chon Tam Le Dinh, Roger Y. Goulet:
Time-sequency-limited signals in finite Walsh transforms (Corresp.). 274-276 - László Györfi:
On the estimation of asymptotic error probability (Corresp.). 277-278 - Steven I. Krich:
Asymptotic properties of delay-time-weighted probability of error (Corresp.). 278-279 - Patrick P. Bergmans:
A simple converse for broadcast channels with additive white Gaussian noise (Corresp.). 279-280 - E. M. Rounds, M. Orsic:
Channel capacity of a finite-state linear automation (Corresp.). 281-283 - C. K. Yuen:
Comments on 'Correction of errors in multilevel Gray coded data' by Mecklenburg, P., et al. 283-284 - J. Pieter M. Schalkwijk, Karel A. Post:
Correction to 'On the Error Probability for a class of Binary Recursive Feedback Strategies'. 284 - Lalit R. Bahl, John Cocke, Frederick Jelinek, Josef Raviv:
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.). 284-287 - Jørn Justesen, Lawrence R. Hughes:
On maximum-distance-separable convolutional codes (Corresp.). 288 - David C. van Voorhis:
Constructing codes with bounded codeword lengths (Corresp.). 288-290 - Bhu Dev Sharma, Bal Kishan Dass:
Extended Varshamov- Gilbert and sphere-packing bounds for burst-correcting codes (Corresp.). 291-292 - Carlos R. P. Hartmann, Kenneth K. Tzeng:
Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.). 292-295 - Steven A. Tretter:
Properties of PN2 sequences (Corresp.). 295-297 - Keith S. Pennington:
Review of 'Introduction to Diffraction, Information Processing, and Holography' (Yu, F. T. S.; 1973). 298 - I. J. Good:
Review of 'Theories of Probability: An Examination of Foundations' (Fine, T. L.; 1973). 298-300 - Stanley L. Adams:
The theory of signal detectability: Extension to optimum arrays (Ph.D. Thesis abstr.). 301 - Lester F. Eastwood Jr.:
Detection theory applied to linear processes (Ph.D. Thesis abstr.). 301 - Samuel Ward Houston:
Bit rate considerations for speech transmission using predictive PCM, differential PCM, and delta modulation (Ph.D. Thesis abstr.). 301-302 - Gorman Thomas Hurst:
Sampling, quantizing, and low signal-to-noise ratio considerations in digital phase-locked loops (Ph.D. Thesis abstr.). 302 - Richard Andrew Jones:
A rate-distortion-theoretic analysis of adaptive predictive coding with speech applications (Ph.D. Thesis abstr.). 302 - Dilip Vishwanath Sarwate:
Weight enumeration of Reed-Muller codes and cosets (Ph.D. Thesis abstr.). 302 - Gary A. Wolf:
The optimum mean-square estimate for decoding binary block codes (Ph.D. Thesis abstr.). 302-303
Volume 20, Number 3, May 1974
- Irwin M. Jacobs:
Practical applications of coding. 305-310 - James C. Tiernan, J. Pieter M. Schalkwijk:
An upper bound to the capacity of the band-limited Gaussian autoregressive channel with noiseless feedback. 311-316 - Patrick P. Bergmans, Thomas M. Cover:
Cooperative broadcasting. 317-324 - Andrew J. Viterbi, Jim K. Omura:
Trellis Encoding of memoryless discrete-time sources with a fidelity criterion. 325-332 - Robert J. Dick, Toby Berger, Frederick Jelinek:
Tree encoding of Gaussian sources. 332-336 - John I. Molinder:
Optimal coding with a single standard run length. 336-343 - Gary A. Wolf, G. Robert Redinbo:
The optimum mean-square estimate for decoding binary block codes. 344-351 - Elwyn R. Berlekamp, Jørn Justesen:
Some long cyclic linear binary codes are not so bad. 351-356 - Daniel J. Costello Jr.:
Free distance bounds for convolutional codes. 356-365 - Richard J. Turyn:
Four-phase Barker codes. 366-371 - Werner Oettli:
Capacity-achieving input distributions for some amplitude-limited channels with additive noise (Corresp.). 372-374 - Carl W. Helstrom:
Quantum Bayes estimation of the amplitude of a coherent signal (Corresp.). 374-376 - Israel Bar-David:
Error probabilities in random-phase binary optical signalling (Corresp.). 376-378 - George G. Ricker, Jack R. Williams:
Averaging logarithms for detection and estimation (Corresp.). 378-382 - Martin E. Hellman:
Finite-memory algorithms for estimating the mean of a Gaussian distribution (Corresp.). 382-384 - Bruno O. Shubert:
Finite-memory classification of Bernoulli sequences using reference samples (Corresp.). 384-387 - Francisco J. Samaniego:
On tests with finite memory in finite time (Corresp.). 387-388 - David M. Mandelbaum:
An adaptive-feedback coding scheme using incremental redundancy (Corresp.). 388-389 - L. van De Meeberg:
A Tightened Upper Bound on the Error Probability of Binary Convolutional Codes with Viterbi Decoding. 389-391 - B. Dorsch:
A decoding algorithm for binary block codes and J -ary output channels (Corresp.). 391-394 - Larry Carter, John Gill:
Conjectures on uniquely decipherable codes (Corresp.). 394-396 - Lloyd R. Welch:
Lower bounds on the maximum cross correlation of signals (Corresp.). 397-399 - William L. Root:
Review of 'Uncertain Dynamic Systems' (Schweppe, F. C.; 1973). 399-400 - King-Sun Fu:
Review of 'Pattern Recognition Techniques' (Ullman, J. R.; 1973). 400 - Wen-Hsiung Chen:
Slant transform image coding (Ph.D. Thesis abstr.). 401 - James Joseph Leybourne:
A theoretical investigation of optical bar code reading techniques for single-channel readers (Ph.D. Thesis abstr.). 401-402 - Adrian Segall:
A martingale approach to modeling, estimation, and detection of jump processes (Ph.D. Thesis abstr.). 402
Volume 20, Number 4, July 1974
- Richard E. Blahut:
Hypothesis testing and information theory. 405-417 - Eugene Wong:
A likelihood ratio formula for two-dimensional random fields. 418-422 - Robert A. Singer, Ronald G. Sea, Kim B. Housewright:
Derivation and evaluation of improved tracking filter for use in dense multitarget environments. 423-432 - Leonard E. Miller, Jhong S. Lee:
The probability density function for the output of an analog cross-correlator with correlated bandpass inputs. 433-440 - Clifford T. Mullis, Richard A. Roberts:
Finite-memory problems and algorithms. 440-455 - David B. Cooper:
When should a learning machine ask for help? 455-471 - Godfried T. Toussaint:
Bibliography on estimation of misclassification. 472-479 - Staffan A. Fredricsson:
Optimum transmitting filter in digital PAM systems with a Viterbi detector. 479-489 - Donald L. Duttweiler, James E. Mazo, David G. Messerschmitt:
An upper bound on the error probability in decision-feedback equalization. 490-497 - George R. Welti, Jhong S. Lee:
Digital transmission with coherent four-dimensional modulation. 497-502 - Robert M. Gray, Lee D. Davisson:
Source coding theorems without the ergodic assumption. 502-516 - Jacob Binia, Moshe Zakai, Jacob Ziv:
On the Epsilon -entropy and the rate-distortion function of certain non-Gaussian processes. 517-524 - James L. Mannos, David J. Sakrison:
The effects of a visual fidelity criterion of the encoding of images. 525-536 - R. Douglas Martin, C. P. McGath:
Robust detection to stochastic signals (Corresp.). 537-541 - Julian R. Ullmann:
Automatic selection of reference data for use in a nearest-neighbor method of pattern classification (Corresp.). 541-543 - Thomas H. E. Ericson, Ulf J. S. Johansson:
A general time-discrete equivalent to a time-continuous Gaussian channel (Corresp.). 544-549 - John C. Kieffer:
A lower bound on the probability of decoding error for the finite-state channel (Corresp.). 549-551 - Sudhakar M. Reddy:
Further results on decoders for Q -ary output channels (Corresp.). 552-554 - D. E. Maracle, Charles T. Wolverton:
Generating cyclically permutable codes (Corresp.). 554-555 - Hideki Imai:
A construction method for path-invariant comma-free codes (Corresp.). 555-559 - David A. Huffman:
A modification of Huffman's impulse-equivalent pulse trains to increase signal energy utilization (Corresp.). 559-561 - Laveen N. Kanal:
Review of 'Markov Processes and Learning Models' (Norman, M. F.; 1972). 562-563
Volume 20, Number 5, September 1974
- James E. Evans:
Chernoff bounds on the error probability for the detection of non-Gaussian signals. 569-577 - Alan S. Willsky:
Fourier series and estimation on the circle with applications to synchronous communication-I: Analysis. 577-583 - Alan S. Willsky:
Fourier series and estimation on the circle with applications to synchronous communication-II: Implementation. 584-590 - David C. Rife, Robert R. Boorstyn:
Single tone parameter estimation from discrete-time observations. 591-598 - John M. Richardson:
Correlation of a signal with an amplitude-distorted form of itself. 598-601 - Siu-Kay Chow, Anastasios N. Venetsanopoulos:
Optimal on-off signaling over linear time-varying stochastic channels. 602-609 - Hans S. Witsenhausen:
Entropy inequalities for discrete channels. 610-616 - Izhak Rubin:
Regular jump processes and their information processing. 617-624 - Robert M. Gray, Lee D. Davisson:
The ergodic decomposition of stationary discrete random processes. 625-636 - J. R. Riek, Carlos R. P. Hartmann, Luther D. Rudolph:
Majority decoding of some classes of binary cyclic codes. 637-643 - Franco P. Preparata, Jürg Nievergelt:
Difference-preserving codes. 643-649 - Davras Yavuz:
Zipf's law and entropy (Corresp.). 650 - Johann F. Böhme:
The cepstrum as a generalized function (Corresp.). 650-653 - Lane H. Brandenburg:
Approximation of finite-energy random processes by continuous processes (Corresp.). 653-654 - Jakov Snyders:
On optimal linear estimation of signals with general spectral distribution (Corresp.). 654-658 - Franklin S. Weinstein:
Simplified relationships for the probability distribution of the phase of a sine wave in narrow-band normal noise (Corresp.). 658-661 - Darrell R. Gimlin:
A parametric procedure for imperfectly supervised learning with unknown class probabilities (Corresp.). 661-663 - Israel Korn:
Probability of error in digital communication systems with intersymbol interference and dependent symbols (Corresp.). 663-668 - C. K. Yuen:
The separability of Gray code (Corresp.). 668 - Izhak Rubin:
Rate-distortion functions for nonhomogeneous Poisson processes (Corresp.). 669-672 - Barry M. Leiner, Robert M. Gray:
Rate-distortion theory for ergodic sources with side information (Corresp.). 672-675 - Thomas S. Huang:
An upper bound on the entropy of run-length coding (Corresp.). 675-676 - Lloyd R. Welch, Robert J. McEliece, Howard Rumsey Jr.:
A low-rate improvement on the Elias bound (Corresp.). 676-678 - Tadao Kasami:
A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.). 679 - Tadao Kasami:
Construction and decomposition of cyclic codes of composite length (Corresp.). 680-683 - Erik Paaske:
Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4 (Corresp.). 683-689 - U. Somaini, Martin H. Ackroyd:
Uniform complex codes with low autocorrelation sidelobes (Corresp.). 689-691 - Frederick Ernest Glave:
Review of 'Telecommunication Systems Engineering' (Lindsey, W. C., and Simon, M. K.; 1973). 692-693 - Lee D. Davisson:
Review of 'Foundations of the Theory of Learning Systems' (Tsypkin, Ya. Z.; 1973). 693 - Jürgen O. Gobien:
Simultaneous detection and estimation: The use of sufficient statistics and reproducing probability densities (Ph.D. Thesis abstr.). 694 - Barry M. Leiner:
Rate-distortion theory for sources with side information (Ph.D. Thesis abstr.). 694 - Nelson D. d'Avilla Mascarenhaus:
Digital image restoration under a regression model: The unconstrained, linear-equality, and inequality-constrained approaches (Ph.D. Thesis abstr.). 694 - Thomas J. Shusta:
Minimal convolutional encoders (Ph.D. Thesis abstr.). 694-695
Volume 20, Number 6, November 1974
- Laveen N. Kanal:
Patterns in pattern recognition: 1968-1974. 697-722 - W. Bennett:
Envelope detection of a unit-index amplitude-modulated cartier accompanied by noise. 723-728 - Izhak Rubin:
Reduced-memory likelihood processing of point processes. 729-738 - Izhak Rubin:
Communication networks: Message path delays. 738-745 - Allen Gersho, David J. Goodman:
A training mode adaptive quantizer. 746-749 - Frederick Jelinek, Kenneth S. Schneider:
Variable-length encoding of fixed-rate Markov sources for fixed-rate channels. 750-755 - Yasuichi Horibe:
On the optimum ratio of word lengths in communication. 756-758 - Gursharan S. Sidhu, Thomas Kailath:
Development of new estimation algorithms by innovations analysis and shift-invariance properties (Corresp.). 759-762 - J. L. Devore:
A note on the observation of a Markov source through a noisy channel (Corresp.). 762-764 - Antonio Cantoni, Ken Kwong:
Further results on the Viterbi algorithm equalizer (Corresp.). 764-767 - William Edwin Clark, Joseph J. Liang:
On modular weight and cyclic nonadjacent forms for arithmetic codes (Corresp.). 767-770 - Philip M. Fishman:
Statistical inference for space-time point processes (D.Sc. Thesis abstr.). 771 - Keun-Young Park:
Nonparametric sequential array processing (Ph.D. Thesis abstr.). 771
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
