IEEE Transactions on Information Theory, Volume 39, 1993

Volume 39, Number 1, January 1993

• Ingrid Daubechies, Augustus J. E. M. Janssen:
  Two theorems on lattice expansions. 3-6
  
• Ping Wah Wong:
  Wavelet decomposition of harmonizable random processes. 7-18
  
• Shlomo Shamai, Amos Lapidoth:
  Bounds on the capacity of a spectrally constrained Poisson channel. 19-29
  
• Sergio Verdú, Victor K.-W. Wei:
  Explicit construction of optimal constant-weight codes for identification via channels. 30-36
  
• Gui Liang Feng, Thammavarapu R. N. Rao:
  Decoding algebraic-geometric codes up to the designed minimum distance. 37-45
  
• M. Vedat Eyuboglu, G. David Forney Jr.:
  Lattice and trellis quantization with lattice- and trellis-bounded codebooks - High-rate theory for memoryless sources. 46-59
  
• John K. Karlof:
  Decoding spherical codes for the Gaussian channel. 60-65
  
• Mario Blaum, Ron M. Roth:
  New array codes for multiple phased burst correction. 66-77
  
• Donald Ornstein, Benjamin Weiss:
  Entropy and data compression schemes. 78-83
  
• Bruce E. Hajek, Rene L. Cruz:
  On the average delay for routing subject to independent deflections. 84-91
  
• Sean P. Meyn, Michael R. Frater:
  Recurrence times of buffer overflows in Jackson networks. 92-97
  
• Israel Cidon, Asad Khamisy, Moshe Sidi:
  Analysis of packet loss processes in high-speed networks. 98-108
  
• Yali Amit, Michael I. Miller:
  Large deviations for coding Markov chains and Gibbs random fields. 109-118
  
• John S. Sadowsky:
  On the optimality and stability of exponential twisting in Monte Carlo estimation. 119-128
  
• Zhi Ding, Rodney A. Kennedy, Brian D. O. Anderson, C. Richard Johnson Jr.:
  Local convergence of the Sato blind equalizer and generalizations under practical constraints. 129-144
  
• Shirish A. Altekar, Norman C. Beaulieu:
  Upper bounds to the error probability of decision feedback equalization. 145-156
  
• Mahesh K. Varanasi:
  Noncoherent detection in asynchronous multiuser channels. 157-176
  
• Andrew Klapper, Agnes Hui Chan, Mark Goresky:
  Cascaded GMW sequences. 177-183
  

• J. P. Aldis, Alister G. Burr:
  The channel capacity of discrete time phase modulation in AWGN. 184-185
  
• Yitzhak Birk, Nathan Linial, Roy Meshulam:
  On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels. 186-191
  
• Ilan Kessler, Moshe Sidi:
  Growing binary trees in a random environment. 191-194
  
• Eli Plotnik:
  Code constructions for asynchronous random multiple-access to the adder channel. 195-197
  
• Niels J. C. Lous, Patrick A. H. Bours, Henk C. A. van Tilborg:
  On maximum likelihood soft-decision decoding of binary linear codes. 197-203
  
• Yuval Berger, Yair Be'ery:
  Bounds on the trellis size of linear block codes. 203-209
  
• Tuvi Etzion, Gadi Greenberg:
  Constructions for perfect mixed codes and other covering codes. 209-214
  
• Vera Pless, Vladimir D. Tonchev, Jeffrey S. Leon:
  On the existence of a certain (64, 32, 12) extremal code. 214-215
  
• Mario Blaum, Simon Litsyn, Vincent Buskens, Henk C. A. van Tilborg:
  Error-correcting codes with bounded running digital sum. 216-227
  
• Albertus S. J. Helberg, Hendrik C. Ferreira:
  On the complete decoding of constrained codes. 228-232
  
• Zhen Zhang, Xiang-Gen Xia:
  LYM-type inequalities for tEC/AUED codes. 232-238
  
• Ba-Zhong Shen:
  A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate. 239-242
  
• Tadao Kasami, Toyoo Takata, Toru Fujiwara, Shu Lin:
  On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes. 242-245
  
• Joel M. Morris, Xiaojun Li:
  Some results on the asymptotic relative efficiency of a random-threshold decision rule. 246-249
  
• James A. Bucklew, John S. Sadowsky:
  A contribution to the theory of Chernoff bounds. 249-254
  
• Lawrence D. Brown, Richard C. Liu:
  The asymptotic risk in a signal parameter estimation problem. 254-257
  
• David L. Donoho, Philip B. Stark:
  A note on rearrangements, spectral concentration, and the zero-order prolate spheroidal wavefunction. 257-260
  
• Elias Masry:
  The wavelet transform of stochastic processes with stationary increments and its application to fractional Brownian motion. 260-264
  
• Robert J. Elliott:
  New finite-dimensional filters and smoothers for noisily observed Markov chains. 265-271
  
• Jonathan Hong, Martin Vetterli:
  Computing m DFT's over GF(q) with one DFT over GF(q^m). 271-274
  
• Pierre Baldi, Santosh S. Venkatesh:
  Random interactions in higher order neural networks. 274-283
  
• Yaoqi Yu, Rui J. P. de Figueiredo:
  Convergence of the calculation of the innovation process. 283-288
  
• En-Hui Yang, Shi-Yi Shen:
  Distortion program-size complexity with respect to a fidelity criterion and rate-distortion function. 288-292
  
• Sergio Verdú, Brian D. O. Anderson, Rodney A. Kennedy:
  Blind equalization without gain identification. 292-297
  
• Marc Teboulle, Igor Vajda:
  Convergence of best phi-entropy estimates. 297-301
  
• Vladimir Cuperman:
  Joint bit allocation and dimensions optimization for vector transform quantization. 302-305
  
• Shinya Matsufuji, Kyoki Imamura:
  Balanced quadriphase sequences with optimal periodic correlation properties constructed by real-valued bent functions. 305-310
  
• John K. Goutsias: Author's Reply to 'Comments on A Theoretical Analysis of Monte Carlo Algorithms for the Simulation of Gibbs Random Field Images'. 310-
• Radford M. Neal:
  Comments on 'A theoretical analysis of Monte Carlo algorithms for the simulation of Gibbs random field images'. 310-311
  
• Jacob Ziv:
  Correction to 'Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources' (Jul 90 861-863). 312-
  

• Frans M. J. Willems: Review of 'Elements of Information Theory' (Cover, T.M., and Thomas, J.A.; 1991). 313-
• Paul H. Siegel:
  Review of 'Finite Fields for Computer Scientists and Engineers' (McEliece, R.J.; 1987). 315-316
  

Volume 39, Number 2, March 1993

• Steven S. Pietrobon, Daniel J. Costello Jr.:
  Trellis coding with multidimensional QAM signal sets. 325-336
  
• Magnus Isaksson, Lars-Henning Zetterberg:
  Block-coded M-PSK modulation over GF(M). 337-346
  
• Martin Alles, Subbarayan Pasupathy:
  Coding for the discretely phase ambiguous additive white Gaussian channel. 347-357
  
• Ulrich K. Sorger:
  A new Reed-Solomon code decoding algorithm based on Newton's interpolation. 358-365
  
• Xiang-dong Hou:
  Some results on the covering radii of Reed-Muller codes. 366-378
  
• Mario Blaum, Jehoshua Bruck:
  Coding for skew-tolerant parallel asynchronous communications. 379-388
  
• Boris Y. Kavalerchik:
  A new model of numerical computer data and its application for construction of minimum-redundancy codes. 389-397
  
• Dafna Sheinwald, Richard C. Pasco:
  Deterministic prediction in progressive coding. 398-408
  
• Marijn van Eupen, Jacobus H. van Lint:
  On the minimum distance of ternary cyclic codes. 409-422
  
• Takeshi Hashimoto:
  A coded ARQ scheme with the generalized Viterbi algorithm. 423-432
  
• Venugopal V. Veeravalli, Tamer Basar, H. Vincent Poor:
  Decentralized sequential detection with a fusion center performing the sequential test. 433-442
  
• Richard G. Ogier, Vladislav Rutenburg, Nachum Shacham:
  Distributed algorithms for computing shortest pairs of disjoint paths. 443-455
  
• Israel Cidon, Roch Guérin, Asad Khamisy, Moshe Sidi:
  Analysis of a correlated queue in a communication system. 456-465
  
• Leandros Tassiulas, Anthony Ephremides:
  Dynamic server allocation to parallel queues with randomly varying connectivity. 466-478
  
• Tsutomu Kawabata:
  Uniform switching system by families of switching sets. 479-490
  
• Amos Lapidoth:
  On the reliability function of the ideal Poisson channel with noiseless feedback. 491-503
  
• Ofir Shalvi, Ehud Weinstein:
  Super-exponential methods for blind deconvolution. 504-519
  
• Paul C. Shields:
  Universal redundancy rates do not exist. 520-524
  
• Alf J. Isaksson:
  Analysis of identified 2-D noncausal models. 525-534
  
• William A. Gardner, Teri L. Archer:
  Exploitation of cyclostationarity for identifying the Volterra kernels of nonlinear systems. 535-542
  
• Venkat Anantharam:
  The input-output map of a monotone discrete-time quasireversible node. 543-552
  
• G. Robert Redinbo, Bernhard G. Zagar:
  Modifying real convolutional codes for protecting digital filtering systems. 553-564
  
• Christopher F. Barnes, Richard L. Frost:
  Vector quantizers with direct sum codebooks. 565-580
  
• Inchi Hu, Santosh S. Venkatesh:
  On the minimum expected duration of a coin tossing game. 581-593
  
• Ola Hössjer, Moncef Mettiji:
  Robust multiple classification of known signals in additive noise - An asymptotic weak signal approach. 594-608
  

• Roger S. Cheng, Sergio Verdú:
  On limiting characterizations of memoryless multiuser capacity regions. 609-612
  
• K. Leeuwin-Boullé, Jean-Claude Belfiore:
  The cutoff rate of time correlated fading channels. 612-617
  
• M. W. Thompson, Don R. Halverson, C. Tsai:
  Robust estimation of signal parameters with nonstationary and/or dependent data. 617-623
  
• Kenji Nakagawa, Fumio Kanaya:
  On the converse theorem in statistical hypothesis testing. 623-628
  
• Kenji Nakagawa, Fumio Kanaya:
  On the converse theorem in statistical hypothesis testing for Markov chains. 629-633
  
• Hossam M. H. Shalaby, Adrian Papamarcou:
  A note on the asymptotics of distributed detection with feedback. 633-640
  
• Arne Dür:
  Avoiding decoder malfunction in the Peterson-Gorenstein-Zierler decoder. 640-643
  
• John J. Komo, Maurice S. Lam:
  Primitive polynomials and M-sequences over GF(q^m). 643-647
  
• Torleiv Kløve:
  Minimum support weights of binary codes. 648-654
  
• Oscar S. Rothaus:
  Modified Gold codes. 654-656
  
• Vladimir I. Levenshtein, A. J. Han Vinck:
  Perfect (d, k)-codes capable of correcting single peak-shifts. 656-662
  
• Andries E. Brouwer, Tom Verhoeff:
  An updated table of minimum-distance bounds for binary linear codes. 662-677
  
• Andries E. Brouwer:
  The linear programming bound for binary linear codes. 677-680
  
• Helge Elbrønd Jensen, Tom Høholdt, Jørn Justesen:
  On the number of correctable errors for some AG-codes. 681-684
  
• Rodney M. Goodman, Robert J. McEliece, Masahiro Sayano:
  Phased burst error-correcting array codes. 684-693
  
• Iwan M. Duursma:
  Algebraic decoding using special divisors. 694-698
  
• Tsutomu Kawabata:
  Exact analysis of the Lempel-Ziv algorithm for i.i.d. sources. 698-702
  
• Sridhar Lakshmanan, Haluk Derin:
  Valid parameter space for 2-D Gaussian Markov random fields. 703-709
  
