![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
IEEE Transactions on Information Theory, Volume 24
Volume 24, Number 1, January 1978
- Dietrich Ryter, Heinrich Meyr:
Theory of phase tracking systems of arbitrary order: Statistics of cycle slips and probability distribution of the state vector. 1-7 - William A. Gardner:
Stationarizable random processes. 8-22 - Sawasd Tantaratana, John B. Thomas:
Relative efficiency of the sequential probability ratio test in signal detection. 22-31 - Marco V. Vaca, Donald L. Snyder:
Estimation and decision for observations derived from martingales: Part II. 32-45 - Howard L. Weinert, Gursharan S. Sidhu:
A stochastic framework for recursive computation of spline functions-Part I: Interpolating splines. 45-50 - Eugene Wong:
Recursive causal linear filtering for two-dimensional random fields. 50-59 - Aydano B. Carleial:
Interference channels. 60-70 - Philippe Delsarte:
Partial-optimal piecewise decoding of linear codes. 70-75 - Jack K. Wolf:
Efficient maximum likelihood decoding of linear block codes using a trellis. 76-80 - Marc R. Best, Andries E. Brouwer, F. Jessie MacWilliams, Andrew M. Odlyzko, Neil J. A. Sloane:
Bounds for binary codes of length less than 25. 81-93 - Tai-Yang Hwang, Carlos R. P. Hartmann:
Some results on arithmetic codes of composite length. 93-99 - Irving S. Reed, Robert A. Scholtz, Trieu-Kien Truong, Lloyd R. Welch:
The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions. 100-106 - Stephen C. Pohlig, Martin E. Hellman:
An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.). 106-110 - Pierre A. Humblet:
Optimal source coding for a class of integer alphabets (Corresp.). 110-112 - Henk C. A. van Tilborg:
An upper bound for codes in a two-access binary erasure channel (Corresp.). 112-116 - A. Brinton Cooper III, Willis C. Gore:
Iterated codes with improved performance (Corresp.). 116-118 - Gary L. Wise, Neal C. Gallagher Jr.:
On spherically invariant random processes (Corresp.). 118-120 - Aida C. G. Verdugo Lazo, Pushpa N. Rathie:
On the entropy of continuous probability distributions (Corresp.). 120-122 - Israel Bar-David, Moshe Levy:
Advent of nonregularity in photon-pulse delay estimation (Corresp.). 122-124 - Demetrios Kazakos:
Computational savings and implementation of maximum likelihood detectors (Corresp.). 124-126 - Athanasios Papoulis:
The problem of transmission zeros in deconvolution (Corresp.). 126-128 - Dilip V. Sarwate:
Comments on "A class of balanced binary sequences with optimal autocorrelation properties" by Lempel, A., et al. 128-129 - Ned Glick:
Correction to 'Sample-Based Classification Procedures Related to Empiric Distributions'. 129 - Shahid U. H. Qureshi:
Correction to 'Fast Start-Up Equalization with Periodic Training Sequences'. 130 - K. B. Lakshmanan:
Decision making with finite memory devices (Ph.D. Thesis abstr.). 134 - Hans Stephen Erik Schloss:
Increasing information rate for Goppa class codes (Ph.D. Thesis abstr.). 134 - Theo Kooij:
Adaptive array processors for sensitivity constrained optimization (Ph.D. Thesis abstr.). 134-135
Volume 24, Number 2, March 1978
- Luc Devroye:
The uniform convergence of nearest neighbor regression function estimators and their application in optimization. 142-151 - Tzay Y. Young, Philip S. Liu:
Linear transformation of binary random vectors and its application to approximating probability distributions. 152-156 - Neal C. Gallagher Jr.:
Quantizing schemes for the discrete Fourier transform of a random time-series. 156-163 - Steven I. Marcus:
Modeling and analysis of stochastic differential equations driven by point processes. 164-172 - Elias Masry:
Poisson sampling and spectral estimation of continuous-time processes. 173-183 - Brian D. O. Anderson:
Covariance factorization via Newton-Raphson iteration. 183-187 - Tadao Kasami, Shu Lin:
Bounds on the achievable rates of block coding for a memoryless multiple-access channel. 187-197 - Yasuo Sugiyama, Masao Kasahara, Shigeichi Hirasawa, Toshihiko Namekawa:
A new class of asymptotically good codes beyond the Zyablov bound. 198-204 - Hideo Murakami, Irving S. Reed:
Multichannel convolutional coding systems over a direct sum of Galois fields. 205-212 - Gianfranco L. Cariolaro:
Error probability in digital fiber optic communication systems. 213-221 - H. Vincent Poor, John B. Thomas:
Asymptotically robust quantization for detection. 222-229 - Demetrios Kazakos:
Quantization complexity and training sample size in detection. 229-237 - Ingemar Ingemarsson:
Toward a theory of unknown functions (Corresp.). 238-240 - Athanasios Papoulis:
Identification of systems driven by nonstationary noise (Corresp.). 240-244 - K. B. Lakshmanan, B. Chandrasekaran:
On finite memory solutions to the two-armed bandit problem (Corresp.). 244-248 - Robert P. W. Duin, Chris E. van Haersma Buma, L. Roosma:
On the evaluation of independent binary features (Corresp.). 248-249 - Wlodzimierz Greblicki
:
Asymptotically optimal pattern recognition procedures with density estimates (Corresp.). 250-251 - M. H. A. Davis:
A direct proof of innovations/observations equivalence for Gaussian procedures (Corresp.). 252-254 - John L. Brown Jr.:
On mean-square aliasing error in the cardinal series expansion of random processes (Corresp.). 254-256 - Tor Helleseth:
All binary 3-error-correcting BCH codes of length 2m-i have covering radius 5 (Corresp.). 257-258 - John P. Robinson:
An asymmetric error-correcting ternary code (Corresp.). 258-261 - Ian B. Gibson, Ian F. Blake:
Decoding the binary Golay code with miracle octad generators (Corresp.). 261-264 - Rolf Johannesson, Erik Paaske:
Further results on binary convolutional codes with an optimum distance profile (Corresp.). 264-268 - David M. Mandelbaum:
Addition to 'A Method for Decoding of Generalized Goppa Codes'. 268 - Stanislav B. Kesler, Simon Haykin:
The maximum entropy method applied to the spectral analysis of radar clutter (Corresp.). 269-272 - Irving Kanter:
Three theorems on the moments of the monopulse ratio (Corresp.). 272-276 - Teofilo C. Ancheta Jr.:
Bounds and techniques for linear source coding (Ph.D. Thesis abstr.). 276 - Farhad Hemmati:
Convolutional code structure and the performance of the Viterbi algorithm (Ph.D. Thesis abstr.). 276-277 - Yoon Hong:
Decoding of block codes on multilevel quantized channels (Ph.D. Thesis abstr.). 277 - Henricus Franciscus Albertus Roefs:
Binary sequences for spread-spectrum multiple-access communication (Ph.D. Thesis abstr.). 277
Volume 24, Number 3, May 1978
- R. L. Kashyap:
Optimal feature selection and decision rules in classification problems with time series. 281-288 - Marco V. Vaca, Steven A. Tretter:
Optimal estimation for discrete time jump processes. 289-296 - T. T. Kadota:
Optimal, causal, simultaneous detection and estimation of random signal fields in a Gaussian noise field. 297-308 - Saleem A. Kassam:
Locally robust array detectors for random signals. 309-316 - Elias Masry:
Alias-free sampling: An alternative conceptualization and its applications. 317-324 - Moshe Ben-Bassat, Josef Raviv:
Renyi's entropy and the probability of error. 324-331 - Sik K. Leung-Yan-Cheong, Thomas M. Cover:
Some equivalences between Shannon entropy and Kolmogorov complexity. 331-338 - Imre Csiszár, János Körner:
Broadcast channels with confidential messages. 339-348 - Kenneth M. Mackenthun Jr., Michael B. Pursley:
Variable-rate universal block source coding subject to a fidelity constraint. 349-360 - David L. Neuhoff, Paul C. Shields:
Fixed-rate universal codes for Markov sources. 360-367 - Hoi M. Leung, Stamatis Cambanis:
On the rate distortion functions of spherically invariant vectors and sequences. 367-373 - Hiroshi Sato:
An outer bound to the capacity region of broadcast channels (Corresp.). 374-377 - Hiroshi Sato:
On the capacity region of a discrete two-user channel for strong interference (Corresp.). 377-379 - Abbas El Gamal:
The feedback capacity of degraded broadcast channels (Corresp.). 379-381 - Hideaki Sakai, Takashi Soeda, Hidekatsu Tokumaru:
Optimal linear coding schemes for feedback communication with noisy side information (Corresp.). 381-384 - Elwyn R. Berlekamp, Robert J. McEliece, Henk C. A. van Tilborg:
On the inherent intractability of certain coding problems (Corresp.). 384-386 - F. Surböck, H. Weinrichter:
Interlacing properties of shift-register sequences with generator polynomials irreducible over GF(p) (Corresp.). 386-389 - Jorma Rissanen:
Minimax codes for finite alphabets (Corresp.). 389-392 - W. G. Waller, Anil K. Jain:
On the monotonicity of the performance of Bayesian classifiers (Corresp.). 392-394 - Robert P. W. Duin:
The mean recognition performance for independent distributions (Corresp.). 394-395 - E. Peters, Joseph S. Boland III, Lewis J. Pinson, William W. Malcolm:
Quantization effects on signal matching functions (Corresp.). 395-398 - R. W. Miller, Chow Chang:
A modified Cramér-Rao bound and its applications (Corresp.). 398-400
Volume 24, Number 4, July 1978
- Jacob Ziv:
Coding theorems for individual sequences. 405-412 - Thomas M. Cover, Roger C. King:
A convergent gambling estimate of the entropy of English. 413-421 - Ray J. Solomonoff:
Complexity-based induction systems: Comparisons and convergence theorems. 422-432 - John C. Kieffer:
Block coding for an ergodic source relative to a zero-one valued fidelity criterion. 432-438 - Gary Promhouse, Stafford E. Tavares:
The minimum distance of all binary cyclic codes of odd lengths from 69 to 99. 438-442 - Pierre R. Chevillat, Daniel J. Costello Jr.:
An analysis of sequential decoding for specific time-invariant convolutional codes. 443-451 - Sik K. Leung-Yan-Cheong, Martin E. Hellman:
The Gaussian wire-tap channel. 451-456 - John F. Pieper, John G. Proakis, Roger R. Reed, Jack K. Wolf:
Design of efficient coding and modulation for a Rayleigh fading channel. 457-468 - Thomas Kailath, Bernard C. Levy, Lennart Ljung, Martin Morf:
Fast time-invariant implementations of Gaussian signal detectors. 469-477 - Paul Kersten, Ludwik Kurz:
Improved operation of m-interval detectors by optimum signal selection. 477-484 - Stamatis Cambanis, Elias Masry:
On the reconstruction of the covariance of stationary Gaussian processes observed through zero-memory nonlinearities. 485-494 - Roger J. Camrass, Robert G. Gallager:
Encoding message lengths for data transmission (Corresp.). 495-496 - Edward F. Assmus Jr., Harold F. Mattson Jr.:
The weight-distribution of a coset of a linear code (Corresp.). 497 - Irving S. Reed, Trieu-Kien Truong, Lloyd R. Welch:
The fast decoding of Reed-Solomon codes using Fermat transforms (Corresp.). 497-499 - Kung Yao, Harry H. Tan:
Absolute error rate-distortion functions for sources with constrained magnitudes (Corresp.). 499-503 - Bradley W. Dickinson:
Autoregressive estimation using residual energy ratios (Corresp.). 503-506 - Dennis Crippen Gilliland, Merrilee Kathryn Helmers:
On continuity of the Bayes response (Corresp.). 506-508 - Demetrios Kazakos:
On the maximization of divergence (Corresp.). 509 - László Györfi:
On the rate of convergence of nearest neighbor rules (Corresp.). 509-512 - László Györfi, Zoltán Györfi:
An upper bound on the asymptotic error probability on the k-nearest neighbor rule for multiple classes (Corresp.). 512-514 - T. Mimaki, T. Munakata:
Experimental results on the level-crossing intervals of Gaussian processes (Corresp.). 515-519
Volume 24, Number 5, September 1978
- Ralph C. Merkle, Martin E. Hellman:
Hiding information and signatures in trapdoor knapsacks. 525-530 - Jacob Ziv, Abraham Lempel:
Compression of individual sequences via variable-rate coding. 530-536 - Robert A. Scholtz, Lloyd R. Welch:
Group characters: Sequences with good correlation properties. 537-545 - R. Sivaswamy:
Multiphase Complementary Codes. 546-552 - Joost Schalkwijk, A. J. Han Vinck, Karel A. Post:
Syndrome decoding of binary-rate k/n convolutional codes. 553-562 - John E. Savage, Sowmitri Swamy:
Space-time trade-offs on the FFT algorithm. 563-568 - Chris Heegard, Hugo E. dePedro, Jack K. Wolf:
Permutation codes for the Gaussian broadcast channel with two receivers. 569-578 - Izhak Rubin:
Group random-access disciplines for multi-access broadcast channels. 578-592 - János Aczél:
Some Recent Results on characterizations of Measures of Information Related to Coding. 592-595 - E. Brian Davies:
Information and quantum measurement. 596-599 - Keinosuke Fukunaga, Robert D. Short II:
Nonlinear feature extraction with a general criterion function. 600-607 - Joseph L. Hibey, Donald L. Snyder, Jan H. van Schuppen:
Error-probability bounds for continuous-time decision problems. 608-622 - Nachum Shacham, Israel Bar-David:
Optimum orthogonal quantization of signal space (Corresp.). 623-626 - Tor Helleseth, Torleiv Kløve, Johannes Mykkeltveit:
On the covering radius of binary codes (Corresp.). 627-628 - Henk C. A. van Tilborg:
On quasi-cyclic codes with rate l m (Corresp.). 628-630 - Vijay K. Bhargava, Gérald E. Séguin, Jack M. Stein:
Some (ink, k) cyclic codes in quasi-cyclic form (Corresp.). 630-632 - Elwyn R. Berlekamp, John L. Ramsey:
Readable erasures improve the performance of Reed-Solomon codes (Corresp.). 632-633 - Tadao Kasami, Shu Lin:
Decoding of linear Delta -decodable codes for a multiple- access channel (Corresp.). 633-635 - M. A. Deaett, Jack K. Wolf:
Some very simple codes for the nonsynchronized two-user multiple-access adder channel with binary inputs (Corresp.). 635-636 - Hiroshi Sato:
On degraded Gaussian two-user channels (Corresp.). 637-640 - Ferruccio Barsi, Piero Maestrini
:
Improved decoding algorithms for arithmetic residue codes (Corresp.). 640-643 - David M. Mandelbaum:
Further results on decoding arithmetic residue codes (Corresp.). 643-644 - Charles R. Cahn, Donald K. Leimer:
Threshold reduction for demodulating a BPSK suppressed-carrier signal (Corresp.). 645-649 - Marek Kanter:
Information inequalities for the sum of independent random vectors (Corresp.). 649-650 - Demetrios Kazakos:
On the optimal linear feature (Corresp.). 651-652 - Nagwa Esmat Bekir:
Bounds on the distribution of partial correlation for PN and Gold sequences (Ph.D. Thesis abstr.). 653 - Joseph R. Breton:
A general theory of acoustic propagation with applications to strong acoustic scattering in the atmosphere and ocean (Ph.D. Thesis abstr.). 653 - José Roberto Boisson de Marca:
Recursive decoders for convolutional codes transmitted over burst channels (Ph.D. Thesis abstr.). 653 - John Douglas Olsen:
Nonlinear binary sequences with asymptotically optimum periodic cross-correlation (Ph.D. Thesis abstr.). 653 - H. Vincent Poor:
Topics in optimal and robust detection: Quantization, stochastic-signal detection, and memoryless detection (Ph.D. Thesis abstr.). 654
Volume 24, Number 6, November 1978
- Horace P. Yuen, Jeffrey H. Shapiro:
Optical communication with two-photon coherent states-Part I: Quantum-state propagation and quantum-noise. 657-668 - Robert G. Gallager:
Variations on a theme by Huffman. 668-674 - John C. Kieffer:
A unified approach to weak universal source coding. 674-682 - William A. Pearlman
, Robert M. Gray:
Source coding of the discrete Fourier transform. 683-692 - D. K. Sharma:
Design of absolutely optimal quantizers for a wide class of distortion measures. 693-702 - John B. Anderson, Desmond P. Taylor:
A bandwidth-efficient class of signal-space codes. 703-712 - A. V. Kuznetsov, Tadao Kasami, Saburo Yamamura:
An error correcting scheme for defective memory. 712-718 - Shojiro Sakata:
General theory of doubly periodic arrays over an arbitrary finite field and its applications. 719-730 - Jacobus H. van Lint, F. Jessie MacWilliams:
Generalized quadratic residue codes. 730-737 - Vera Pless:
The children of the (32, 16) doubly even codes. 738-746 - Dimitri Kazakos:
The Bhattacharyya distance and detection between Markov chains. 747-754 - B. Chandrasekaran, K. B. Lakshmanan:
Finite memory multiple hypothesis testing: Close-to-optimal schemes for Bernoulli problems. 755-759 - James George Dunham:
A note on the abstract alphabet block source coding with a fidelity criterion theorem (Corresp.). 760 - Charles P. Downey, John K. Karlof:
Optimal [M, 3] group codes for the Gaussian channel (Corresp.). 760-761 - E. D. Banta:
A class of nonlinear block codes using the logical Hadamard transform to achieve virtually identical encoding and decoding (Corresp.). 761-763 - Makoto Tatebayashi, Masao Kasahara, Toshihiko Namekawa:
Error statistics and construction of error correcting codes for differentially encoded CPSK channels (Corresp.). 763-766 - Chin-Long Chen:
Equivalent irreducible Goppa codes (Corresp.). 766-769 - Moshe Ben-Bassat:
Epsilon -equivalence of feature selection rules (Corresp.). 769-772 - Ian T. Young:
Further consideration of sample and feature size (Corresp.). 773-775 - Steven I. Marcus, K. Kohanbash:
Fourier series and estimation: An application to optical phase tracking (Corresp.). 775-779 - Hossein Ghandeharian, Michael P. Beddoes:
Autocorrelation of output of memoryless nonlinear devices with arbitrary characteristics (Corresp.). 779-782 - Robert P. W. Duin:
Correction to 'The Mean Recognition performance for Independent Distribution'. 782 - Ming Chang:
Rate-distortion with a fully informed decoder and partially informed encoder (Ph.D. Thesis abstr.). 786 - Alain Crolotte:
Memory versus error tradeoffs in question-answering systems (Ph.D. Thesis abstr.). 786 - Carol Ann Niznik:
Measures of congestion for computer communication networks (Ph.D. Thesis abstr.). 786-787 - Woo-Hyun Paik:
Optical frequency hopping for high data rate optical communication through scattering channels (Ph.D. Thesis abstr.). 787 - Sui Tung:
Multiterminal source coding (Ph.D. Thesis abstr.). 787 - Christopher Chi-Hsun Yu:
Efficient decoding algorithms for linear codes on soft-quantized channels (Ph.D. Thesis abstr.). 787
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.