


default search action
IEEE Transactions on Information Theory, Volume 36
Volume 36, Number 1, January 1990
- Alon Orlitsky, Abbas El Gamal:
Average and randomized communication complexity. 3-16 - Lawrence H. Ozarow:
Random coding for additive Gaussian channels with feedback. 17-22 - Lee K. Jones, Charles L. Byrne:
General entropy criteria for inverse problems, with applications to data compression, pattern classification, and cluster analysis. 23-30 - Gordon B. Agnew:
Cryptographic systems using redundancy. 31-39 - Michael Ben-Or
, Oded Goldreich
, Silvio Micali, Ronald L. Rivest:
A fair protocol for signing contracts. 40-46 - Tatsuaki Okamoto:
A fast signature scheme based on congruential polynomial operations. 47-53 - Masakazu Jimbo, Ryoh Fuji-Hara:
Optimal authentication systems and combinatorial designs. 54-62 - Steven S. Pietrobon, Robert H. Deng
, Alain Lafanechére, Gottfried Ungerboeck, Daniel J. Costello Jr.:
Trellis-coded multidimensional phase modulation. 63-89 - Henning Stichtenoth:
On the dimension of subfield subcodes. 90-93 - Fure-Ching Jeng, John W. Woods:
Simulated annealing in compound Gaussian random fields. 94-107 - Richard R. Hansen Jr., Ramalingam Chellappa:
Noncausal 2-D spectrum estimation for direction finding. 108-125 - Chein-I Chang, Lee D. Davisson:
Two iterative algorithms for finding minimax solutions. 126-140 - Adam Krzyzak:
On estimation of a class of nonlinear systems by the kernel regression estimate. 141-152
- János Körner, Katalin Marton:
On the capacity of uniform hypergraphs. 153-156 - Lawrence H. Ozarow:
Upper bounds on the capacity of Gaussian channels with feedback. 156-161 - Erdal Arikan:
An implementation of Elias coding for input-restricted channels. 162-165 - Rudolf Ahlswede:
Extremal properties of rate distortion functions. 166-171 - Srinivasan V. Ramanan, Harry F. Jordan, Jon R. Sauer:
A new time domain, multistage permutation algorithm. 171-173 - Toby Berger, Flavio Bonomi:
Capacity and zero-error capacity of Ising channels. 173-180 - Erdal Arikan:
On the achievable rate region of sequential decoding for a class of multiaccess channels. 180-183 - James B. Shearer:
Some new optimum Golomb rulers. 183-184 - Torleiv Kløve:
Bounds and constructions of disjoint sets of distinct difference sets. 184-190 - Jovan Dj. Golic, Miodrag J. Mihaljevic:
Minimal linear equivalent analysis of a variable-memory binary sequence generator. 190-192 - Jack Koplowitz, Michael Lindenbaum, Alfred M. Bruckstein:
The number of digital straight lines on an N×N grid. 192-197 - Soura Dasgupta, C. Richard Johnson Jr., A. Maylar Baksho:
Sign-sign LMS convergence with independent stochastic inputs. 197-201 - Costas N. Georghiades:
Optimum delay and sequence estimation from incomplete data. 202-208 - A. Vourdas:
Information in quantum optical binary communications. 208-211 - Aimo Tietäväinen:
An asymptotic bound on the covering radii of binary BCH codes. 211-213 - Patrick A. H. Bours, Jeannette C. M. Janssen
, Marcel van Asperdt, Henk C. A. van Tilborg:
Algebraic decoding beyond BCH of some binary cyclic codes, when e>BCH. 214-222 - Pascale Charpin:
On a class of primitive BCH-codes. 222-228 - Zhi Chen, Pingzhi Fan, Fan Jin:
On a new binary [22, 13, 5] code. 228-229 - Patrick Solé:
A limit law on the distance distribution of binary codes. 229-232 - Lawrence H. Ozarow, Lawrence A. Shepp:
The exact information complexity of Indian poker. 232-234
Volume 36, Number 2, March 1990
- Maurizio Longo
, Tom D. Lookabaugh, Robert M. Gray:
Quantization for decentralized hypothesis testing under communication constraints. 241-255 - John C. Kieffer:
Comparison of two optimum rates for noiseless encoding of a nonstationary information source. 256-261 - John A. Gubner:
On the deterministic-code capacity of the multiple-access arbitrarily varying channel. 262-275 - Kon Max Wong, Shuang Chen:
The entropy of ordered sequences and order statistics. 276-284 - Thomas K. Philips, Donald F. Towsley
, Jack K. Wolf:
On the diameter of a class of random graphs. 285-288 - Dan Hajela:
On computing the minimum distance for faster than Nyquist signaling. 289-295 - Morteza Naraghi-Pour, David L. Neuhoff:
Mismatched DPCM encoding of autoregressive processes. 296-304 - Morteza Naraghi-Pour, David L. Neuhoff:
On the continuity of the stationary state distribution of DPCM. 305-311 - Ofir Shalvi, Ehud Weinstein:
New criteria for blind deconvolution of nonminimum phase systems (channels). 312-321 - Upamanyu Madhow, Michael B. Pursley:
Limiting performance of frequency-hop random access. 322-333 - Tassos Nakasis, Anthony Ephremides:
Steady-state behavior of interacting queues-A numerical approach. 334-346 - T. T. Kadota:
A nonlinear optimum-detection problem - I: Theory. 347-357 - Gerald R. Benitz, James A. Bucklew:
Large deviation rate calculations for nonlinear detectors in Gaussian noise. 358-371 - Yariv Ephraim, Lawrence R. Rabiner:
On the relations between modeling approaches for speech recognition. 372-380 - Jehoshua Bruck
, Moni Naor:
The hardness of decoding linear codes with preprocessing. 381-385 - Henk D. L. Hollmann
:
Design of test sequences for VLSI self-testing using LFSR. 386-392
- Jehoshua Bruck
, Vwani P. Roychowdhury:
On the number of spurious memories in the Hopfield model. 393-397 - Marcel van der Vlugt:
The true dimension of certain binary Goppa codes. 397-398 - Richard A. Brualdi, Vera Pless:
Orphans of the first order Reed-Muller codes. 399-401 - Alistair Moffat
:
Linear time adaptive arithmetic coding. 401-406 - Sulaiman Al-Bassam, Bella Bose:
On balanced codes. 406-408 - József Dénes, Gary L. Mullen, Stephan J. Suchower:
Another generalized Golomb-Posner code. 408-411 - Leopold Bömer, Markus Antweiler:
Two-dimensional perfect binary arrays with 64 elements. 411-414 - Zabih Nasseri, Morton Kanefsky:
Doubly adaptive DPCM. 414-420 - Philippe Jacquet, Eric Merle:
Analysis of a stack algorithm for CSMA-CD random length packet communication. 420-426 - Evaggelos Geraniotis:
Robust matched filters for noise uncertainty within two alternating capacity classes. 426-429 - Pierre Comon, Dinh-Tuan Pham:
Estimating the order of a FIR filter for noise cancellation. 429-434 - T. T. Kadota:
A nonlinear optimum-detection problem-II: Simple numerical examples. 434-439 - Kailash Birmiwal:
The minimum codeword length and redundancy in the binary Huffman code for uncertain sources. 439-443 - Jovan Dj. Golic, Milorad M. Obradovic:
Correction to 'A lower bound on the redundancy of D-ary Huffman codes' (Nov 87 910-911). IEEE Trans. Inf. Theory 36(2): 443 (1990) - Nick J. Patterson, Douglas H. Wiedemann:
Correction to 'The covering radius of the (215, 16) Reed-Muller code is at least 16276' (May 83 354-356). IEEE Trans. Inf. Theory 36(2): 443- (1990)
Volume 36, Number 3, May 1990
- Bertrand S. Clarke, Andrew R. Barron:
Information-theoretic asymptotics of Bayes methods. 453-471 - Michael L. Honig, Kenneth Steiglitz, B. Gopinath, Stephen P. Boyd:
Bounds on maximum throughput for digital communications with finite-precision and amplitude constraints. 472-484 - Richard J. Barton, H. Vincent Poor:
An RKHS approach to robust L2 estimation and signal detection. 485-501 - Iickho Song
, Saleem A. Kassam:
Locally optimum detection of signals in a generalized observation model: The known signal case. 502-515 - Iickho Song
, Saleem A. Kassam:
Locally optimum detection of signals in a generalized observation model: The random signal case. 516-530 - László Györfi, Elias Masry:
The L1 and L2 strong consistency of recursive kernel density estimation from dependent samples. 531-539 - Jørn Justesen, Erik Paaske, Mark Ballan:
Quasi-cyclic unit memory convolutional codes. 540-547 - Agnes Hui Chan, Richard A. Games:
On the linear span of binary sequences obtained from q-ary m-sequences, q odd. 548-552 - Michael J. Wiener:
Cryptanalysis of short RSA secret exponents. 553-558 - Serena M. Zabin, H. Vincent Poor:
Recursive algorithms for identification of impulsive noise channels. 559-578 - John S. Sadowsky, James A. Bucklew:
On large deviations theory and asymptotically efficient Monte Carlo estimation. 579-588 - Dale H. Mugler
:
Computationally efficient linear prediction from past samples of a band-limited signal and its derivative. 589-596 - Randall K. Bahr:
Asymptotic analysis of error probabilities for the nonzero-mean Gaussian hypothesis testing problem. 597-607 - Tal Simchony, Ramalingam Chellappa, Ze'ev Lichtenstein:
Relaxation algorithms for MAP estimation of gray-level images with multiplicative noise. 608-613
- Nader Mahravari:
Random-access communication with multiple reception. 614-622 - Feng Guo, Yoichiro Watanabe:
On graphs in which the Shannon capacity is unachievable by finite product. 622-623 - Shlomo Shamai, Israel Bar-David:
On the capacity penalty due to input-bandwidth restrictions with an application to rate-limited binary signaling. 623-627 - Kapil K. Chawla, Dilip V. Sarwate:
Upper bounds on the probability of error for M-ary orthogonal signaling in white Gaussian noise. 627-633 - P. Vijay Kumar, Chao-Ming Liu:
On lower bounds to the maximum correlation of complex roots-of-unity sequences. 633-640 - Agnes Hui Chan, Mark Goresky, Andrew Klapper:
On the linear complexity of feedback registers. 640-644 - Yuichi Saitoh, Kazuhiko Yamaguchi, Hideki Imai:
Some new binary codes correcting asymmetric/unidirectional errors. 645-647 - Peter Fuchs, Gerhard Hofer, Günter Pilz:
Codes from planar near rings. 647-651 - W. Cary Huffman:
On extremal self-dual quaternary codes of lengths 18 to 28, I. 651-660 - W. Cary Huffman:
On 3-elements in monomial automorphism groups of quaternary codes. 660-664 - Wende Chen, Iiro S. Honkala:
Lower bounds for q-ary covering codes. 664-671 - Mario Blaum:
A family of efficient burst-correcting array codes. 671-675 - John J. O'Reilly, Adrian Popplewell:
A further note on DC-free coset codes. 675-676 - Amer A. Hassan, Wayne E. Stark:
On decoding concatenated codes. 677-683 - Xiang-dong Hou:
Some results on the norm of codes. 683-685 - Gilles Lachaud, Jacques Wolfmann:
The weights of the orthogonals of the extended quadratic binary Goppa codes. 686-692 - Shyue-Win Wei, Che-Ho Wei:
On high-speed decoding of the (23, 12, 7) Golay code. 692-695 - Øyvind Ytrehus, Tor Helleseth:
There is no binary [25, 8, 10] code (corresp.). 695-696 - Markus Antweiler, Leopold Bömer, Hans-Dieter Lüke:
Perfect ternary arrays. 696-705
- Jacob Ziv:
Review of 'Open Problems in Communication and Computation' (Cover, T.M., and Gopinath, B., Eds.; 1987). IEEE Trans. Inf. Theory 36(3): 706- (1990)
Volume 36, Number 4, July 1990
- Toby Berger, Zhongxing Ye:
epsilon-entropy and critical distortion of random fields. 717-725 - A. Robert Calderbank, Lawrence H. Ozarow:
Nonequiprobable signaling on the Gaussian channel. 726-740 - Sanjay Kasturia, James T. Aslanis, John M. Cioffi:
Vector coding for partial response channels. 741-762 - Marie-Pierre Béal:
The method of poles: A coding method for constrained channels. 763-772 - Thomas E. Fuja, Chris Heegard:
Focused codes for channels with skewed errors. 773-783 - Ping Wah Wong, Robert M. Gray:
Sigma-delta modulation with i.i.d. Gaussian inputs. 784-798 - Nariman Farvardin:
A study of vector quantization for noisy channels. 799-809 - Brian L. Hughes, Murad Hizlan:
An asymptotically optimal random modem and detector for robust communication. 810-821 - Agnes Hui Chan, Richard A. Games:
On the quadratic spans of DeBruijn sequences. 822-829 - Langford B. White, Boualem Boashash:
Cross spectral analysis of nonstationary processes. 830-835 - Henk A. P. Blom, Yaakov Bar-Shalom:
Time-reversion of a hybrid state stochastic difference system with a jump-linear smoothing application. 836-847 - Mikael Sternad, Anders Ahlén:
The structure and design of realizable decision feedback equalizers for IIR channels with colored noise. 848-858
- Gregory W. Wornell:
A Karhunen-Loève-like expansion for 1/f processes via wavelets. 859-861 - Jacob Ziv:
Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources. 861-863 - Ning Zhang, Solomon W. Golomb:
A limit theorem for n-phase Barker sequences (corresp.). 863-868 - Habong Chung, P. Vijay Kumar:
Optical orthogonal codes-New bounds and an optimal construction. 866-873 - József Dénes, A. Donald Keedwell:
A new construction of two-dimensional arrays with the window property. 873-876 - Irving S. Reed, Xiaowei Yin, Trieu-Kien Truong:
Algebraic decoding of the (32, 16, 8) quadratic residue code. 876-880 - Arvind Krishna, Dilip V. Sarwate:
Pseudocyclic maximum- distance-separable codes. 880-884 - Dilip V. Sarwate, Robert D. Morrison:
Decoder malfunction in BCH decoders. 884-889 - Patrick Stevens:
On decoding unequal error protection product codes. 890-895 - Xiang-dong Hou:
New lower bounds for covering codes. 895-899 - Tuvi Etzion:
Constructions of error-correcting DC-free block codes. 899-905 - Mario Blaum, Jehoshua Bruck
:
Decoding the Golay code with Venn diagrams. 906-910 - John J. Metzner, Edward J. Kapturowski:
A general decoding technique applicable to replicated file disagreement location and concatenated code decoding. 911-917 - Raymond Hill, Karen L. Traynor:
The nonexistence of certain binary linear codes. 917-922 - Ludo M. G. M. Tolhuizen, Jacobus H. van Lint:
On the minimum distance of combinatorial codes. 922-923 - Mao Chao Lin, Chi-Chang Lin, Shu Lin:
Computer search for binary cyclic UEP codes of odd length up to 65. 924-935 - Michael Gutman:
Fixed-prefix encoding of the integers can be Huffman-optimal. 936-938 - Venkat Anantharam:
A large deviations approach to error exponents in source coding and hypothesis testing. 938-943 - Antoine Lobstein:
The hardness of solving subset sum with preprocessing. 943-946