• Heinz-Josef Schlebusch:
  On the asymptotic efficiency of importance sampling techniques. 710-715
  
• Darel A. Linebarger, Ivan Hal Sudborough, Ioannis G. Tollis:
  Difference bases and sparse sensor arrays. 716-721
  

Volume 39, Number 3, May 1993

• Ueli M. Maurer:
  Secret key agreement by public discussion from common information. 733-742
  
• Dirk Ehrhard:
  Achieving the designed error capacity in decoding algebraic-geometric codes. 743-751
  
• Te Sun Han, Sergio Verdú:
  Approximation theory of output statistics. 752-772
  
• Roger S. Cheng, Sergio Verdú:
  Gaussian multiaccess channels with ISI: Capacity region and multiuser water-filling. 773-785
  
• Dae-Gwon Jeong, Jerry D. Gibson:
  Uniform and piecewise uniform lattice vector quantization for memoryless Gaussian and Laplacian sources. 786-804
  
• Robert M. Gray, Thomas G. Stockham Jr.:
  Dithered quantizers. 805-812
  
• Bin Yu, Terry P. Speed:
  A rate of convergence result for a universal D-semifaithful code. 813-820
  
• Vinay A. Vaishampayan:
  Design of multiple description scalar quantizers. 821-834
  
• Nam Phamdo, Nariman Farvardin, Takehiro Moriya:
  A unified approach to tree-structured and multistage vector quantization for noisy channels. 835-850
  
• Rajiv Laroia, Nariman Farvardin:
  A structured fixed-rate vector quantizer derived from a variable-length scalar quantizer - I: Memoryless sources. 851-867
  
• Rajiv Laroia, Nariman Farvardin:
  A structured fixed-rate vector quantizer derived from a variable-length scalar quantizer - II: Vector sources. 868-876
  
• Yossef Steinberg, Michael Gutman:
  An algorithm for source coding subject to a fidelity criterion, based on string matching. 877-886
  
• Neri Merhav, Meir Feder, Michael Gutman:
  Some properties of sequential predictors for binary Markov sources. 887-892
  
• John C. Kieffer:
  Strongly consistent code-based identification and order estimation for constrained finite-state model classes. 893-902
  
• Upamanyu Madhow, Michael B. Pursley:
  Acquisition in direct-sequence spread-spectrum communication networks: An asymptotic analysis. 903-912
  
• Frank R. Kschischang, Subbarayan Pasupathy:
  Optimal nonuniform signaling for Gaussian channels. 913-929
  
• Andrew R. Barron:
  Universal approximation bounds for superpositions of a sigmoidal function. 930-945
  
• Kai-Yeung Siu, Jehoshua Bruck, Thomas Kailath, Thomas Hofmeister:
  Depth efficient neural networks for division and related problems. 946-956
  
• Sreenivasa A. Raghavan, Jack K. Wolf, Laurence B. Milstein:
  On the performance evaluation of ISI channels. 957-965
  
• James A. Bucklew, Thomas G. Kurtz, William A. Sethares:
  Weak convergence and local stability properties of fixed step size recursive algorithms. 966-978
  
• Miroslaw Pawlak:
  Kernel classification rules from missing data. 979-988
  
• Ta-Hsin Li, Benjamin Kedem:
  Strong consistency of the contraction mapping method for frequency estimation. 989-998
  
• Leo Breiman:
  Hinging hyperplanes for regression, classification, and function approximation. 999-1013
  
• Yuichi Saitoh, Hideki Imai:
  Generalized concatenated codes for channels where unidirectional byte errors are predominant. 1014-1022
  
• Ivan Vrana:
  Optimum statistical estimates in conditions of ambiquity. 1023-1030
  

• Sidney Yakowitz:
  Asymptotic theory for a fast frequency detector. 1031-1036
  
• F. Österreicher, I. Vajda:
  Statistical information and discrimination. 1036-1039
  
• Karl Gerlach, Kevin J. Sangston:
  Robust locally optimum detection of signals in dependent noise. 1040-1043
  
• Russel J. Higgs, John F. Humphreys:
  Decoding the ternary Golay code. 1043-1046
  
• Laurence B. Wolfe, Chein-I Chang:
  A complete sufficient statistic for finite-state Markov processes with application to source coding. 1047-1049
  
• Xiaolin Wu, Kaizhong Zhang:
  Quantizer monotonicities and globally optimal scalar quantizer design. 1049-1053
  
• Kenneth Zeger, Miriam R. Kantorovitz:
  Average number of facets per cell in tree-structured vector quantizer partitions. 1053-1055
  
• George Kesidis, Jean C. Walrand:
  Relative entropy between Markov transition rate matrices. 1056-1057
  
• Tadao Kasami, Toyoo Takata, Toru Fujiwara, Shu Lin:
  On complexity of trellis structure of linear block codes. 1057-1064
  
• Andries P. Hekstra:
  On the capacity of a binary channel with timing jitter at signal transitions modeled as a random walk. 1064-1067
  
• Iwan M. Duursma:
  Majority coset decoding. 1067-1070
  
• Francesco Fabris, Giaconno Della Riccia:
  An application of the Hopfield model to Huffman codes. 1071-1076
  
• Khaled H. Biyari, William C. Lindsey:
  Statistical distributions of Hermitian quadratic forms in complex Gaussian variables. 1076-1082
  
• Tomás Novosad:
  A new family of quadriphase sequences for CDMA. 1083-1085
  
• Ning Zhang, Solomon W. Golomb:
  Polyphase sequence with low autocorrelations. 1085-1089
  
• Jian Gu, Thomas E. Fuja:
  A generalized Gilbert-Varshamov bound derived via analysis of a code-search algorithm. 1089-1093
  
• Jørn M. Jensen:
  On the construction of some very long cyclic codes. 1093-1094
  
• Hendrik C. Ferreira, C. S. Coetzee, Mark A. Herro:
  Mathematical models for super channels with imbedded constrained codes. 1094-1100
  
• Amir Said, Reginaldo Palazzo Jr.:
  Using combinatorial optimization to design good unit-memory convolutional codes. 1100-1108
  
• Reginaldo Palazzo Jr.:
  A time-varying convolutional encoder better than the best time-invariant encoder. 1109-1110
  
• Jonathan J. Ashley, Michael Hilden, Patrick Perry, Paul H. Siegel:
  Correction to 'A note on the Shannon capacity of runlength-limited codes' (Jul 87 601-605). 1110-1112
  

Volume 39, Number 4, July 1993

• Rudolf Ahlswede, Imre Csiszár:
  Common randomness in information theory and cryptography - I: Secret sharing. 1121-1132
  
• Joachim M. Buhmann, Hans Kühnel:
  Vector quantization with complexity costs. 1133-1145
  
• András Faragó, Gábor Lugosi:
  Strong universal consistency of neural network classifiers. 1146-1151
  
• Henry J. Landau:
  On the density of phase-space expansions. 1152-1156
  
• Giuseppe Caire, Robert L. Grossman, H. Vincent Poor:
  Wavelet transforms associated with finite cyclic groups. 1157-1166
  
• R. Padmanabha Rao, William A. Pearlman:
  Alphabet-constrained vector quantization. 1167-1179
  
• Alexander V. Trushkin:
  On the design of an optimal quantizer. 1180-1194
  
• Patrick Solé, Philip Stokes:
  Covering radius, codimension, dual-distance width. 1195-1203
  
• Toyoo Takata, Satoshi Ujita, Tadao Kasami, Shu Lin:
  Multistage decoding of multilevel block M-PSK modulation codes and its performance analysis. 1204-1218
  
• Rolf Johannesson, Zhe-xian Wan:
  A linear algebra approach to minimal convolutional encoders. 1219-1233
  
• A. Robert Calderbank, Nambirajan Seshadri:
  Multilevel codes for unequal error protection. 1234-1248
  
• George W. Hart, Anastasios T. Bouloutas:
  Correcting dependent errors in sequences generated by finite-state processes. 1249-1260
  
• Neri Merhav:
  Universal decoding for memoryless Gaussian channels with a deterministic interference. 1261-1269
  
• Jacob Ziv, Neri Merhav:
  A measure of relative entropy between individual sequences with application to universal classification. 1270-1279
  
• Neri Merhav, Meir Feder:
  Universal schemes for sequential decision from individual data sequences. 1280-1292
  
• Fredy D. Neeser, James L. Massey:
  Proper complex random processes with applications to information theory. 1293-1302
  
• Jonathan J. Ashley:
  Sliding block codes between constrained systems. 1303-1309
  
• Aaron B. Kiely, John T. Coffey:
  On the capacity of a cascade of channels. 1310-1321
  
• Gerasimos Potamianos, John K. Goutsias:
  Partition function estimation of Gibbs random field images using Monte Carlo simulations. 1322-1332
  
• Nikhil Balram, José M. F. Moura:
  Noncausal Gauss Markov random fields: Parameter structure and estimation. 1333-1355
  
• Jérôme Idier, Yves Goussard:
  Markov modeling for Bayesian restoration of two-dimensional layered structures. 1356-1373
  
• Gerald R. Benitz:
  Asymptotic results for maximum likelihood estimation with an array of sensors. 1374-1385
  
• Lawrence D. Brown, Richard C. Liu:
  Bounds on the Bayes and minimax risk for signal parameter estimation. 1386-1394
  

• Thierry Chonavel, Philippe Loubaton:
  On the realization of band- limited power spectra from partial covariance sequence. 1395-1397
  
• Mark Stamp, Clyde F. Martin:
  An algorithm for the k-error linear complexity of binary sequences with period 2n. 1398-1401
  
• M. Eugene Meyer, D. V. Gokhale:
  Kullback-Leibler information measure for studying convergence rates of densities and distributions. 1401-1404
  
• John W. Miller, Rodney M. Goodman, Padhraic Smyth:
  On loss functions which minimize to conditional expected values and posterior proba- bilities. 1404-1408
  
• Dimitris Nicolas Politis:
  Nonparametric maximum entropy. 1409-1413
  
• Rudolf Ahlswede, Leonid A. Bassalygo, Mark S. Pinsker:
  Nonbinary codes correcting localized errors. 1413-1416
  
• Rudolf Ahlswede:
  The maximal error capacity of arbitrarily varying channels for constant list sizes. 1416-1417
  
• Laura Ekroot, Thomas M. Cover:
  The entropy of Markov trajectories. 1418-1421
  
• Gerhard J. M. van Wee:
  Some new lower bounds for binary and ternary covering codes. 1422-1424
  
• Henk D. L. Hollmann:
  A relation between Levenshtein-type distances and insertion-and-deletion correcting capabilities of codes. 1424-1427
  
• Gregory J. Pottie, A. Robert Calderbank:
  Further asymptotic upper bounds on the minimum distance of trellis codes. 1428-1431
  
• Hong-Yeop Song, Irving S. Reed, Solomon W. Golomb:
  On the nonperiodic cyclic equivalence classes of Reed-Solomon codes. 1431-1434
  
• Alexander Vardy, Yair Be'ery:
  Maximum likelihood decoding of the Leech lattice. 1435-1444
  
• Alexander V. Kuznetsov, A. J. Han Vinck:
  A coding scheme for single peak-shift correction in (d, k)-constrained channels. 1444-1450
  
• Robert C. Davis, Hans-Andrea Loeliger:
  A nonalgorithmic maximum likelihood decoder for trellis codes. 1450-1453
  
• Tuvi Etzion, Gadi Greenberg, Iiro S. Honkala:
  Normal and abnormal codes. 1453-1456
  
• John A. Gubner:
  Distributed estimation and quantization. 1456-1459
  
• Philippe Jacquet:
  Random infinite trees and supercritical behavior of collision resolution algorithms. 1460-1465
  
• William H. R. Equitz, Thomas M. Cover: Addendum to 'Successive refinement of information' (Mar 91 269-275). 1465-
• Venkat Anantharam: Correction to 'The Input-Output Map of a Monotone Discrete-Time Quasireversible Node'. 1466-

Volume 39, Number 5, September 1993

• John C. Kieffer:
  A survey of the theory of source coding with a fidelity criterion. 1473-1490
  
• G. David Forney Jr., Mitchell D. Trott:
  The dynamics of group codes: State spaces, trellis diagrams, and canonical encoders. 1491-1513
  
• Yunghsiang S. Han, Carlos R. P. Hartmann, Chih-Chieh Chen:
  Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes. 1514-1523
  
• Oscar Moreno, P. Vijay Kumar:
  Minimum distance bounds for cyclic codes and Deligne's theorem. 1524-1534
  
• Ahsun H. Murad, Thomas E. Fuja:
  Distributed decoding of cyclic block codes using a generalization of majority-logic decoding. 1535-1545
  
• Charles G. Boncelet Jr.:
  Block arithmetic coding for source compression. 1546-1554
  
• Edward G. Coffman Jr., Shlomo Halfin, Alain Jean-Marie, Philippe Robert:
  Stochastic analysis of a slotted FIFO communication channel. 1555-1566
  
• Michael Drmota, Ulrich Schmid:
  The analysis of the expected successful operation time of slotted Aloha. 1567-1577
  
• Mark R. Bell:
  Information theory and radar waveform design. 1578-1597
  
• Wendy S. Smith, Paul H. Wittke, L. Lorne Campbell:
  Error probabilities on fading channels with intersymbol interference and noise. 1598-1607
  
• Moni Naor, Alon Orlitsky, Peter W. Shor:
  Three results on interactive communication. 1608-1615
  
• Jørn Justesen:
  Bounded distance decoding of unit memory codes. 1616-1627
  
• Jonathan Hong, Martin Vetterli:
  Hartley transforms over finite fields. 1628-1638
  
• Alfred Menezes, Tatsuaki Okamoto, Scott A. Vanstone:
  Reducing elliptic curve logarithms to logarithms in a finite field. 1639-1646
  
• Wojciech Szpankowski:
  Asymptotic properties of data compression and suffix trees. 1647-1659
  

• Wael A. Hashlamoun, Pramod K. Varshney:
  Further results on distributed Bayesian signal detection. 1660-1661
  
• Zhen Zhang, Chungming Tu:
  On the construction of systematic tEC/AUED codes. 1662-1669
  
• Steven B. Lowen, Malvin Carl Teich:
  Fractal renewal processes. 1669-1671
  
• Israel Bar-David, Eli Plotnik, Raphael Rom:
  Forward collision resolution - A technique for random multiple-access to the adder channel. 1671-1675
  
• Jonathan S. Abel:
  A bound on mean-square-estimate error. 1675-1680
  
• Boris D. Kudryashov:
  Error probability for repeat request systems with convolutional codes. 1680-1684
  
• K. X. Karakostas, H. P. Wynn:
  On the covariance function of stationary binary sequences with given mean. 1684-1687
  
• Kumar Balachandran, John B. Anderson, Weiler Alves Finamore, Cecilio J.-L. Pimentel:
  Better rate 1/2 coded continuous phase modulation schemes and the M-algorithm. 1687-1694
  
• Julia Abrahams, Marc J. Lipman:
  Relative uniformity of sources and the comparison of optimal code costs. 1695-1697
  
• Ya-Qin Zhang, Raymond L. Pickholtz, Murray H. Loew:
  Rate-distortion bound for a class of non-Gaussian sources with memory. 1697-1701
  
• Robert L. Ward:
  Weight enumerators of more irreducible cyclic binary codes. 1701-1709
  
• Victor K.-W. Wei, Kyeongcheol Yang:
  On the generalized Hamming weights of product codes. 1709-1713
  
• Feng-Wen Sun, Henk C. A. van Tilborg:
  Approaching capacity by equiprobable signaling on the Gaussian channel. 1714-1716
  
• Khaled Ben Letaief, John S. Sadowsky:
  New importance sampling methods for simulating sequential decoders. 1716-1722
  
• Ram Zamir, Meir Feder:
  A generalization of the entropy power inequality with applications. 1723-1728
  
