default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIEEE Transactions on Information Theory, Volume 32
Volume 32, Number 1, January 1986
- Abraham Lempel, Jacob Ziv:
Compression of two-dimensional data. 2-8 - Nariman Farvardin, James W. Modestino:
Adaptive buffer-instrumented entropy-coded quantizer performance for memoryless sources. 9-22 - Jacobus H. van Lint, Richard M. Wilson:
On the minimum distance of cyclic codes. 23-40 - John H. Conway, Neil J. A. Sloane:
Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice. 41-50 - Donald E. Knuth:
Efficient balanced codes. 51-53 - Douglas H. Wiedemann:
Solving sparse linear equations over finite fields. 54-62 - Robert F. Pawula, Stephen O. Rice:
On filtered binary processes. 63-72 - Ashok K. Gupta:
Variance expressions for four spectral-centroid estimators of a complex Gaussian process. 73-78 - Miroslaw Pawlak
:
On nonparametric estimation of a functional of a probability density. 79-84 - Sergio Verdú:
Minimum probability of error for asynchronous Gaussian multiple-access channels. 85-96 - George V. Moustakides, John B. Thomas:
Optimum detection of a weak signal with minimal knowledge of dependency. 97-102
- Kevin T. Phelps:
Dual product constructions of Reed-Muller type codes. 103-106 - William Edwin Clark, Joseph J. Liang:
Equidistant binary arithmetic codes. 106-108 - Roy L. Adler, Joel Friedman, Bruce Kitchens, Brian H. Marcus:
State splitting for variable-length graphs. 108-113 - Sergio Verdú:
Asymptotic error probability of binary hypothesis testing for Poisson point-process observations. 113-115 - John S. Sadowsky, James A. Bucklew:
A nonlocal approach for asymptotic memoryless detection theory. 115-120 - Boaz Porat, Benjamin Friedlander:
On the estimation of variance for autoregressive and moving average processes. 120-125 - Nimal Ekanayake:
Binary DPSK transmission over terrestrial and satellite links. 125-129 - Renato M. Capocelli, Alfredo De Santis:
Regular universal codeword sets. 129-133 - J. P. Bleker, Don R. Halverson:
Memoryless detection of time-varying deterministic signals in dependent non-Gaussian noise. 133-137
Volume 32, Number 2, March 1986
- Andres Buzo, Federico Kuhlmann, Carlos Rivera:
Rate-distortion bounds for quotient-based distortions with application to Itakura-Saito distortion measures. 141-147 - Michael J. Sabin, Robert M. Gray:
Global convergence and empirical consistency of the generalized Lloyd algorithm. 148-155 - Baruch Mazor, William A. Pearlman:
A tree coding theorem for stationary Gaussian sources and the squared-error distortion measure. 156-165 - Anader Benyamin-Seeyar, Saligram G. S. Shiva, Vijay K. Bhargava:
Capability of the error-trapping technique in decoding cyclic codes. 166-180 - Chin-Long Chen:
Error-correcting codes for byte-organized memory systems. 181-185 - G. Robert Redinbo, Kotesh K. Rao:
Expediting factor-type fast finite field transform algorithms. 186-194 - James W. Modestino, M. Vedat Eyuboglu:
Integrated multielement receiver structures for spatially distributed interference channels. 195-219 - John S. Sadowsky:
A maximum variance model for robust detection and estimation with dependent data. 220-226 - Rakesh Kumar Bansal, P. Papantoni-Kazakos:
An algorithm for detecting a change in a stochastic process. 227-235 - Patrick L. Brockett, Abraham Charnes, Kwang H. Paick:
Computation of minimum cross entropy spectral estimates: An unconstrained dual convex programming method. 236-242 - Gonzalo R. Arce:
Statistical threshold decomposition for recursive and nonrecursive median filters. 243-253 - Elias Masry:
Recursive probability density estimation for weakly dependent stationary processes. 254-267 - Govind Sharma, Ramalingam Chellappa:
Two-dimensional spectrum estimation using noncausal autoregressive models. 268-275 - D. T. Lee, Arthur K. Lin:
Computational complexity of art gallery problems. 276-282
- Jacobus H. van Lint, Richard M. Wilson:
Binary cyclic codes generated by mira7. 283- - Ron M. Roth, Gadiel Seroussi:
On cyclic MDS codes of length q over GF(q). 284-285 - Din Y. Pei, Charles C. Wang, Jim K. Omura:
Normal basis of finite field GF(2m). 285-287 - Bernard Heilweil:
Proof of Rife and Boorstyn's hypothesis on estimation of parameters of multitone signals. 288-290 - Robert J. Elliott:
Reverse-time Markov processes. 290-292 - Don R. Halverson, Gary L. Wise:
On nonlinearities in asymptotic memoryless detection. 292-296 - Boaz Porat, Yonina Rosen:
The asymptotic Cramer-Rao bound for Gaussian ARMA processes with periodically missing data. 296-298 - Wolfgang K. Härdle:
A note on jackknifing kernel regression function estimators. 298-300 - Peter Spreij:
An on-line parameter estimation algorithm for counting process observations. 300-303 - Mark G. Karpovsky, Lazar A. Trachtenberg:
Statistical and computational performance of a class of generalized Wiener filters. 303-307 - Biing-Hwang Juang, Stephen E. Levinson, M. Mohan Sondhi:
Maximum likelihood estimation for multivariate mixture observations of markov chains. 307-309 - Pierre Comon, Jean-Louis Lacoume:
Noise reduction for an estimated Wiener filter using noise references. 310-313 - João B. Bezerra, Dalton Soares Arantes:
Spectral analysis of Q -ary digital signals encoded by P -ary convolutional codes. 313-319 - Gérald E. Séguin:
Optimal symbol error rate encoding. IEEE Trans. Inf. Theory 32(2): 319- (1986) - Robert J. McEliece, Eugene R. Rodemich, Laif Swanson:
An entropy maximization problem related to optical communication. 322-326 - Neil Judell, Louis L. Scharf:
A simple derivation of Lloyd's classical result for the optimum scalar quantizer. 326-328 - Marc J. Bage:
Lattice quantizers: Entropy reduction by proper tie-handling. 328-330 - Peter F. Swaszek, Tsu W. Ku:
Asymptotic performance of unrestricted polar quantizers. 330-333
Volume 32, Number 3, May 1986
- John H. Conway, Neil J. A. Sloane:
Lexicographic codes: Error-correcting codes from game theory. 337-348 - Gadiel Seroussi, Ron M. Roth:
On MDS extensions of generalized Reed-Solomon codes. 349-354 - Yair Be'ery, Jakov Snyders:
Optimal soft decision block decoders based on fast Hadamard transform. 355-364 - Thomas H. E. Ericson:
The noncooperative binary adder channel. 365-374 - Jerry D. Gibson, Thomas R. Fischer, Boneung Koo:
Preposterior analysis for differential encoder design. 375-382 - Zhen Zhang, Toby Berger, J. Pieter M. Schalkwijk:
New outer bounds to capacity regions of two-way channels. 383-386 - Hirosuke Yamamoto:
On secret sharing communication systems with two or three channels. 387-393 - Yasuo Sugiyama:
An algorithm for solving discrete-time Wiener-Hopf equations based upon Euclid's algorithm. 394-409
- John L. Brown Jr., O. Morean:
Robust prediction of band-limited signals from past samples. 410-412 - Michèle Basseville, Albert Benveniste, George V. Moustakides:
Detection and diagnosis of abrupt changes in modal characteristics of nonstationary digital signals. 412-417 - Byoung-Seon Choi:
An algorithm for solving the extended Yule-Walker equations of an autoregressive moving-average time series. 417-419 - Brad E. Paden:
A matched nonlinearity for phase estimation of a PSK-modulated carrier. 419-422 - Tuvi Etzion:
On the distribution of de Bruijn CR-sequences. 422-423 - Richard A. Games:
The geometry of quadrics and correlations of sequences. 423-426 - Jitendra K. Tugnait:
Recursive parameter estimation for noisy autoregressive signals. 426-430 - Tom Høholdt, Helge Elbrønd Jensen, Jørn Justesen:
Autocorrelation properties of a class of infinite binary sequences. 430-431 - Ian W. McKeague, Charles R. Baker:
The coding capacity of mismatched Gaussian channels. 431-436 - Henk C. A. van Tilborg:
An upper bound for codes for the noisy two-access binary adder channel. 436-440 - Zong-Duo Dai:
Proof of Rueppel's linear complexity conjecture. 440-443 - Jaakko Astola:
A note on perfect arithmetic codes. 443-445 - Katalin Marton:
A simple proof of the blowing-up lemma. 445-446
Volume 32, Number 4, July 1986
- Carl W. Helstrom:
Distribution of the filtered output of a quadratic rectifier computed by numerical contour integration. 450-463 - Henry J. Landau:
Extrapolating a band-limited function from its samples taken in a finite interval. 464-470 - Roger F. Dwyer, Ludwik Kurz:
Characterizing partition detectors with stationary and quasi-stationary Markov dependent data. 471-482 - Martin G. Bello, Alan S. Willsky, Bernard C. Levy, David A. Castañón:
Smoothing error dynamics and their use in the solution of smoothing and mapping problems. 483-495 - Neil L. Gerr, Stamatis Cambanis:
Analysis of a delayed delta modulator. 496-512 - Yaser S. Abu-Mostafa:
The complexity of information extraction. 513-525 - Jorma Rissanen:
Complexity of strings in the class of Markov sources. 526-532 - Rudolf Ahlswede, Imre Csiszár:
Hypothesis testing with communication constraints. 533-542 - Rudolf Ahlswede:
On multiple descriptions and team guessing. 543-549 - Evaggelos Geraniotis:
Robust coding for multiple-access channels. 550-560 - Vera Pless:
Decoding the Golay codes. 561-567 - Thomas R. Fischer:
A pyramid vector quantizer. 568-583 - Edward G. Coffman Jr., Edgar N. Gilbert:
A continuous polling system with constant service times. 584-591
- Erik I. Verriest:
An achievable bound for optimal noiseless coding of a random variable. 592-594 - Ezio Biglieri:
Ungerboeck codes do not shape the signal power spectrum. 595-596 - Moshe Kam, Paul Kalata:
The Gaussian Nonlinearity's Output Power Spectral Density Due to a Sinusoid Plus Band-Limited Noise. 597-601 - Antonio M. Lepschy, Gian Antonio Mian, Umberto Viaro:
Comments, with reply, on 'ARMA spectral estimation of time series with missing observations' by B. Porat and B. Friedlander. 601-602 - Richard A. Games:
An algorithm for complex approximations in Z[e2{pi}i/8]. 603-607 - Kristien de Bruyn, Edward C. van der Meulen:
An iterative code construction and codes generated by permutations for the asymmetric multiple-access channel. 607-612
Volume 32, Number 5, September 1986
- Rudolf Ahlswede:
Arbitrarily varying channels with states sequence known to the sender. 621-629 - Aharon Ben-Tal, Marc Teboulle:
Rate distortion theory with generalized information measures via convex programming duality. 630-641 - Sergio Verdú:
Multiple-access channels with point-process observations: Optimum demodulation. 642-651 - Michael B. Pursley:
Frequency-hop transmission for satellite packet switching and terrestrial packet radio networks. 652-667 - Adam Krzyzak:
The rates of convergence of kernel regression estimates and classification rules. 668-679 - Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane:
Further results on the covering radius of codes. 680-694
- L. Flatto:
On optimal codes for binary asymmetric channels. 695-697 - Gérard D. Cohen, Philippe Godlewski, Frans Merkx:
Linear binary code for write-once memories. 697-700 - Michael J. Adams:
Subcodes and covering radius. 700-701 - Robert J. McEliece, Laif Swanson:
On the decoder error probability for Reed-Solomon codes. 701-703 - Donald W. Newhart:
Inequivalent cyclic codes of prime length. 703-705 - Simon Litsyn, Michael A. Tsfasman:
A note on lower bounds. 705-706 - Toru Fujiwara, Toyoo Takata, Tadao Kasami, Shu Lin:
An approximation to the weight distribution of binary primitive BCH codes with designed distances 9 and 11. 706-709 - Martin Bossert, Ferdinand Hergert:
Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes. 709-714 - Abraham Lempel:
On multiset decipherable codes. 714-716 - Linus M. Blaesser:
Walsh power spectrum for wide-sense stationary stochastic processes. 716-724 - Iwao Sasase, Masanori Shinriki, Shinsaku Mori:
Signal-to-noise ratio of arbitrary power-series envelope detector. 724-728 - Bennett Eisenberg:
The equivalence-singularity problem for Gaussian signals in Gaussian noise. 728-730
Volume 32, Number 6, November 1986
- Frank Thomson Leighton, Ronald L. Rivest:
Estimating a probability using finite memory. 733-742 - Victor Solo:
Modeling of two-dimensional random fields by parametric cepstrum. 743-750 - Carlos C. Rodriguez, John Van Ryzin:
Large sample properties of maximum entropy histograms. 751-759 - Philippe Piret:
Bounds for codes over the unit circle. 760-767 - Khaled A. S. Abdel-Ghaffar, Robert J. McEliece, Andrew M. Odlyzko, Henk C. A. van Tilborg:
On the existence of optimum cyclic burst-correcting codes. 768-775 - Howard H. Ma, Jack K. Wolf:
Binary unequal error-protection block codes formed from convolutional codes by generalized tail-biting. 776-786 - Shu Lin, Victor K.-W. Wei:
Nonhomogeneous Trellis codes for the Quasi-Synchronous Multiple-Access Binary adder channel with Two Users. 787-796 - A. Robert Calderbank, Chris Heegard, Ting-Ann Lee:
Binary convolutional codes with application to magnetic recording. 797-815
- Peter L. Antonelli, Robert J. Elliott:
The Zakai forms of the prediction and smoothing equations. 816-817 - Pierce E. Cantrell:
On the calculation of the generalized Q -function via Parl's method. 817-824 - A. G. Munford:
Moments of a filtered binary process. 824-826 - Philippe Delsarte, Philippe Piret:
Do most binary linear codes achieve the Goblick bound on the covering radius? 826-828 - A. Robert Calderbank:
Nonexistence of a uniformly packed [70, 58, 5] code. 828-833 - W. Cary Huffman:
Decomposing and shortening codes using automorphisms. 833-836 - Mario Blaum, Henk C. A. van Tilborg, Patrick Guy Farrell:
A class of burst error-correcting array codes. 836-839 - Nariman Farvardin, James W. Modestino:
On overflow and underflow problems in buffer-instrumented variable-length coding of fixed-rate memoryless sources. 839-845 - René C. Peralta:
A simple and fast probabilistic algorithm for computing square roots modulo a prime number. 846-847 - Meir Feder:
Maximum entropy as a special case of the minimum description length criterion. 847-849 - Bruce L. Montgomery, Julia Abrahams:
Synchronization of binary source codes. 849-854 - Renato M. Capocelli, Raffaele Giancarlo, Inder Jeet Taneja:
Bounds on the redundancy of Huffman codes. 854-857 - Glen G. Langdon Jr.:
Comments on 'A universal data compression system' by J. Rissanen. 857-
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 2025-04-08 20:49 CEST 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:
