Volume 36,
Number 1,
January 1990
Papers
- 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
Correspondence
- János Körner, Katalin Marton:
On the capacity of uniform hypergraphs.
153-
- Lawrence H. Ozarow:
Upper bounds on the capacity of Gaussian channels with feedback.
156-
- Erdal Arikan:
An implementation of Elias coding for input-restricted channels.
162-
- Rudolf Ahlswede:
Extremal properties of rate distortion functions.
166-
- Srinivasan V. Ramanan, Harry F. Jordan, Jon R. Sauer:
A new time domain, multistage permutation algorithm.
171-
- Toby Berger, Flavio Bonomi:
Capacity and zero-error capacity of Ising channels.
173-
- Erdal Arikan:
On the achievable rate region of sequential decoding for a class of multiaccess channels.
180-
- James B. Shearer:
Some new optimum Golomb rulers.
183-
- Torleiv Kløve:
Bounds and constructions of disjoint sets of distinct difference sets.
184-
- Jovan Dj. Golic, Miodrag J. Mihaljevic:
Minimal linear equivalent analysis of a variable-memory binary sequence generator.
190-
- Jack Koplowitz, Michael Lindenbaum, Alfred M. Bruckstein:
The number of digital straight lines on an N×N grid.
192-
- Soura Dasgupta, C. Richard Johnson Jr., A. Maylar Baksho:
Sign-sign LMS convergence with independent stochastic inputs.
197-
- Costas N. Georghiades:
Optimum delay and sequence estimation from incomplete data.
202-
- A. Vourdas:
Information in quantum optical binary communications.
208-
- Aimo Tietäväinen:
An asymptotic bound on the covering radii of binary BCH codes.
211-
- 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-
- Pascale Charpin:
On a class of primitive BCH-codes.
222-
- Zhi Chen, Jin Fan, Fan Jin:
On a new binary [22, 13, 5] code.
228-
- Patrick Solé:
A limit law on the distance distribution of binary codes.
229-
- Lawrence H. Ozarow, Lawrence A. Shepp:
The exact information complexity of Indian poker.
232-
Volume 36,
Number 2,
March 1990
Papers
- 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
Correspondence
- Jehoshua Bruck, Vwani P. Roychowdhury:
On the number of spurious memories in the Hopfield model.
393-
- Marcel van der Vlugt:
The true dimension of certain binary Goppa codes.
397-
- Richard A. Brualdi, Vera Pless:
Orphans of the first order Reed-Muller codes.
399-
- Alistair Moffat:
Linear time adaptive arithmetic coding.
401-406
- Sulaiman Al-Bassam, Bella Bose:
On balanced codes.
406-
- József Dénes, Gary L. Mullen, Stephan J. Suchower:
Another generalized Golomb-Posner code.
408-
- Leopold Bömer, Markus Antweiler:
Two-dimensional perfect binary arrays with 64 elements.
411-
- Zabih Nasseri, Morton Kanefsky:
Doubly adaptive DPCM.
414-
- Philippe Jacquet, Eric Merle:
Analysis of a stack algorithm for CSMA-CD random length packet communication.
420-
- Evaggelos Geraniotis:
Robust matched filters for noise uncertainty within two alternating capacity classes.
426-
- Pierre Comon, Dinh-Tuan Pham:
Estimating the order of a FIR filter for noise cancellation.
429-
- T. T. Kadota:
A nonlinear optimum-detection problem-II: Simple numerical examples.
434-
- Kailash Birmiwal:
The minimum codeword length and redundancy in the binary Huffman code for uncertain sources.
439-
- Jovan Dj. Golic, Milorad M. Obradovic:
Correction to 'A lower bound on the redundancy of D-ary Huffman codes' (Nov 87 910-911).
443
- 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).
443-
Volume 36,
Number 3,
May 1990
Papers
- 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
- Tat Simchony, Ramalingam Chellappa, Ze'ev Lichtenstein:
Relaxation algorithms for MAP estimation of gray-level images with multiplicative noise.
608-613
Correspondence
- Nader Mahravari:
Random-access communication with multiple reception.
614-
- Feng Guo, Yoichiro Watanabe:
On graphs in which the Shannon capacity is unachievable by finite product.
622-
- Shlomo Shamai, Israel Bar-David:
On the capacity penalty due to input-bandwidth restrictions with an application to rate-limited binary signaling.
623-
- Kapil K. Chawla, Dilip V. Sarwate:
Upper bounds on the probability of error for M-ary orthogonal signaling in white Gaussian noise.
627-
- P. Vijay Kumar, Chao-Ming Liu:
On lower bounds to the maximum correlation of complex roots-of-unity sequences.
633-
- Agnes Hui Chan, Mark Goresky, Andrew Klapper:
On the linear complexity of feedback registers.
640-
- Yuichi Saitoh, Kazuhiko Yamaguchi, Hideki Imai:
Some new binary codes correcting asymmetric/unidirectional errors.
645-
- Peter Fuchs, Gerhard Hofer, Günter Pilz:
Codes from planar near rings.
647-
- W. Cary Huffman:
On extremal self-dual quaternary codes of lengths 18 to 28, I.
651-
- W. Cary Huffman:
On 3-elements in monomial automorphism groups of quaternary codes.
660-
- Wende Chen, Iiro S. Honkala:
Lower bounds for q-ary covering codes.
664-
- Mario Blaum:
A family of efficient burst-correcting array codes.
671-
- John J. O'Reilly, A. Popplewell:
A further note on DC-free coset codes.
675-
- Amer A. Hassan, Wayne E. Stark:
On decoding concatenated codes.
677-
- Xiang-dong Hou:
Some results on the norm of codes.
683-
- Gilles Lachaud, Jacques Wolfmann:
The weights of the orthogonals of the extended quadratic binary Goppa codes.
686-
- Shyue-Win Wei, Che-Ho Wei:
On high-speed decoding of the (23, 12, 7) Golay code.
692-
- Øyvind Ytrehus, Tor Helleseth:
There is no binary [25, 8, 10] code (corresp.).
695-
- Markus Antweiler, Leopold Bömer, Hans-Dieter Lüke:
Perfect ternary arrays.
696-
Reviews and Abstracts
- Jacob Ziv:
Review of 'Open Problems in Communication and Computation' (Cover, T.M., and Gopinath, B., Eds.; 1987).
706-
Volume 36,
Number 4,
July 1990
Papers
- 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
Correspondence
- Gregory W. Wornell:
A Karhunen-Loève-like expansion for 1/f processes via wavelets.
859-
- Jacob Ziv:
Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources.
861-
- Ning Zhang, Solomon W. Golomb:
A limit theorem for n-phase Barker sequences (corresp.).
863-
- Habong Chung, P. Vijay Kumar:
Optical orthogonal codes-New bounds and an optimal construction.
866-
- József Dénes, A. Donald Keedwell:
A new construction of two-dimensional arrays with the window property.
873-
- Irving S. Reed, Xiaowei Yin, Trieu-Kien Truong:
Algebraic decoding of the (32, 16, 8) quadratic residue code.
876-
- Arvind Krishna, Dilip V. Sarwate:
Pseudocyclic maximum- distance-separable codes.
880-
- Dilip V. Sarwate, Robert D. Morrison:
Decoder malfunction in BCH decoders.
884-
- Patrick Stevens:
On decoding unequal error protection product codes.
890-
- Xiang-dong Hou:
New lower bounds for covering codes.
895-
- Tuvi Etzion:
Constructions of error-correcting DC-free block codes.
899-
- Mario Blaum, Jehoshua Bruck:
Decoding the Golay code with Venn diagrams.
906-
- John J. Metzner, Edward J. Kapturowski:
A general decoding technique applicable to replicated file disagreement location and concatenated code decoding.
911-
- Raymond Hill, Karen L. Traynor:
The nonexistence of certain binary linear codes.
917-
- Ludo M. G. M. Tolhuizen, Jacobus H. van Lint:
On the minimum distance of combinatorial codes.
922-
- Mao Chao Lin, Chi-Chang Lin, Shu Lin:
Computer search for binary cyclic UEP codes of odd length up to 65.
924-
- Michael Gutman:
Fixed-prefix encoding of the integers can be Huffman-optimal.
936-
- Venkat Anantharam:
A large deviations approach to error exponents in source coding and hypothesis testing.
938-
- Antoine Lobstein:
The hardness of solving subset sum with preprocessing.
943-
- Klaus Huber:
Some comments on Zech's logarithms.
946-
- Harold N. Ward:
Quadratic residue codes of length 27.
950-
- Mahesh C. Bhandari, M. S. Garg:
Comments, with reply, on 'On the coveting radius of codes' by R.L. Graham and N.J.A. Sloane.
953-
- Philippe Delsarte, Philippe Piret:
Correction to 'Bounds and constructions for binary asymmetric error-correcting codes' (Jan 81 125-128).
954-
Reviews and Abstracts
- G. David Forney Jr.:
Review of 'Sphere Packings, Lattices and Groups' (Conway, J.H., and Sloane, N.J.A.; 1988).
955-
Volume 36,
Number 5,
September 1990
Papers
- Ingrid Daubechies:
The wavelet transform, time-frequency localization and signal analysis.
961-1005
- Toby Berger, Zhongxing Ye:
Entropic aspects of random fields on trees.
1006-1018
- Sergio Verdú:
On channel capacity per unit cost.
1019-1030
- John T. Coffey, Rodney M. Goodman:
The complexity of information set decoding.
1031-1037
- John H. Conway, Neil J. A. Sloane:
Orbit and coset analysis of the Golay and related codes.
1038-1050
- Alexei N. Skorobogatov, Serge G. Vladut:
On the decoding of algebraic-geometric codes.
1051-1060
- Bernard C. Picinbono, Patrick Duvaut:
Geometrical properties of optimal Volterra filters for signal detection.
1061-1068
- Daniel D. Harrison, James W. Modestino:
Analysis and further results on adaptive entropy-coded quantization.
1069-1088
- Dan Hajela, Michael L. Honig:
Bounds on s-rate for linear, time-invariant, multiinput/multioutput channels.
1089-1097
- Ingemar Ingemarsson:
Optimized permutation modulation.
1098-1100
- Yow-Jong Liu, Ikuo Oka, Ezio Biglieri:
Error probability for digital transmission over nonlinear channels with application to TCM.
1101-1110
- Alon Orlitsky:
Worst-case interactive communication I: Two messages are almost optimal.
1111-1126
- Mart L. Molle:
On the cutoff point for pairwise enabling in multiple access systems.
1127-1133
Correspondence
- Wen-Whet Chang, Jerry D. Gibson:
Path map symbol release rules and the exponential metric tree.
1134-
- Mao Chao Lin:
Bounds on the undetected error probabilities of linear codes for both error correction and detection.
1139-
- Zhi Chen, Jin Fan, Fan Jin:
New results on self-orthogonal unequal error protection codes.
1141-
- Patrick Stevens:
Error-erasure decoding of binary cyclic codes, up to a particular instance of the Hartmann-Tzeng bound.
1144-
- Kar-Ming Cheung:
Identities and approximations for the weight distribution of q -ary codes.
1149-
- Clement W. H. Lam, Vera Pless:
There is no (24, 12, 10) self-dual quaternary code.
1153-
- Ron M. Roth, Abraham Lempel:
Application of circulant matrices to the construction and decoding of linear codes.
1157-
- Marcel J. E. Golay, Duncan B. Harris:
A new search for skewsymmetric binary sequences with optimal merit factors.
1163-
- Gregory L. Mayhew, Solomon W. Golomb:
Linear spans of modified de Bruijn sequences.
1166-
- Ning Zhang, Solomon W. Golomb:
Uniqueness of the generalized Barker sequence of length 6.
1167-
- Carlisle M. Adams, Stafford E. Tavares:
Generating and counting binary bent sequences.
1170-
- Keith W. Ross, David D. Yao:
Monotonicity properties for the stochastic knapsack.
1173-
- Attilio J. Rainal:
Passage times of Gaussian noise crossing a time-varying boundary.
1179-
- Y. C. Yao, Frank K. Hwang:
On the cutoff point for pairwise enabling for infinite users in a multiaccess system.
1183-
- Kristian Seip:
A note on sampling of bandlimited stochastic processes.
1186-
- Upamanyu Madhow, Michael B. Pursley:
Correction to 'Limiting Performance of Frequency-Hop Random Access'.
1187-
Reviews and Abstracts
- Jan H. van Schuppen:
Review of 'Stochastic Integration and Differential Equations - A New Approach', (Protter, P.; 1990).
1188-
Volume 36,
Number 6,
November 1990
Papers
- Bart Verboven, Edward C. van der Meulen:
Capacity bounds for identification via broadcast channels which are optimal for the deterministic broadcast channel.
1197-1205
- Peter Mathys:
A class of codes for a T active users out of N multiple-access communication system.
1206-1219
- Robert M. Gray:
Quantization noise spectra.
1220-1244
- Neri Merhav, Jacob Ziv:
On universally efficient estimation of the first order autoregressive parameter and universal data compression.
1245-1254
- Morteza Naraghi-Pour, David L. Neuhoff:
Convergence of the projection method for an autoregressive process and a matched DPCM code.
1255-1264
- Evaggelos Geraniotis, Yawgeng A. Chau:
Robust data fusion for multisensor detection systems.
1265-1279
- David Pearson, S. Unnikrishna Pillai, YoungJik Lee:
An algorithm for near-optimal placement of sensor elements.
1280-1284
- John D. Gorman, Alfred O. Hero III:
Lower bounds for parametric estimation with constraints.
1285-1301
- Steven B. Lowen, Malvin Carl Teich:
Power-law shot noise.
1302-1318
- John H. Conway, Neil J. A. Sloane:
A new upper bound on the minimal distance of self-dual codes.
1319-1333
- Andries E. Brouwer, James B. Shearer, Neil J. A. Sloane, Warren D. Smith:
A new table of constant weight codes.
1334-1380
- Frank H. Böinck, Henk C. A. van Tilborg:
Constructions and bounds for systematic t EC/AUED codes.
1381-1390
- Philippe Piret:
Analysis of a modified Hebbian rule.
1391-1397
- Bruce E. Hajek:
Performance of global load balancing of local adjustment.
1398-1414
- Wolfgang H. Kliemann, Giorgio Koch, Federico Marchetti:
On the unnormalized solution of the filtering problem with counting process observations.
1415-1425
Correspondence
- Lawrence H. Ozarow, Aaron D. Wyner:
On the capacity of the Gaussian channel with a finite number of input levels.
1426-
- Shlomo Shamai, Aaron D. Wyner:
A binary analog to the entropy-power inequality.
1428-
- B. S. Chow, W. P. Birkemeier:
A new recursive filter for systems with multiplicative noise.
1430-
- Toby Berger, Raymond W. Yeung:
Optimum '1' ended binary prefix codes.
1435-
- David Hertz, Yehuda Azenkot:
On a class of multilevel universal source coding schemes.
1442-
- Bruce L. Montgomery, Harvey Diamond, B. V. K. Vijaya Kumar:
Bit probabilities of optimal binary source codes.
1446-
- Ender Ayanoglu:
On optimal quantization of noisy sources.
1450-
- John T. Coffey, Rodney M. Goodman:
Any code of which we cannot think is good.
1453-
- Serge G. Vladut:
On the decoding of algebraic-geometric codes over Fq for q>=16.
1461-
- Gérald E. Séguin, Germain Drolet:
The trace description of irreducible quasi-cyclic codes.
1463-
- Gerhard J. M. van Wee:
Binary coveting codes are normal.
1466-
- Patrick Solé:
Asymptotic bounds on the covering radius of binary codes.
1470-
- Aimo Tietäväinen:
An upper bound on the covering radius as a function of the dual distance.
1472-
- Margaret Ann Bernard, Bhu Dev Sharma:
A lower bound on average crowded length of variable length error-correcting codes.
1474-
- Xiang-dong Hou:
An improved sphere covering bound for the codes with n = 3R + 2.
1476-
- Ning Zhang, Solomon W. Golomb:
On the crosscorrelation of generalized Barker sequences.
1478-
- Patrick Fitzpatrick, Graham H. Norton:
Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence.
1480-
- Leopold Bömer, Markus Antweiler:
Periodic complementary binary sequences.
1487-
- Eric Bach:
A note on square roots in finite fields.
1494-
- Antoine Lobstein, Gerhard J. M. van Wee:
Correction to 'On normal and subnormal q-ary codes' (Nov 89 1291-1295).
1498-
Copyright © Mon Nov 2 21:57:04 2009
by Michael Ley (ley@uni-trier.de)
