default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIEEE Transactions on Information Theory, Volume 30
Volume 30, Number 1, January 1984
- Hanoch Lev-Ari, Thomas Kailath:
Lattice filter parameterization and modeling of nonstationary processes. 2-15 - C. C. Lee, John B. Thomas:
A modified sequential detection procedure. 16-22 - Marat V. Burnashev
:
A new lower bound for the a-mean error of parameter transmission over the white Gaussian channel. 23-34 - Te Sun Han:
A general coding scheme for the two-way channel. 35-43 - Robert J. McEliece, Wayne E. Stark:
Channels with block interference. 44-53 - Robert M. Gray, F. Saadat:
Block source coding theory for asymptotically mean stationary sources. 54-67 - János Körner:
OPEC or a basic problem in source networks. 68-77 - Adam Krzyzak, Miroslaw Pawlak:
Distribution-free consistency of a nonparametric kernel regression estimate and classification. 78-81
- Rolf J. Blom:
An Upper Bound on the Key Equivocation for Pure Ciphers. 82-84 - Matti J. Aaltonen:
Notes on the asymptotic behavior of the information rate of block codes. 84-85 - B. K. Bhattaeharya, Hossam A. ElGindy:
A new linear convex hull algorithm for simple polygons. 85-88 - Alberto Leon-Garcia, Hatsukazu Tanaka:
Noiseless coding of binary finite-order Markov sources. 88-91 - Adam Krzyzak, Miroslaw Pawlak:
Almost everywhere convergence of a recursive regression function estimate and classification. 91-93 - Richard G. Casey, George Nagy:
Decision tree design using a probabilistic model. 93-99 - Jean Conan:
On the distance properties of Paaske's class of rates 2/3 and 3/4 convolutional codes. 100-104 - Yoshio Yamada, Saburo Tazaki, Masao Kasahara, Toshihiko Namekawa:
Variance mismatch of vector quantizers. 104-107 - James A. Bucklew:
Multidimensional digitization of data followed by a mapping. 107-110 - Roberto Padovani, Jack K. Wolf:
Poor error correction codes are poor error detection codes. 110-111 - Kei Takikawa:
Fast progressive reconstruction of a transformed image. 111-117 - Thomas L. Marzetta, Stephen W. Lang:
Power spectral density bounds. 117-122 - Attilio J. Rainal:
Power spectrum of FM clicks. 122-124 - Alfred M. Bruckstein:
On the invariant measures of some discrete-time Markov processes. 125-126 - F. Alberto Grünbaum:
A remark on radar ambiguity functions. 126-127
Volume 30, Number 2, March 1984
- Odile Macchi:
Guest Editorial by Odile M. Macchi, Member IEEE. 131-133
- M. Watanabe:
The 2r th mean convergence of adaptive filters with stationary dependent random variables. 134-139 - M. Metivier, Pierre Priouret:
Applications of a Kushner and Clark lemma to general classes of stochastic algorithms. 140-150 - Lennart Ljung:
Analysis of stochastic gradient algorithms for linear regression problems. 151-160 - Odile Macchi, Eweda Eweda:
Convergence analysis of self-adaptive equalizers. 161-176 - Harold J. Kushner, Adam Shwartz:
Weak convergence and asymptotic properties of adaptive filters with constant gains. 177-182 - Robert R. Bitmead:
Persistence of excitation conditions and the convergence of adaptive schemes. 183-190 - Allen Gersho:
Adaptive filtering with binary reinforcement. 191-198 - Henri Clergeot:
Filter-order selection in adaptive maximum likelihood estimation. 199-210 - Bernard Widrow, Eugene Walach:
On the statistical efficiency of the LMS algorithm with nonstationary inputs. 211-221 - Hanoch Lev-Ari, Thomas Kailath, John M. Cioffi:
Least-squares adaptive lattice and transversal filters: A unified geometric theory. 222-236 - C. Richard Johnson Jr.:
Adaptive IIR filtering: Current results and open issues. 237-250 - I. D. Landau:
A feedback system approach to adaptive filtering. 251-261 - László Györfi:
Adaptive linear procedures under general conditions. 262-267 - Victor B. Lawrence, Tong L. Lim:
The effect of bias on the linear canceller. 268-274 - Eugene Walach, Bernard Widrow:
The least mean fourth (LMF) adaptive algorithm and its family. 275-282 - Benjamin Friedlander, Julius O. Smith III:
Analysis and performance evaluation of an adaptive notch filter. 283-298 - Shigeichi Hirasawa, Masao Kasahara, Yasuo Sugiyama, Toshihiko Namekawa:
Modified product codes. 299-305 - John G. Cleary, Ian H. Witten:
A comparison of enumerative and adaptive codes. 306-315 - Kenneth S. Vastola, Harold Vincent Poor:
Robust Wiener-Kolmogorov theory. 316-327 - Sergio Verdú, Harold Vincent Poor:
On minimax robustness: A general approach and applications. 328-340 - James A. Bucklew:
Two results on the asymptotic performance of quantizers. 341-347 - Jacob Ziv:
Fixed-rate encoding of individual sequences with side information. 348-352 - G. L. Katsman, Michael A. Tsfasman, Serge G. Vladut:
Modular curves and codes with a polynomial construction. 353-355 - Sherman Stein:
Packings of Rn by certain error spheres. 356-363 - W. Hamaker, Sherman Stein:
Combinatorial packings of R3 by certain error spheres. 364-368 - Thomas M. Cover:
An algorithm for maximizing expected log investment return. 369-373
- Kenneth S. Vastola, Harold Vincent Poor:
On the p-point uncertainty class. 374-376 - Helmut Jürgensen:
A note on the Arimoto-Blahut algorithm for computing the capacity of discrete memoryless channels. 376-377 - Shunsuke Ihara:
Maximum entropy spectral analysis and ARMA processes. 377-380 - Alexander V. Trushkin:
Monotony of Lloyd's method II for log-concave density and convex error weighting function. 380-383 - Ian W. McKeague:
On the converse to the coding theorem for the continuous time white Gaussian channel with feedback. 383-385 - J. F. Huang, Saligram G. S. Shiva, Gérald E. Séguin:
On certain projective geometry codes. 385-388 - Torleiv Kløve:
The probability of undetected error when a code is used for error correction and detection. 388-392 - L. M. H. E. Driessen:
On an infinite series of [4n, 2n] binary codes. 392-395 - Tor Helleseth:
Further classifications of codes meeting the Griesmer bound. 395-403 - Gerard F. M. Beenker:
A note on extended quadratic residue codes over GF(9) and their ternary images. 403-405 - J. C. C. M. Remijn, Cornelis de Vroedt:
The minimum distance of the [38, 19] ternary extended QR-code is 11. 405-407 - Don Coppersmith, Gadiel Seroussi:
On the minimum distance of some quadratic residue codes. 407-411 - Shih-Chun Chang:
Further results on coding for T-user multiple-access channels. 411-415 - Don R. Halverson, Gary L. Wise:
Asymptotic memoryless discrete-time detection of phi-mixing signals in phi-mixing noise. 415-417 - Kiran M. Rege:
Min-max linear estimation of band-limited sequences in the presence of random noise. 417-420 - Don R. Halverson, Gary L. Wise:
Approximately optimal memoryless detection of random signals in dependent noise. 420-424 - Doan B. Hoang, Tomy M. J. Ng:
Optimal smoother for discrete time point processes with finite-state Markov rate. 425-429 - Chong-Yung Chi, Jerry M. Mendel:
Improved maximum-likelihood detection and estimation of Bernoulli-Gaussian processes. 429-435 - Gianfranco L. Pierobon:
Codes for zero spectral density at zero frequency. 435-439 - Thomas P. McGree, George R. Cooper:
Upper bounds and construction techniques for signal sets with constrained synchronous correlation and specified time-bandwidth product. 439-443 - Ezio Biglieri:
Probability of error for digital systems with inaccurately known interference. 443-446 - Victor A. Vilnrotter, Eugene R. Rodemich:
A generalization of the near-optimum binary coherent state receiver concept. 446-450
- P. Vijay Kumar:
On bent sequences and generalized bent functions (Ph.D. thesis abstr.). 450-
Volume 30, Number 3, May 1984
- Israel Bar-David, Gideon Kaplan:
Information rates of photon-limited overlapping pulse position modulation channels. 455-463 - Edward C. Posner, A. L. Rubin:
The capacity of digital links in tandem. 464-469 - Amos Fiat, Adi Shamir:
Generalized 'write-once' memories. 470-479 - Tuvi Etzion, Abraham Lempel:
Algorithms for the generation of full-length shift-register sequences. 480-484 - Nariman Farvardin, James W. Modestino:
Optimum quantizer performance for a class of non-Gaussian memoryless sources. 485-496 - David Haccoun:
A branching process analysis of the average number of computations of the stack algorithm. 497-508 - Göran Lindell, Carl-Erik W. Sundberg, Tor Aulin:
Minimum Euclidean distance for combinations of short rate 1/2 convolutional codes and CPFSK modulation. 509-519 - S. M. Krone, Dilip V. Sarwate:
Quadriphase sequences for spread-spectrum multiple-access communication. 520-528 - George V. Moustakides, John B. Thomas:
Min-max detection of weak signals in phi-mixing noise. 529-537
- Victor K.-W. Wei:
An error-trapping decoder for nonbinary cyclic codes. 538-541 - Unjeng Cheng:
On the continued fraction and Berlekamp's algorithm. 541-544 - Wil J. van Gils:
Linear unequal error protection codes from shorter codes. 544-546 - David M. Mandelbaum:
Reducing the number of operations in certain finite-field transforms. 546-547 - Valdemar Cardoso da Rocha Jr.:
Maximum distance separable multilevel codes. 547-548 - Robert A. Scholtz, Lloyd R. Welch:
GMW sequences. IEEE Trans. Inf. Theory 30(3): 548- (1984) - S. A. Townes, John Ben O'Neal Jr.:
Permutation codes for the Laplacian source. 553-559 - William A. Pearlman, A. Chekima:
Source coding bounds using quantizer reproduction levels. 559-567 - Hsueh-Ming Hang, John W. Woods:
Near merging of paths in suboptimal tree searching. 567-573 - Giovanni Corsini, Enzo Dalle Mese, G. Marchetti, Lucio Verrazzani:
Comments on 'On a direct method of analysis and synthesis of the SPRT' by I. Vrana. 573-574 - Julia Abrahams:
Ramp crossings for Slepian's process. 574-575 - Benjamin Friedlander:
On the Cramer-Rao bound for time delay and Doppler estimation. 575-580
Volume 30, Number 4, July 1984
- Dilip V. Sarwate:
In Memoriam: Robert Tienwen Chien (1931-1983). 583-586
- Don Coppersmith:
Fast evaluation of logarithms in fields of characteristic two. 587-593 - Andrew M. Odlyzko:
Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme. 594-600 - Yvo Desmedt, Joos Vandewalle, René Govaerts:
A critical analysis of the security of knapsack public-key algorithms. 601-610 - Tuvi Etzion, Abraham Lempel:
On the distribution of de Bruijn sequences of given complexity. 611-614 - Aaron D. Wyner, Henry J. Landau:
Optimum waveform signal sets with amplitude and energy constraints. 615-622 - Lawrence H. Ozarow:
The capacity of the white Gaussian multiple access channel with feedback. 623-628 - Jorma Rissanen:
Universal coding, information, prediction, and estimation. 629-636 - Philippe Piret:
Multiple-word correcting convolutional codes. 637-643 - Patrick M. Dewilde, Harry Dym:
Lossless inverse scattering, digital filters, and estimation theory. 644-661
- Philippe Delsarte, Yves G. Kamp:
Relationship between the Karhunen-Loéve transform and the Courant-Fischer theorem. 662-664 - Jørn Justesen, Tom Høholdt:
Maxentropic Markov chains. 665-667 - Lawrence H. Ozarow, Sik K. Leung-Yan-Cheong:
An achievable region and outer bound for the Gaussian broadcast channel with feedback. 667-671 - Nelson M. Blachman:
The continued fraction as an information source. 671-674 - Cheng-Tie Chen, Saleem A. Kassam:
Robust Wiener filtering for multiple inputs with channel distortion. 674-677 - Wojciech J. Kolodziej, Ronald R. Mohler:
Analysis of a new nonlinear filter and tracking methodology. 677-681 - Erdal Arikan:
Some complexity results about packet radio networks. 681-685 - Dilip V. Sarwate:
An upper bound on the aperiodic autocorrelation function for a maximal-length sequence. 685-687 - Thomas J. Ferguson, J. H. Rabinowitz:
Self-synchronizing Huffman codes. 687-693
- Toby Berger:
Review of Information Theory: Coding Theorems for Discrete Memoryless Systems (Csiszár, I., and Körner, J.; 1981). 693-694 - Eric Dubois, Amar Mitiche:
Review of 'Digital Picture Processing, ' 2nd edn. (Rosenfeld, A., and Kak, A.C.; 1982). 694 - Neil J. A. Sloane:
Review of 'Secure Communications and Asymmetric Cryptosystems' (Simmons, G.J., Ed.; 1982). 694-
Volume 30, Number 5, September 1984
- Adi Shamir:
A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem. 699-704 - Tuvi Etzion, Abraham Lempel:
Construction of de Bruijn sequences of minimal complexity. 705-708 - Jeffrey S. Leon, John Myron Masley, Vera Pless:
Duadic Codes. 709-713 - Nandakumar N. Tendolkar, Carlos R. P. Hartmann:
Generalization of chase algorithms for soft decision decoding of binary linear codes. 714-721 - Morton Kanefsky, Chung-Bin Fong:
Predictive source coding techniques using maximum likelihood prediction for compression of digitized images. 722-727 - Georg Lindgren:
Shape and duration of clicks in modulated FM transmission. 728-735 - Rangasami L. Kashyap:
Characterization and estimation of two-dimensional ARMA models. 736-744 - Nader Mehravari, Toby Berger:
Poisson multiple-access contention with binary feedback. 745-751
- Prodip Sen:
On noiseless source coding with specified encoder output symbol frequencies. 752-754 - K. Deimer:
Some new bounds for the maximum length of circuit codes. 754-756 - Ashok K. Gupta:
A note on the variance of polarity-coincidence correlation with an arbitrary covariance matrix. 756-758 - David M. Mandelbaum:
An approach to an arithmetic analog of Berlekamp's algorithm. 758-762 - Mats L. Cedervall, Rolf Johannesson, Kamil Sh. Zigangirov:
A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes. 762-766 - G. Tenengolts:
Nonbinary codes, correcting single deletion or insertion. 766-769 - Kevin T. Phelps:
A product construction for perfect codes over arbitrary alphabets. 769-771 - Torleiv Kløve:
Generalizations of the Korzhik bound. 771-773 - Mansour Loeloeian, Jean Conan:
A [55, 16, 19] binary Goppa code. 773- - Siu Lun Ma:
A note on binary arrays with a certain window property. 774-775 - Justin M. Reyneri, Ehud D. Karnin:
Coin flipping by telephone. 775-776 - Thomas Siegenthaler:
Correlation-immunity of nonlinear combining functions for cryptographic applications. 776-780 - Shimon Even, Oded Goldreich:
Correction to 'DES-like functions can generate the alternating group' (Nov 83 863-865). 780-
- James E. Mazo:
Review of 'Digital Communications' (Proakis, J.G.; 1983). 780-781
Volume 30, Number 6, November 1984
- A. Robert Calderbank, James E. Mazo:
A new description of trellis codes. 784-791 - Thomas H. E. Ericson:
A min-max theorem for antijamming group codes. 792-799 - Aileen M. McLoughlin:
The complexity of computing the covering radius of a code. 800-804 - Khalid Sayood, Jerry D. Gibson, Martin C. Rost:
An algorithm for uniform vector quantizer design. 805-814 - Andrew B. Martinez, Peter F. Swaszek, John B. Thomas:
Locally optimal detection in multivariate non-Gaussian noise. 815-822 - Boaz Porat, Benjamin Friedlander:
ARMA spectral estimation of time series with missing observations. 823-831 - Louis Auslander, Richard Tolimieri:
Characterizing the radar ambiguity functions. 832-836
- Max H. M. Costa, Thomas M. Cover:
On the similarity of the entropy power inequality and the Brunn-Minkowski inequality. 837-839 - Kenjiro Yanagi:
On the capacity of a class of mismatched Gaussian channels. 840-842 - Frans M. J. Willems:
On multiple access channels with feedback. 842-845 - A. L. Wells Jr.:
A polynomial form for logarithms modulo a prime. 845-846 - M. G. Mulligan, Stephen G. Wilson:
An improved algorithm for evaluating trellis phase codes. 846-851 - John E. Shore:
On a relation between maximum likelihood classification and minimum relative-entropy classification. 851-854 - Philip M. Fishman, L. K. Jones:
Signal convexity and noise convexity of the Chernoff and divergence distances. 854-856 - Don R. Halverson, Gary L. Wise:
A result on neglecting dependence in signal detection. 856-859 - Ashok K. Gupta, W. P. Birkemeier:
Estimation of a quadrature cross-correlation detector by analog, polarity-coincidence, and relay methods. 859-865 - P. Merkey, Edward C. Posner:
Optimum cyclic redundancy codes for noisy channels. 865-867 - Torleiv Kløve:
Using codes for error correction and detection. 868-870 - William O. Alltop:
A method for extending binary linear codes. 871-872 - Rudolf Ahlswede:
Improvements of Winograd's result on computation in the presence of noise. 872-877 - Thomas K. Philips, A. Sahraoui:
A sequence of upper and lower bounds for the Q function. 877-878 - Hanoch Lev-Ari, Thomas Kailath:
Correction to 'Lattice Filter Parametrization and Modeling of Nonstationary Processes'. 878- - Raimundo Sampaio Neto:
Spread-Spectrum Code Tracking in the Presence of Interference. 879- - Kotikalapudi Sriram:
A Study of Multiplexing Schemes for Voice and Data. 879- - Ramanarayanan Viswanathan:
Performance of Frequency-Hopping Spread-Spectrum Mobile Radio Systems. 879-
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 2026-01-28 00:02 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:
