IEEE Transactions on Information Theory, Volume 40, 1994

Volume 40, Number 1, January 1994

• Zhen Zhang, Xiang-Gen Xia:
  Three messages are not optimal in worst case interactive communication. 3-10
  
• Yossef Steinberg, H. Vincent Poor:
  Sequential amplitude estimation in multiuser communications. 11-20
  
• Robert J. McEliece, Kumar N. Sivarajan:
  Performance limits for channelized cellular telephone systems. 21-34
  
• Venugopal V. Veeravalli, Tamer Basar, H. Vincent Poor:
  Minimax robust decentralized detection. 35-40
  
• A. M. Maras:
  Locally optimum Bayes detection in ergodic Markov noise. 41-55
  
• M. Mobed, William L. Root:
  Estimation of constrained parameters in a linear model with multiplicative and additive noise. 56-66
  
• Amod V. Dandawate, Georgios B. Giannakis:
  Nonparametric polyspectral estimators for kth-order (almost) cyclostationary processes. 67-84
  
• Hirosuke Yamamoto:
  Coding theorems for Shannon's cipher system with correlated source outputs, and common information. 85-95
  
• Boris Ryabko:
  Fast and efficient coding of information sources. 96-99
  
• Serap A. Savari, Robert G. Gallager:
  Arithmetic coding for finite-state noiseless channels. 100-107
  
• Michelle Effros, Philip A. Chou, Eve A. Riskin, Robert M. Gray:
  A progressive universal noiseless coder. 108-117
  
• Douglas R. Stinson:
  Decomposition constructions for secret-sharing schemes. 118-125
  
• Xuemin Chen, Irving S. Reed, Trieu-Kien Truong:
  A performance comparison of the binary quadratic residue codes with the 1/2-rate convolutional codes. 126-136
  

• Sergio Benedetto, Roberto Garello, Marina Mondin, Guido Montorsi:
  Geometrically uniform TCM codes over groups based on L × MPSK constellations. 137-152
  
• Morteza Naraghi-Pour, Manjunath V. Hegde, N. Arora:
  DPCM encoding of regenerative composite processes. 153-160
  
• K. T. Oh, J. J. Matzner:
  Performance of a general decoding technique over the class of randomly chosen parity check codes. 160-166
  
• A. Robert Calderbank, Peter C. Fishburn:
  The normalized second moment of the binary lattice determined by a convolutional code. 166-174
  
• Sylvia B. Encheva, Torleiv Kløve:
  Codes satisfying the chain condition. 175-180
  
• Serap A. Savari:
  Some notes on Varn coding. 181-186
  
• Nam Phamdo, Nariman Farvardin:
  Optimal detection of discrete Markov sources over discrete memoryless channels - applications to combined source-channel coding. 186-193
  
• Marijn van Eupen:
  Five new optimal ternary linear codes. 193-
  
• Juriaan Simonis:
  Restrictions on the weight distribution of binary linear codes imposed by the structure of Reed-Muller codes. 194-196
  
• Robert Morelos-Zaragoza, Shu Lin:
  On a class of optimal nonbinary linear unequal-error-protection codes for two sets of messages. 196-200
  
• Hervé Chabanne, Graham H. Norton:
  The n-dimensional key equation and a decoding application. 200-203
  
• Daniel Augot, Nicolas Sendrier:
  Idempotents and the BCH bound. 204-207
  
• Klaus Huber:
  Codes over Gaussian integers. 207-216
  
• R. G. Egri, F. A. Horrigan:
  A finite group of complex integers and its application to differentially coherent detection of QAM signals. 216-219
  
• Jukka Teuhola, Timo Raita:
  Arithmetic coding into fixed-length codewords. 219-223
  
• Carsten Dahl:
  Fast decoding of codes from algebraic curves. 223-229
  
• Jerry D. Gibson:
  A bound on the rate of a system for encoding an unknown Gaussian autoregressive source. 230-236
  
• F. Brouaye:
  Asymptotic normality of some Hermitian forms with complex noisy data. 236-239
  
• Giovanni Jacovitti, Alessandro Neri:
  Estimation of the autocorrelation function of complex Gaussian stationary processes by amplitude clipped signals. 239-245
  
• Vinay A. Vaishampayan, Jaroslaw Domaszewicz:
  Design of entropy-constrained multiple-description scalar quantizers. 245-250
  
• John S. Sadowsky:
  On maximizing linear system output energy with an input envelope constraint. 251-253
  
• Bixio Rimoldi:
  Successive refinement of information: characterization of the achievable rates. 253-259
  
• Meir Feder, Neri Merhav:
  Relations between entropy and error probability. 259-266
  
• László Györfi, Istvan Pali, Edward C. van der Meulen:
  There is no universal source code for an infinite source alphabet. 267-271
  
• Yuanxing Li, Robert H. Deng, Xinmei Wang:
  On the equivalence of McEliece's and Niederreiter's public-key cryptosystems. 271-273
  
• Steven M. Bellovin, Michael Merritt:
  An attack on the Interlock Protocol when used for authentication. 273-275
  
• J. W. P. Hirschfeld, Michael A. Tsfasman, Serge G. Vladut:
  The weight hierarchy of higher dimensional Hermitian codes. 275-278
  
• David M. Koppelman, A. Yavuz Oruç:
  The complexity of routing in Clos permutation networks. 278-284
  
• Meir Feder, Neri Merhav, Michael Gutman: Correction to 'Universal prediction of individual sequences' (Jul 92 1258-1270). 285

• Thomas M. Cover: Review of 'Complexity, Entropy and the Physics of Information' (Zurek, W.H., Ed.; 1990). 286-
• Nariman Farvardin: Review of 'Vector Quantization and Signal Compression' (Gersho, A., and Gray, R.M.; 1992). 287-
• Ian F. Blake: Review of 'Source and Channel Coding: An Algorithmic Approach' (Anderson, J.B., and Mohan, S.; 1991). 289-

Volume 40, Number 2, March 1994

• A. Roger Hammons Jr., P. Vijay Kumar, A. Robert Calderbank, Neil J. A. Sloane, Patrick Solé:
  The Z₄-linearity of Kerdock, Preparata, Goethals, and related codes. 301-319
  
• T. Kaneko, T. Nishijima, Hiroshige Inazumi, Shigeichi Hirasawa:
  An efficient maximum-likelihood-decoding algorithm for linear block codes with algebraic decoder. 320-327
  
• Ofir Shalvi, Ehud Weinstein:
  Maximum likelihood and lower bounds in system identification with non-Gaussian inputs. 328-339
  
• Lang Tong, Guanghan Xu, Thomas Kailath:
  Blind identification and equalization based on second-order statistics: a time domain approach. 340-349
  
• Khaled H. Biyari, William C. Lindsey:
  Binary communications through noisy, non-Gaussian channels. 350-362
  
• Bertrand M. Hochwald, Arye Nehorai:
  Concentrated Cramer-Rao bound expressions. 363-371
  
• Michael A. Kouritzin:
  On Almost-Sure Bounds for the LMS Algorithm. 372-383
  
• Marcelo J. Weinberger, Neri Merhav, Meir Feder:
  Optimal sequential probability assignment for individual sequences. 384-396
  
• Hossam M. H. Shalaby, Adrian Papamarcou:
  Error exponents for distributed detection of Markov sources. 397-408
  
• Gregory Poltyrev:
  On coding without restrictions for the AWGN channel. 409-417
  
• Lars K. Rasmussen, Stephen B. Wicker:
  The performance of type-I trellis coded hybrid-ARQ protocols over AWGN and slowly fading channels. 418-428
  
• Yoram Baram:
  Corrective memory by a symmetric sparsely encoded network. 429-438
  
• L. K. Jones:
  Good weights and hyperbolic kernels for neural networks, projection pursuit, and pattern classification: Fourier strategies for extracting information from high-dimensional data. 439-454
  
• Kai-Yeung Siu, Vwani P. Roychowdhury, Thomas Kailath:
  Rational approximation techniques for analysis of neural networks. 455-466
  
• Vwani P. Roychowdhury, Alon Orlitsky, Kai-Yeung Siu:
  Lower bounds on threshold and related circuits via communication complexity. 467-474
  
• Gábor Lugosi, Miroslaw Pawlak:
  On the posterior-probability estimate of the error rate of nonparametric classification rules. 475-481
  
• Kjell Jørgen Hole, Øyvind Ytrehus:
  Improved coding techniques for preceded partial-response channels. 482-493
  
• Andrew Klapper, Mark Goresky:
  Partial period autocorrelations of geometric sequences. 494-502
  

• Xuemin Chen, Irving S. Reed, Trieu-Kien Truong:
  No binary quadratic residue code of length 8m-1 is quasi-perfect. 503-504
  
• Hong-Yeop Song, Solomon W. Golomb:
  Some new constructions for simplex codes. 504-507
  
• Julia Abrahams:
  Parallelized Huffman and Hu-Tucker searching. 508-510
  
• B. Groneick, S. Grosse:
  New binary codes. 510-512
  
• Jonathan J. Ashley, Marie-Pierre Béal:
  A note on the method of poles for code construction. 512-517
  
• P. Larsson:
  Bounds on constant weight codes correcting localized errors. 517-521
  
• Amnon Gavish, Abraham Lempel:
  On ternary complementary sequences. 522-526
  
• T. Kirimoto, Yoshimasa Oh-Hashi:
  Orthogonal periodic sequences derived from M-sequences on GF(q). 526-532
  
• Serdar Boztas, P. Vijay Kumar:
  Binary sequences with Gold-like correlation but larger linear span. 532-537
  
• Thierry P. Berger:
  The automorphism group of double-error-correcting BCH codes. 538-542
  
• Gerard van der Geer, Marcel van der Vlugt:
  On generalized Hamming weights of BCH codes. 543-546
  
• Alexander Vardy, Yair Be'ery:
  Maximum-likelihood soft decision decoding of BCH codes. 546-554
  
• Henning Stichtenoth, Conny Voss:
  Generalized Hamming weights of trace codes. 554-558
  
• Victor K.-W. Wei, Gui Liang Feng:
  Improved lower bounds on the sizes of error-correcting codes for list decoding. 558-563
  
• Chang-jia Chen, Tai-Yi Chen, Hans-Andrea Loeliger:
  Construction of linear ring codes for 6 PSK. 563-566
  
• Takeshi Hashimoto:
  On the error exponent of convolutionally coded ARQ. 567-575
  
• Tamás Linder, Kenneth Zeger:
  Asymptotic entropy-constrained performance of tessellating and universal randomized lattice quantization. 575-579
  
• Péter Gács, A. Gal:
  Lower bounds for the complexity of reliable Boolean circuits with noisy gates. 579-583
  
• C. R. Shankwitz, Tryphon T. Georgiou:
  The envelope of spectral power for stochastic processes. 584-588
  
• Kenjiro Yanagi:
  An upper bound to the capacity of discrete time Gaussian channel with feedback - Part II. 588-593
  
• G. Hedby:
  Error bounds for the Euclidean channel subject to intentional jamming. 594-600
  
• Claude Carlet, Jennifer Seberry, Xian-Mo Zhang:
  Comments on 'Generating and counting binary Bent sequences'. 600-
  
• Po-Ning Chen, Adrian Papamarcou: Correction to 'New asymptotic results in parallel distributed detection' (Nov 93 1847-1863). 601

Volume 40, Number 3, May 1994

• Paul H. Algoet:
  The strong law of large numbers for sequential decisions under uncertainty. 609-633
  
• Yossef Steinberg, Sergio Verdú:
  Channel simulation and coding with side information. 634-646
  
• Sangmin Lee, Kim A. Winick:
  Very noisy channels, reliability functions, and exponentially optimum codes. 647-661
  
• Israel Bar-David, Eli Plotnik, Raphael Rom:
  Limitations of the capacity of the M-user binary adder channel due to physical considerations. 662-673
  
• Rudolf Ahlswede, Zhen Zhang:
  On multiuser write-efficient memories. 674-686
  
• Bixio Rimoldi, Quinn Li:
  Catastrophic continuous phase modulation schemes and their noncatastrophic equivalents. 687-695
  
• Sanjeev R. Kulkarni, David N. C. Tse:
  A paradigm for class identification problems. 696-705
  
• János Körner, M. Lucertini:
  Compressing inconsistent data. 706-715
  
• Peter Jeavons, David A. Cohen, John Shawe-Taylor:
  Generating binary sequences for stochastic computing. 716-720
  
• Michael J. Steiner:
  The strong simplex conjecture is false. 721-731
  
• Q. Jin, Zhi-Quan Luo, Kon Max Wong:
  An optimum complete orthonormal basis for signal analysis and design. 732-742
  
• Kenneth G. Paterson:
  Perfect maps. 743-753
  
• Tuvi Etzion, Alexander Vardy:
  Perfect binary codes: constructions, properties, and enumeration. 754-763
  
• Yuval Berger, Yair Be'ery:
  Soft trellis-based decoder for linear block codes. 764-773
  
• Jian Gu, Thomas E. Fuja:
  A new approach to constructing optimal block codes for runlength-limited channels. 774-785
  
• Amos Beimel, Benny Chor:
  Universally ideal secret-sharing schemes. 786-794
  
• D. W. Sauder, Evaggelos Geraniotis:
  Signal detection games with power constraints. 795-807
  
• T. T. Kadota:
  Integration of complementary detection-localization systems - An example. 808-819
  
• Demetri Psaltis, Robert R. Snapp, Santosh S. Venkatesh:
  On the finite sample performance of the nearest neighbor classifier. 820-837
  
• David Burshtein:
  Nondirect convergence radius and number of iterations of the Hopfield associative memory. 838-847
  
• Ian Galton:
  Granular quantization noise in a class of delta-sigma modulators. 848-859
  
• Rajiv Laroia, Nariman Farvardin:
  Trellis-based scalar-vector quantizer for memoryless sources. 860-870
  
• Venkat Anantharam, Ayalvadi J. Ganesh:
  Correctness within a constant of an optimal buffer allocation rule of thumb. 871-882
  

• R. M. Dudley, Sanjeev R. Kulkarni, T. J. Richardson, Ofer Zeitouni:
  A metric entropy bound is not sufficient for learnability. 883-885
  
• Sandeep Pombra, Thomas M. Cover:
  Non white Gaussian multiple access channels with feedback. 885-892
  
• Frank R. Kschischang, Subbarayan Pasupathy:
  Optimal shaping properties of the truncated polydisc. 892-903
  
• Hanan Herzberg, Gregory Poltyrev:
  Techniques of bounding the probability of decoding error for block coded modulation structures. 903-911
  
• Torleiv Kløve:
  The weight distribution of cosets. 911-913
  
• Kyeongcheol Yang, P. Vijay Kumar, Henning Stichtenoth:
  On the weight hierarchy of geometric Goppa codes. 913-920
  
• Zhe-xian Wan, Ben J. M. Smeets, Peter Vanroose:
  On the construction of cartesian authentication codes over symplectic spaces. 920-929
  
• Michael J. Steiner:
  Constructive codes for arbitrary discrete memoryless channels. 929-934
  
• Tjalling J. Tjalkens:
  On the principal state method for run-length limited sequences. 934-941
  
• Mario Blaum, Jehoshua Bruck:
  Coding for delay-insensitive communication with partial synchronization. 941-945
  
• P. D. Tiu, D. I. Wallace:
  Norm quadratic-residue codes. 946-949
  
• P. Farkas, K. Bruhl:
  Three best binary linear block codes of minimum distance fifteen. 949-951
  
• Jørn M. Jensen:
  A class of constacyclic codes. 951-954
  
• Wai Ho Mow:
  On the bounds on odd correlation of sequences. 954-955
  
• Karl Gerlach, Kevin J. Sangston:
  A sharp false alarm upper-bound for a matched filter bank detector. 955-960
  
• P. Bondon:
  Polynomial estimation of the amplitude of a signal. 960-965
  
• John B. Anderson, Elke Offer:
  Reduced-state sequence detection with convolutional codes. 965-972
  

Volume 40, Number 4, July 1994

• Gui Liang Feng, Victor K.-W. Wei, Thammavarapu R. N. Rao, Kenneth K. Tzeng:
  Simplified understanding and efficient decoding of a class of algebraic-geometric codes. 981-1002
  
• Gui Liang Feng, Thammavarapu R. N. Rao:
  A simple approach for construction of algebraic-geometric codes from affine plane curves. 1003-1012
  
• Stamatis Cambanis, Elias Masry:
  Wavelet approximation of deterministic and random signals: convergence properties and rates. 1013-1029
  
• Ofer Amrani, Yair Be'ery, Alexander Vardy, Feng-Wen Sun, Henk C. A. van Tilborg:
  The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions. 1030-1043
  
• Rajiv Laroia, Nariman Farvardin, Steven A. Tretter:
  On optimal shaping of multidimensional constellations. 1044-1056
  
• R. H.-H. Yang, Desmond P. Taylor:
  Trellis-coded continuous-phase frequency-shift keying with ring convolutional codes. 1057-1067
  
• Ettore Fornasini, Maria Elena Valcher:
  Algebraic aspects of two-dimensional convolutional codes. 1068-1082
  
• Ron M. Roth, Paul H. Siegel:
  Lee-metric BCH codes and their application to constrained and partial-response channels. 1083-1096
  
• A. Robert Calderbank, Costas N. Georghiades:
  Synchronizable codes for the optical OPPM channel. 1097-1107
  
• Iwan M. Duursma, Ralf Kötter:
  Error-locating pairs for cyclic codes. 1108-1121
  
• Dongfeng Li, Wende Chen:
  New lower bounds for binary covering codes. 1122-1129
  
• Dana J. Taipale, M. J. Seo:
  An efficient soft-decision Reed-Solomon decoding algorithm. 1130-1139
  
• Gilles Lachaud, Jacques Stern:
  Polynomial-time construction of codes II. Spherical codes and the kissing number of spheres. 1140-1146
  
• Sergio Verdú, Te Sun Han:
  A general formula for channel capacity. 1147-1157
  
• Bruce Hajek, Nikolay B. Likhanov, Boris S. Tsybakov:
  On the delay in a multiple-access system with large propagation delay. 1158-1166
  
• Chuang-Chun Liu, Prakash Narayan:
  Order estimation and sequential universal data compression of a hidden Markov source by the method of mixtures. 1167-1180
  
• Guoqi Qian, George Gabor, R. P. Gupta:
  On stochastic complexity estimation: a decision-theoretic approach. 1181-1191
  
• M. Ammar, Yih-Fang Huang:
  Quantization based on statistical moments for signal detection: design and analysis. 1192-1204
  

• Alfred O. Hero III, Jeffrey A. Fessler:
  A recursive algorithm for computing Cramer-Rao- type bounds on estimator covariance. 1205-1210
  
• Neri Merhav:
  Bounds on achievable convergence rates of parameter estimators via universal coding. 1210-1215
  
• Nicolò Cesa-Bianchi, Anders Krogh, Manfred K. Warmuth:
  Bounds on approximate steepest descent for likelihood maximization in exponential families. 1215-1218
  
• G. N. Newsam, C. R. Dietrich:
  Bounds on the size of nonnegative definite circulant embeddings of positive definite Toeplitz matrices. 1218-1220
  
• Xian-Da Zhang, Ying-Chang Liang, Yan-Da Li:
  A hybrid approach to harmonic retrieval in non-Gaussian ARMA noise. 1220-1226
  
• Prashant P. Gandhi, Saleem A. Kassam:
  Optimality of the cell averaging CFAR detector. 1226-1228
  
• Andre Ferrari, Gérard Alengrin:
  High-order ergodicity of a complex harmonic process. 1228-1229
  
• Shlomo Shamai:
  Information rates by oversampling the sign of a bandlimited process. 1230-1236
  
• Erdal Arikan:
  An upper bound on the zero-error list-coding capacity. 1237-1240
  
• Victor Yu. Krachkovsky:
  Bounds on the zero-error capacity of the input-constrained bit-shift channel. 1240-1244
  
• Thomas M. Cover, Zhen Zhang:
  On the maximum entropy of the sum of two dependent random variables. 1244-1246
  
• R. Schack:
  The length of a typical Huffman codeword. 1246-1247
  
• Te Sun Han, Sergio Verdú:
  Generalizing the Fano inequality. 1247-1251
  
• Ning Chang, Solomon W. Golomb:
  On n-phase Barker sequences. 1251-1253
  
• Markus Antweiler:
  Cross-correlation of p-ary GMW sequences. 1253-1261
  
• M. Rupf, James L. Massey:
  Optimum sequence multisets for synchronous code-division multiple-access channels. 1261-1266
  
• Hong-Yeop Song, Solomon W. Golomb:
  On the existence of cyclic Hadamard difference sets. 1266-1268
  
• Zhi Chen:
  Further Results on Difference Triangle Sets. 1268-1270
  
• Alexander A. Davydov, A. Yu Drozhzhina-Labvinskaya:
  Constructions, families, and tables of binary linear covering codes. 1270-1279
  
• René Struik:
  An improvement of the Van Wee bound for binary linear covering codes. 1280-1284
  
• Gregory Poltyrev:
  Bounds on the decoding error probability of binary linear codes via their spectra. 1284-1292
  
• Henk D. L. Hollmann:
  A block-decodable (1, 8) runlength-limited rate 8/12 code. 1292-1296
  
• Renato M. Capocelli, Alfredo De Santis, Giuseppe Persiano:
  Binary prefix codes ending in a "1". 1296-1302
  

• Robert J. McEliece: Review of 'A Collection of Contributions in Honour of Jack Van Lint (Topics in Discrete Mathematics, vol. 7)' (Cameron, P.J., and van Tilborg, H.C.A., Eds.; 1992). 1303-

Volume 40, Number 5, September 1994

• Costas N. Georghiades:
  Modulation and coding for throughput-efficient optical systems. 1313-1326
  
• Yossef Steinberg, H. Vincent Poor:
  On sequential delay estimation in wideband digital communication systems. 1327-1333
  
• Jian Yang, Sumit Roy:
  Joint transmitter-receiver optimization for multi-input multi-output systems with decision feedback. 1334-1347
  
• Shang-Chih Ma, Mao-Chao Lin:
  A trellis coded modulation scheme constructed from block coded modulation with interblock memory. 1348-1363
  
• Gui Liang Feng, Kenneth K. Tzeng:
  A new procedure for decoding cyclic and BCH codes up to actual minimum distance. 1364-1374
  
• Hiroshi Kamabe:
  Irreducible components of canonical diagrams for spectral nulls. 1375-1391
  
• Toyoo Takata, Y. Yamashita, Toru Fujiwara, Tadao Kasami, Shu Lin:
  Suboptimum decoding of decomposable block codes. 1392-1405
  
• René Struik:
  On the structure of linear codes with covering radius two and three. 1406-1416
  
• H. Vater:
  Binary coding by integration of polynomials. 1417-1424
  
• Pascale Charpin:
  Weight distributions of cosets of two-error-correcting binary BCH codes, extended or not. 1425-1442
  
• Victor D. Kolesnik, Victor Yu. Krachkovsky:
  Lower bounds on achievable rates for limited bitshift correcting codes. 1443-1458
  
• Amos Lapidoth:
  The performance of convolutional codes on the block erasure channel using various finite interleaving techniques. 1459-1473
  
• Wlodzimierz Greblicki, Miroslaw Pawlak:
  Dynamic system identification with order statistics. 1474-1489
  
• Miroslaw Pawlak, Ewaryst Rafajlowicz:
  On restoring band-limited signals. 1490-1503
  
• Peter Hall, Prakash Patil:
  On the Efficiency of On-Line Density Estimators. 1504-1512
  
• George A. Wright, Serena M. Zabin:
  Nonparametric density estimation for classes of positive random variables. 1513-1535
  
• D. J. Kershaw, Robin J. Evans:
  Optimal waveform selection for tracking systems. 1536-1550
  
• Zhi-Quan Luo, John N. Tsitsiklis:
  Data fusion with minimal communication. 1551-1563
  
• Tsutomu Kawabata, Amir Dembo:
  The rate-distortion dimension of sets and measures. 1564-1572
  
• T. Johansson:
  Lower bounds on the probability of deception in authentication with arbitration. 1573-1585
  

• Ben J. M. Smeets:
  Bounds on the probability of deception in multiple authentication. 1586-1591
  
• Wai Ho Mow:
  Maximum likelihood sequence estimation from the lattice viewpoint. 1591-1600
  
• Robert J. Elliott, L. Aggoun:
  Estimation for discrete Markov random fields observed in Gaussian noise. 1600-1603
  
• F. Gamboa, M. Lavielle:
  On two-dimensional spectral realization. 1603-1608
  
• Robert W. Dijkerman, Ravi Mazumdar:
  On the correlation structure of the wavelet coefficients of fractional Brownian motion. 1609-1612
  
• Rick S. Blum:
  Asymptotically robust detection of known signals in nonadditive noise. 1612-1619
  
• Tony G. Thomas, Brian L. Hughes:
  Optimal robust signaling with pseudonoise-modulated orthogonal signals. 1619-1624
  
• Yoshiki Takeuchi:
  On the optimal transmission of non-Gaussian signals through a noisy channel with feedback. 1624-1629
  
• Ezio Biglieri, Giuseppe Caire:
  Symmetry properties of multilevel coded modulation. 1630-1632
  
• W. Betts, A. Robert Calderbank, Rajiv Laroia:
  Performance of nonuniform constellations on the Gaussian channel. 1633-1638
  
• Peter H. A. Vogel:
  Analytical coding of Gaussian sources. 1639-1645
  
• Amir K. Khandani, Peter Kabal:
  Block-based eigensystem of the 1±D and 1-D² partial response channels. 1645-1647
  
• Kenneth Zeger, Allen Gersho:
  Number of nearest neighbors in a Euclidean code. 1647-1649
  
• M. Srinivasan, Dilip V. Sarwate:
  Malfunction in the Peterson-Gorenstein- Zierler decoder. 1649-1653
  
• Xuemin Chen, Irving S. Reed, Tor Helleseth, Trieu-Kien Truong:
  Use of Grobner bases to decode binary cyclic codes up to the true minimum distance. 1654-1660
  
• Xuemin Chen, Irving S. Reed, Tor Helleseth, Trieu-Kien Truong:
  General principles for the algebraic decoding of cyclic codes. 1661-1663
  
• Vladimir Sidorenko, Victor V. Zyablov:
  Decoding of convolutional codes using a syndrome trellis. 1663-1666
  
• Zhi Chen:
  Six new binary quasi-cyclic codes. 1666-1667
  
• T. Aaron Gulliver, Vijay K. Bhargava:
  Two new rate 2/p binary quasi-cyclic codes. 1667-1668
  
• Gérald E. Séguin:
  A random coding bound for fixed convolutional codes of rate $l/n$. 1668-1670
  
• Noga Alon, Alon Orlitsky:
  A lower bound on the expected length of one-to-one codes. 1670-1672
  
• Zhen Zhang, Chungming Tu:
  New bounds for the sizes of radar arrays. 1672-1678
  
• T. Johnsen, S. Manshadi, N. Monzavi:
  A determination of the parameters of a large class of Goppa codes. 1678-1681
  
• A. Ivic, Jack Koplowitz, Jovisa D. Zunic:
  On the number of digital convex polygons inscribed into an (m, m)-grid. 1681-1686
  
• Alexander Vardy:
  The Nordstrom-Robinson code: representation over $GF(4)$ and efficient decoding. 1686-1693
  
• Simon Litsyn, Alexander Vardy:
  The uniqueness of the Best code. 1693-1698
  
• Witold Holubowicz, R. Bobrowski:
  Good multi-T phase codes under bandwidth and complexity constraints. 1699-1702
  
• S. R. Blackburn:
  A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence. 1702-1704
  

Volume 40, Number 6, November 1994

• Aaron D. Wyner:
  Shannon-theoretic approach to a Gaussian cellular multiple-access channel. 1713-1727
  
• Tamás Linder, Gábor Lugosi, Kenneth Zeger:
  Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding. 1728-1740
  
• G. David Forney Jr.:
  Dimension/length profiles and trellis complexity of linear block codes. 1741-1752
  
• G. David Forney Jr.:
  Density/length profiles and trellis complexity of lattices codes. 1753-1772
  
• Steven S. Pietrobon, Gottfried Ungerboeck, L. C. Perez, Daniel J. Costello Jr.:
  Rotationally invariant nonlinear trellis codes for two-dimensional modulation. 1773-1791
  
• Min Wang, Thomas R. Fischer:
  Trellis-coded quantization designed for noisy channels. 1792-1802
  
• Fu-Quan Wang, Daniel J. Costello Jr.:
  Erasure-free sequential decoding of trellis codes. 1803-1817
  
• Natasa Jonoska, Brian H. Marcus:
  Minimal presentations for irreducible sofic shifts. 1818-1825
  
• Ron M. Roth, Paul H. Siegel, Alexander Vardy:
  High-order spectral-null codes - Construction and bounds. 1826-1840
  
• Patrick A. H. Bours:
  Construction of fixed-length insertion/deletion correcting runlength-limited codes. 1841-1856
  
• Eiji Fujiwara, Masato Kitakami:
  A class of error-correcting codes for byte-organized memory systems. 1857-1865
  
• Alexander V. Kuznetsov, A. J. Han Vinck:
  On the general defective channel with informed encoder and capacities of some constrained memories. 1866-1871
  
• Gérard D. Cohen, Gilles Zémor:
  Intersecting codes and independent families. 1872-1881
  
• Thomas H. E. Ericson, Vladimir I. Levenshtein:
  Superimposed codes in the Hamming space. 1882-1893
  
• Oscar Moreno, Carlos J. Moreno:
  The MacWilliams-Sloane conjecture on the tightness of the Carlitz-Uchiyama bound and the weights of duals of BCH codes. 1894-1907
  
• Yasutada Oohama, Te Sun Han:
  Universal coding for the Slepian-Wolf data compression system and the strong converse theorem. 1908-1919
  
• Michelle Effros, Philip A. Chou, Robert M. Gray:
  Variable-rate source coding theorems for stationary nonergodic sources. 1920-1925
  
• Kenneth Zeger, V. Manzella:
  Asymptotic bounds on optimal noisy channel optimization via random coding. 1926-1938
  
• Kenneth Rose:
  A mapping approach to rate-distortion computation and analysis. 1939-1952
  
• Neri Merhav, Gideon Kaplan, Amos Lapidoth, Shlomo Shamai:
  On information rates for mismatched decoders. 1953-1967
  
• Raymond Knopp, Harry Leib:
  M-ary phase coding for the noncoherent AWG channel. 1968-1984
  
• Yong Liu, Steven D. Blostein:
  Quickest detection of an abrupt change in a random sequence with finite time change. 1985-1993
  
• Carl W. Baum, Venugopal V. Veeravalli:
  A sequential procedure for multihypothesis testing. 1994-2007
  
• Kerry W. Fendick, Manoel A. Rodrigues:
  Asymptotic analysis of adaptive rate control for diverse sources with delayed feedback. 2008-2025
  

• Tamás Linder, Ram Zamir:
  On the asymptotic tightness of the Shannon lower bound. 2026-2031
  
• Amiram H. Kaspi:
  Rate-distortion function when side-information may be present at the decoder. 2031-2034
  
• Fady Alajaji, Thomas E. Fuja:
  A communication channel molded on contagion. 2035-2041
  
• Shunsuke Ihara:
  Coding theorems for a continuous-time Gaussian channel with feedback. 2041-2045
  
• Alberto Laurenti, Gaetano Scarano:
  Variance of a generalized polarity-coincidence spectral-centroid estimator for Gaussian processes. 2045-2048
  
• Guido M. Cortelazzo, G. Nalesso:
  A differential equation approach to the computation of the Fourier transform of the images of translating objects. 2049-2058
  
• Amir K. Khandani, Peter Kabal:
  Shaping of multidimensional signal constella- tions using a lookup table. 2058-2062
  
• Rudolf Ahlswede, Ning Cai:
  On communication complexity of vector-valued functions. 2062-2067
  
• Jacques Wolfmann:
  Weight distributions of some binary primitive cyclic codes. 2068-2071
  
• Hans-Andrea Loeliger:
  An upper bound on the volume of discrete spheres. 2071-2073
  
• Jacobus H. Weber:
  Asymptotic results on codes for symmetric, unidirectional, and asymmetric error control. 2073-2075
  
• M. A. O. da Costa e Silva, Reginaldo Palazzo Jr.:
  A bounded-distance decoding algorithm for lattices obtained from a generalized code formula. 2075-2082
  
• B. Sundar Rajan, M. U. Siddiqi:
  A generalized DFT for Abelian codes over Z_m. 2082-2090
  
• Gérard D. Cohen, Simon Litsyn, Gilles Zémor:
  Upper bounds on generalized distances. 2090-2092
  
• Carlos Munuera:
  On the generalized Hamming weights of geometric-Goppa codes. 2092-2099
  
• Yeheskel E. Dallal, Shlomo Shamai:
  Power moment derivation for noisy phase lightwave systems. 2099-2103
  

• Laurence B. Milstein: Review of 'Communication Systems Engineering' (Proakis and Salehi; 1994). 2104-

Last update Sat May 18 20:58:33 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page