• Vyacheslav V. Prelov, Edward C. van der Meulen:
  An asymptotic expression for the information and capacity of a multidimensional channel with weak input signals. 1728-1735
  
• Tamás Linder, Christian Schlegel, Kenneth Zeger: Corrected proof of de Buda's theorem. 1735-
• Edward K. Orcutt, Michael W. Marcellin:
  Enumerable multitrack (d, k) block codes. 1738-1744
  
• Edward K. Orcutt, Michael W. Marcellin:
  Redundant multitrack (d, k) codes. 1744-1750
  
• T. Aaron Gulliver, Vijay K. Bhargava:
  Twelve good rate (m-r)/pm quasicyclic codes. 1750-1751
  
• Mario Blaum, Jehoshua Bruck, Levon H. Khachatrian:
  Constructions of skew-tolerant and skew-detecting codes. 1751-1757
  
• Dongdai Lin, Mulan Liu:
  Structure and properties of linear recurring m-arrays. 1758-1762
  
• László Györfi, István Vajda:
  Constructions of protocol sequences for multiple access collision channel without feedback. 1762-1765
  
• Ramanarayanan Viswanathan:
  A note on distributed estimation and sufficiency. 1765-1767
  

Volume 39, Number 6, November 1993

• Sergio Benedetto, Roberto Garello, Marina Mondin, Guido Montorsi:
  Geometrically uniform partitions of L×MPSK constellations and related binary trellis codes. 1773-1798
  
• Amir K. Khandani, Peter Kabal:
  Shaping multidimensional signal spaces - I: Optimum shaping, shell mapping. 1799-1808
  
• Amir K. Khandani, Peter Kabal:
  Shaping multidimensional signal spaces - II: Shell-addressed constellations. 1809-1819
  
• Lee-Fang Wei:
  Coded M-DPSK with built-in time diversity for fading channels. 1820-1839
  
• Hiroyoshi Morita, Kingo Kobayashi:
  On asymptotic optimality of a sliding window variation of Lempel-Ziv codes. 1840-1846
  
• Po-Ning Chen, Adrian Papamarcou:
  New asymptotic results in parallel distributed detection. 1847-1863
  
• Amod V. Dandawate, Georgios B. Giannakis:
  Nonparametric cyclic- polyspectral analysis of AM signals and processes with missing observations. 1864-1876
  
• Amotz Bar-Noy, Ilan Kessler:
  Tracking mobile users in wireless communications networks. 1877-1886
  
• George C. Polyzos, Mart L. Molle:
  A queueing theoretic approach to the delay analysis for the FCFS 0.487 conflict resolution algorithm. 1887-1906
  
• Saul B. Gelfand, C. S. Ravishankar:
  A tree-structured piecewise linear adaptive filter. 1907-1922
  
• Graham W. Pulford, Rodney A. Kennedy, Brian D. O. Anderson:
  An upper bound on the performance of a novel feedforward perceptron equalizer. 1923-1929
  
• Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky:
  Privacy, additional information and communication. 1930-1943
  
• Ian Galton:
  Granular quantization noise in the first-order delta-sigma modulator. 1944-1956
  

• Michael L. Honig:
  Channel shaping to maximize minimum distance ú. 1957-1961
  
• Neri Merhav:
  On the minimum description length principle for sources with piecewise constant parameters. 1962-1967
  
• Eimear M. Goggin:
  Limits of conditional expectations. 1967-1972
  
• Edgar N. Gilbert:
  Increased information rate by oversampling. 1973-1976
  
• Jacobus H. Weber, Khaled A. S. Abdel-Ghaffar:
  Cascading runlength-limited sequences. 1976-1984
  
• Oscar Moreno, Richard A. Games, Herbert Taylor:
  Sonar sequences from Costas arrays and the best known sonar sequences with up to 100 symbols. 1985-1987
  
• A. J. van Zanten:
  Minimal-change order and separability in linear codes. 1988-1989
  
• Harold Fredricksen:
  The number of nonlinear shift registers that produce all vectors of weight <t. 1989-1990
  

Last update Mon May 20 04:07:06 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page