default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIEEE Transactions on Information Theory, Volume 31
Volume 31, Number 1, January 1985
- P. A. B. M. Coebergh van den Braak, Henk C. A. van Tilborg:
A family of good uniquely decodable code pairs for the two-access binary adder channel. 3-9 - Abraham Lempel, Martin Cohn:
Design of universal test sequences for VLSI. 10-17 - G. Robert Redinbo:
Optimum mean-square error use of convolutional codes. 18-33 - Chris Heegard:
On the capacity of permanent memory. 34-41 - Thomas H. E. Ericson:
Exponential error bounds for random codes in the arbitrarily varying channel. 42-48 - Donald E. Knuth:
Deciphering a linear congruential encryption. 49-52 - David L. Neuhoff, K. G. Castor:
A rate and distortion analysis of chain codes for line drawings. 53-68 - Kenneth S. Miller, R. Raghavan, Marvin M. Rochwarger:
Invariance in moving target detection. 69-79 - John T. Rickard:
On the detection theory of autocoherence. 80-89 - Govind Sharma, Ramalingam Chellappa:
A model-based approach for estimation of two-dimensional maximum entropy power spectra. 90-99
- Rolf Johannesson, Kamil Sh. Zigangirov:
On the distribution of the number of computations in any finite number of subtrees for the stack algorithm. 100-102 - H. Peter Gumm:
A new class of check-digit methods for arbitrary number systems. 102-105 - Chin-Long Chen:
Linear codes for masking memory defects. 105-106 - John H. Conway, Neil J. A. Sloane:
A lower bound on the average error of vector quantizers. 106-109
- Robert M. Gray:
Review of 'Ergodic Theory' (Peterson, K.; 1983). 110- - Richard A. Comroe:
An Analysis of ARQ Schemes for Land Mobile Radio Systems. 112 - Farid F. El-Wailly:
Convolutional Code Performance Analysis of Jammed Spread Spectrum Channels without side Information. 112 - Laurent R. Lugand:
ARQ Schemes Using Convolutional codes and Viterbi Decoding over Nonstationary Channels. 112 - Rajeev Sinha:
Channel Access Protocols for Mobile Packet Radio Networks. 112
Volume 31, Number 2, March 1985
- James L. Massey:
Guest editorial (special issue introduction). 117-118
- Norman M. Abramson:
Development of the ALOHANET. 119-123 - Robert G. Gallager:
A perspective on multiaccess channels. 124-142 - Boris S. Tsybakov:
Survey of USSR contributions to random multiple-access communications. 143-165 - Leonard Kleinrock:
On queueing problems in random-access communications. 166-175 - Bruce E. Hajek:
Stochastic approximation methods for decentralized control of multiaccess communications. 176-184 - Jack K. Wolf:
Born again group testing: Multiaccess communications. 185-191 - James L. Massey, Peter Mathys
:
The collision channel without feedback. 192-204 - Karel A. Post:
Convexity of the nonachievable rate region for the collision channel without feedback. 205-206 - Joseph Y. N. Hui, Pierre A. Humblet:
The capacity region of the totally asynchronous multiple-access channel. 207-216 - Peter Mathys, Philippe Flajolet:
Q -ary collision resolution algorithms in random-access systems with free or blocked channel access. 217-243 - Guy Fayolle, Philippe Flajolet, Micha Hofri, Philippe Jacquet:
Analysis of a stack algorithm for random multiple-access communication. 244-254 - Michael A. Kaplan, E. Gulko:
Analytic properties of multiple-access trees. 255-263 - Jian-Cheng Huang, Toby Berger:
Delay analysis of interval-searching contention resolution algorithms. 264-273 - Shivendra S. Panwar, Donald F. Towsley, Jack K. Wolf:
On the throughput of degenerate intersection and first-come first-served collision resolution algorithms. 274-279 - Leonidas Georgiadis, P. Papantoni-Kazakos:
Limited feedback sensing algorithms for the packet broadcast channel. 280-294 - Moshe Sidi, Israel Cidon:
Splitting protocols in presence of capture. 295-301 - János Komlós, Albert G. Greenberg:
An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels. 302-306
Volume 31, Number 3, May 1985
- Frans M. J. Willems, Edward C. van der Meulen:
The discrete memoryless multiple-access channel with cribbing encoders. 313-327 - Gérard D. Cohen, Mark G. Karpovsky, H. F. Mattson Jr., James R. Schatz:
Covering radius - Survey and recent results. 328-343 - Jacob Ziv:
On universal quantization. 344-347 - J. Foster, Robert M. Gray, Mari O. Dunham:
Finite-state vector quantization for waveform coding. 348-359 - S. Natarajan:
Large deviations, hypotheses testing, and source coding for finite Markov chains. 360-365 - Brian H. Marcus:
Sofic systems and encoding data. 366-377 - Lev B. Levitin, Carlos R. P. Hartmann:
A new approach to the general minimum distance decoding problem: The zero-neighbors algorithm. 378-384 - Ronald L. Graham, Neil J. A. Sloane:
On the covering radius of codes. 385-401 - Nariman Farvardin, James W. Modestino:
Rate-distortion performance of DPCM schemes for autoregressive sources. 402-418
- Kristien de Bruyn:
Codes for the asymmetric broadcast channel, generated by permutations. 419-422 - Kristien de Bruyn:
An iterative code construction for the broadcast channel with degraded message sets. 422-428 - Thomas R. Fischer, P. Fred Dahm:
Variance estimation and adaptive quantization. 428-433 - John S. Sadowsky, James A. Bucklew:
On the detectability of weak signals. 433-436 - Philippe Piret:
Binary codes for compound channels. 436-440 - Alfred M. Bruckstein, Thomas Kailath:
Recursive limited memory filtering and scattering theory. 440-443 - Yi-Ching Yao:
Estimation of noisy telegraph processes: Nonlinear filtering versus nonlinear smoothing. 444-446 - Diane E. Downie, Neil J. A. Sloane:
The covering radius of cyclic codes of length up to 31. 446-447
Volume 31, Number 4, July 1985
- Jacob Ziv:
Universal decoding for finite-state channels. 453-460 - Yaser S. Abu-Mostafa, Jeannine-Marie St. Jacques:
Information capacity of the Hopfield model. 461-464 - Peter B. Busschbach, Michiel G. L. Gerretzen, Henk C. A. van Tilborg:
On the covering radius of binary, linear codes meeting the Griesmer bound. 465-468 - Taher El Gamal:
A public key cryptosystem and a signature scheme based on discrete logarithms. 469-472 - Taher El Gamal:
A subexponential-time algorithm for computing discrete logarithms over GF(p2). 473-481 - Tamer Basar, Ying-Wah Wu D.:
A complete characterization of minimax and maximin encoder- decoder policies for communication channels with incomplete statistical description. 482-489 - Cornelis H. Slump, B. J. Hoenders:
The determination of the location of the global maximum of a function in the presence of several local extrema. 490-497 - Stephen W. Lang:
Bounds from noisy linear measurements. 498-508 - Bernard Chazelle:
On the convex layers of a planar set. 509-517
- Michele Elia, Giancarlo Prati:
On the complete decoding of binary linear codes. 518-520 - Philippe Piret:
An upper bound on the weight distribution of some systematic codes. 520-521 - Sirpa Ernvall:
On the modular distance. 521-522 - Don R. Halverson, Gary L. Wise:
An analysis of a nonparametric detection scheme for strong mixing noise. 522-527 - Witold Holubowicz, Pawel Szulakiewicz:
Multi-T realization of multi- h phase codes. 528-529 - Hatsukazu Tanaka, Minoru Ando, Alberto Leon-Garcia:
A unique ranking of multilevel sequences and its application to source coding. 530-537 - Peter F. Swaszek:
Asymptotic performance of Dirichlet rotated polar quantizers. 537-540 - A. J. Han Vinck, Wim L. M. Hoeks, Karel A. Post:
On the capacity of the two-user M -ary multiple-access channel with feedback. 540-543 - Israel Bar-David:
Multiple detection of a slowly fluctuating target. 543-545 - Seymour Shlien:
A geometric description of stable linear predictive coding digital filters. 545-548 - Tom Høholdt, Helge Elbrønd Jensen, Jørn Justesen:
Aperiodic correlations and the merit factor of a class of binary sequences. 549-552
- James L. Massey:
Review of 'Theory and Practice of Error Control Codes' (Blahut, R.E.; 1983). 553-554 - M. J. Carter:
Source coding of composite sources (Ph.D. Abstr.). 555 - Bernard Heilweil:
Direction estimation for multiple remote sources (Ph.D. Abstr.). 555 - Howard H. Ma:
Generalized tail-biting convolutional codes (Ph.D. Abstr.). 555- - Jiapeng Gao:
Iteratively maximum likelihood decodable spherical codes (Ph.D. Abstr.). 556 - Alexander A. Georgiev:
Nonparametric models for static and dynamic systems (Ph.D. Abstr.). 556 - R. Kent Gilbert:
Causal encoding of Markov sources (Ph.D. Abstr.). 556 - Mansour Loeloeian:
Application of finite Fourier transforms to generalized Goppa codes (Ph.D. Abstr.). 556 - Jian-Cheng Huang:
Interval-searching algorithms for multiple-access contention resolution: Delay and throughput (Ph.D. Abstr.). 557 - Sergio Verdú:
Optimum multiuser signal detection (Ph.D. Abstr.). 557 - Zhen Zhang:
New results in binary multiple descriptions (Ph.D. Abstr.). 557 - Flavio Bonomi:
Problems in the information of random fields (Ph.D. Abstr.). 558
Volume 31, Number 5, September 1985
- Richard A. Games:
Complex approximations using algebraic integers. 565-579 - John H. Cozzens, Larry A. Finkelstein:
Computing the discrete Fourier transform using residue number systems in a ring of algebraic integers. 580-588 - Calyampudi Radhakrishna Rao, Tapas K. Nayak:
Cross entropy, dissimilarity measures, and characterizations of quadratic entropy. 589-593 - K. E. Grue:
Optimal reconstruction of bandlimited bounded signals. 594-601 - Shunsuke Ihara:
Mutual information in stationary channels with additive noise. 602-606 - Max H. M. Costa:
On the Gaussian interference channel. 607-615 - Tadao Kasami, Shu Lin, Victor K.-W. Wei, Saburo Yamamura:
Coding for the binary symmetric broadcast channel with two receivers. 616-625 - Hans Burkhardt, Lineu C. Barbosa:
Contributions to the application of the Viterbi algorithm. 626-634 - Bernard C. Levy, John N. Tsitsiklis:
A fast algorithm for linear estimation of two- dimensional isotropic random fields. 635-644 - Lee S. Dewald, Peter A. W. Lewis:
A new Laplace second-order autoregressive time-series model - NLAR(2). 645-651 - Jitendra K. Tugnait:
Continuous-time system identification on compact parameter sets. 652-659 - Evaggelos Geraniotis, Harold Vincent Poor:
Minimax discrimination for observed Poisson processes with uncertain rate functions. 660-669 - Bradley W. Dickinson, Eduardo D. Sontag:
Dynamic realizations of sufficient sequences. 670-676
- James A. Bucklew:
A note on the prediction error for small time lags into the future. 677-679 - Anthony J. Weiss, Ehud Weinstein:
A lower bound on the mean-square error in random parameter estimation. 680-682 - C. C. Lee, L. A. Longley:
Nonparametric estimation algorithms based on input quantization. 682-688 - Florin Avram, Toby Berger:
On critical distortion for Markov sources. 688-690 - Mario Blaum, Robert J. McEliece:
Coding protection for magnetic tapes: A generalization of the Patel - Hong code. 690-693 - Sawasd Tantaratana:
Comparison of the SPRT and the sequential linear detector in autoregressive noise. 693-697 - Stelios C. A. Thomopoulos:
Minimum error entropy estimation and entropic prediction filtering: An optimal predictive coding scheme. 697-703 - Evaggelos Geraniotis:
Performance bounds for discrimination problems with uncertain statistics. 703-707 - T. E. McCannon:
Two-dimensional memoryless detection of a random signal in phi -mixing non-Gaussian noise. 708-710 - Sawasd Tantaratana, Harold Vincent Poor:
Asymptotic relative efficiencies of multistage tests. 710-715
Volume 31, Number 6, November 1985
- Rudolf Ahlswede:
The rate-distortion region for multiple descriptions without excess rate. 721-726 - Chris Heegard, Toby Berger:
Rate distortion when side information may be absent. 727-734 - Amiram H. Kaspi:
Two-way source coding with a fidelity criterion. 735-740 - Jutta Pokorny, Hans-Martin Wallmeier:
Random coding bound and codes produced by permutations for the multiple-access channel. 741-750 - Max H. M. Costa:
A new entropy power inequality. 751-760 - William A. Pearlman, Priyadarshan Jakatdar:
A transform tree code for stationary Gaussian sources. 761-768 - Tadao Kasami, Toru Fujiwara, Shu Lin:
An approximation to the weight distribution of binary linear codes. 769-780 - John P. Robinson:
Golomb rectangles. 781-787 - Jørn M. Jensen:
The concatenated structure of cyclic and Abelian codes. 788-793 - J. C. Maxted, John P. Robinson:
Error recovery for variable length codes. 794-801 - Evaggelos Geraniotis:
Minimax robust coding for channels with uncertainty statistics. 802-811 - Cheng-Tie Chen, Saleem A. Kassam:
Robust multiple-input matched filtering: Frequency and time-domain results. 812-821 - George V. Moustakides:
Robust detection of signals: A large deviations approach. 822-825
- Ron M. Roth, Gadiel Seroussi:
On generator matrices of MDS codes. 826-830 - Xiaojun Li, Richard C. Dubes:
A note on dichotomous feature extraction. 831-832 - Steven A. Tretter:
Estimating the frequency of a noisy sinusoid by linear regression. 832-835 - S. V. Czarnecki, Kenneth S. Vastola:
Approximation of locally optimum detector nonlinearities. 835-838 - Gianfranco Bilardi, Gianfranco L. Cariolaro, Roberto Cristi:
Mean value of the output of a discrete-time Volterra system driven by a Markov chain. 838-841
- Bruce E. Hajek:
Review of 'Approximation and Weak Convergence Methods for Random Processes, with Applications to Stochastic Systems Theory' (Kushner, H.J.; 1984). 841
- János Komlós, Albert G. Greenberg:
Correction to 'An Asymptotically Nonadaptive Algorithm for Conflict Resolution in Multiple-Access Channels'. 841
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-10-31 20:05 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:
