Journal: IEEE Transactions on Information Theory

Volume 36, Issue 6

1197 -- 1205Bart Verboven, Edward C. van der Meulen. Capacity bounds for identification via broadcast channels which are optimal for the deterministic broadcast channel
1206 -- 1219Peter Mathys. A class of codes for a T active users out of N multiple-access communication system
1220 -- 1244Robert M. Gray. Quantization noise spectra
1245 -- 1254Neri Merhav, Jacob Ziv. On universally efficient estimation of the first order autoregressive parameter and universal data compression
1255 -- 1264Morteza Naraghi-Pour, David L. Neuhoff. Convergence of the projection method for an autoregressive process and a matched DPCM code
1265 -- 1279Evaggelos Geraniotis, Yawgeng A. Chau. Robust data fusion for multisensor detection systems
1280 -- 1284David Pearson, S. Unnikrishna Pillai, YoungJik Lee. An algorithm for near-optimal placement of sensor elements
1285 -- 1301John D. Gorman, Alfred O. Hero III. Lower bounds for parametric estimation with constraints
1302 -- 1318Steven B. Lowen, Malvin Carl Teich. Power-law shot noise
1319 -- 1333John H. Conway, Neil J. A. Sloane. A new upper bound on the minimal distance of self-dual codes
1334 -- 1380Andries E. Brouwer, James B. Shearer, Neil J. A. Sloane, Warren D. Smith. A new table of constant weight codes
1381 -- 1390Frank H. Böinck, Henk C. A. van Tilborg. Constructions and bounds for systematic t EC/AUED codes
1391 -- 1397Philippe Piret. Analysis of a modified Hebbian rule
1398 -- 1414Bruce E. Hajek. Performance of global load balancing of local adjustment
1415 -- 1425Wolfgang H. Kliemann, Giorgio Koch, Federico Marchetti. On the unnormalized solution of the filtering problem with counting process observations
1426 -- 0Lawrence H. Ozarow, Aaron D. Wyner. On the capacity of the Gaussian channel with a finite number of input levels
1428 -- 0Shlomo Shamai, Aaron D. Wyner. A binary analog to the entropy-power inequality
1430 -- 0B. S. Chow, W. P. Birkemeier. A new recursive filter for systems with multiplicative noise
1435 -- 0Toby Berger, Raymond W. Yeung. Optimum 1 ended binary prefix codes
1442 -- 0David Hertz, Yehuda Azenkot. On a class of multilevel universal source coding schemes
1446 -- 0Bruce L. Montgomery, Harvey Diamond, B. V. K. Vijaya Kumar. Bit probabilities of optimal binary source codes
1453 -- 0John T. Coffey, Rodney M. Goodman. Any code of which we cannot think is good
1461 -- 0Serge G. Vladut. On the decoding of algebraic-geometric codes over F::q:: for q>=16
1463 -- 0Gérald E. Séguin, Germain Drolet. The trace description of irreducible quasi-cyclic codes
1466 -- 0Gerhard J. M. van Wee. Binary coveting codes are normal
1470 -- 0Patrick Solé. Asymptotic bounds on the covering radius of binary codes
1472 -- 0Aimo Tietäväinen. An upper bound on the covering radius as a function of the dual distance
1474 -- 0Margaret Ann Bernard, Bhu Dev Sharma. A lower bound on average crowded length of variable length error-correcting codes
1476 -- 0Xiang-dong Hou. An improved sphere covering bound for the codes with n = 3R + 2
1478 -- 0Ning Zhang, Solomon W. Golomb. On the crosscorrelation of generalized Barker sequences
1480 -- 0Patrick Fitzpatrick, Graham H. Norton. Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence
1487 -- 0Leopold Bömer, Markus Antweiler. Periodic complementary binary sequences
1494 -- 0Eric Bach. A note on square roots in finite fields
1498 -- 0Antoine Lobstein, Gerhard J. M. van Wee. Correction to On normal and subnormal q-ary codes (Nov 89 1291-1295)

Volume 36, Issue 5

961 -- 1005Ingrid Daubechies. The wavelet transform, time-frequency localization and signal analysis
1006 -- 1018Toby Berger, Zhongxing Ye. Entropic aspects of random fields on trees
1019 -- 1030Sergio Verdú. On channel capacity per unit cost
1031 -- 1037John T. Coffey, Rodney M. Goodman. The complexity of information set decoding
1038 -- 1050John H. Conway, Neil J. A. Sloane. Orbit and coset analysis of the Golay and related codes
1051 -- 1060Alexei N. Skorobogatov, Serge G. Vladut. On the decoding of algebraic-geometric codes
1061 -- 1068Bernard C. Picinbono, Patrick Duvaut. Geometrical properties of optimal Volterra filters for signal detection
1069 -- 1088Daniel D. Harrison, James W. Modestino. Analysis and further results on adaptive entropy-coded quantization
1089 -- 1097Dan Hajela, Michael L. Honig. Bounds on s-rate for linear, time-invariant, multiinput/multioutput channels
1098 -- 1100Ingemar Ingemarsson. Optimized permutation modulation
1101 -- 1110Yow-Jong Liu, Ikuo Oka, Ezio Biglieri. Error probability for digital transmission over nonlinear channels with application to TCM
1111 -- 1126Alon Orlitsky. Worst-case interactive communication I: Two messages are almost optimal
1127 -- 1133Mart L. Molle. On the cutoff point for pairwise enabling in multiple access systems
1134 -- 0Wen-Whet Chang, Jerry D. Gibson. Path map symbol release rules and the exponential metric tree
1139 -- 0Mao Chao Lin. Bounds on the undetected error probabilities of linear codes for both error correction and detection
1141 -- 0Zhi Chen, Jin Fan, Fan Jin. New results on self-orthogonal unequal error protection codes
1144 -- 0Patrick Stevens. Error-erasure decoding of binary cyclic codes, up to a particular instance of the Hartmann-Tzeng bound
1149 -- 0Kar-Ming Cheung. Identities and approximations for the weight distribution of q -ary codes
1153 -- 0Clement W. H. Lam, Vera Pless. There is no (24, 12, 10) self-dual quaternary code
1157 -- 0Ron M. Roth, Abraham Lempel. Application of circulant matrices to the construction and decoding of linear codes
1163 -- 0Marcel J. E. Golay, Duncan B. Harris. A new search for skewsymmetric binary sequences with optimal merit factors
1166 -- 0Gregory L. Mayhew, Solomon W. Golomb. Linear spans of modified de Bruijn sequences
1167 -- 0Ning Zhang, Solomon W. Golomb. Uniqueness of the generalized Barker sequence of length 6
1170 -- 0Carlisle M. Adams, Stafford E. Tavares. Generating and counting binary bent sequences
1173 -- 0Keith W. Ross, David D. Yao. Monotonicity properties for the stochastic knapsack
1179 -- 0Attilio J. Rainal. Passage times of Gaussian noise crossing a time-varying boundary
1183 -- 0Y. C. Yao, Frank K. Hwang. On the cutoff point for pairwise enabling for infinite users in a multiaccess system
1186 -- 0Kristian Seip. A note on sampling of bandlimited stochastic processes
1187 -- 0Upamanyu Madhow, Michael B. Pursley. Correction to Limiting Performance of Frequency-Hop Random Access
1188 -- 0Jan H. van Schuppen. Review of Stochastic Integration and Differential Equations - A New Approach , (Protter, P.; 1990)

Volume 36, Issue 4

717 -- 725Toby Berger, Zhongxing Ye. epsilon-entropy and critical distortion of random fields
726 -- 740A. Robert Calderbank, Lawrence H. Ozarow. Nonequiprobable signaling on the Gaussian channel
741 -- 762Sanjay Kasturia, James T. Aslanis, John M. Cioffi. Vector coding for partial response channels
763 -- 772Marie-Pierre Béal. The method of poles: A coding method for constrained channels
773 -- 783Thomas E. Fuja, Chris Heegard. Focused codes for channels with skewed errors
784 -- 798Ping Wah Wong, Robert M. Gray. Sigma-delta modulation with i.i.d. Gaussian inputs
799 -- 809Nariman Farvardin. A study of vector quantization for noisy channels
810 -- 821Brian L. Hughes, Murad Hizlan. An asymptotically optimal random modem and detector for robust communication
822 -- 829Agnes Hui Chan, Richard A. Games. On the quadratic spans of DeBruijn sequences
830 -- 835Langford B. White, Boualem Boashash. Cross spectral analysis of nonstationary processes
836 -- 847Henk A. P. Blom, Yaakov Bar-Shalom. Time-reversion of a hybrid state stochastic difference system with a jump-linear smoothing application
848 -- 858Mikael Sternad, Anders Ahlén. The structure and design of realizable decision feedback equalizers for IIR channels with colored noise
859 -- 0Gregory W. Wornell. A Karhunen-Loève-like expansion for 1/f processes via wavelets
861 -- 0Jacob Ziv. Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources
863 -- 0Ning Zhang, Solomon W. Golomb. A limit theorem for n-phase Barker sequences (corresp.)
866 -- 0Habong Chung, P. Vijay Kumar. Optical orthogonal codes-New bounds and an optimal construction
873 -- 0József Dénes, A. Donald Keedwell. A new construction of two-dimensional arrays with the window property
876 -- 0Irving S. Reed, Xiaowei Yin, Trieu-Kien Truong. Algebraic decoding of the (32, 16, 8) quadratic residue code
880 -- 0Arvind Krishna, Dilip V. Sarwate. Pseudocyclic maximum- distance-separable codes
884 -- 0Dilip V. Sarwate, Robert D. Morrison. Decoder malfunction in BCH decoders
890 -- 0Patrick Stevens. On decoding unequal error protection product codes
895 -- 0Xiang-dong Hou. New lower bounds for covering codes
899 -- 0Tuvi Etzion. Constructions of error-correcting DC-free block codes
906 -- 0Mario Blaum, Jehoshua Bruck. Decoding the Golay code with Venn diagrams
911 -- 0John J. Metzner, Edward J. Kapturowski. A general decoding technique applicable to replicated file disagreement location and concatenated code decoding
917 -- 0Raymond Hill, Karen L. Traynor. The nonexistence of certain binary linear codes
922 -- 0Ludo M. G. M. Tolhuizen, Jacobus H. van Lint. On the minimum distance of combinatorial codes
924 -- 0Mao Chao Lin, Chi-Chang Lin, Shu Lin. Computer search for binary cyclic UEP codes of odd length up to 65
936 -- 0Michael Gutman. Fixed-prefix encoding of the integers can be Huffman-optimal
938 -- 0Venkat Anantharam. A large deviations approach to error exponents in source coding and hypothesis testing
943 -- 0Antoine Lobstein. The hardness of solving subset sum with preprocessing
946 -- 0Klaus Huber. Some comments on Zech s logarithms
950 -- 0Harold N. Ward. Quadratic residue codes of length 27
953 -- 0Mahesh C. Bhandari, M. S. Garg. Comments, with reply, on On the coveting radius of codes by R.L. Graham and N.J.A. Sloane
954 -- 0Philippe Delsarte, Philippe Piret. Correction to Bounds and constructions for binary asymmetric error-correcting codes (Jan 81 125-128)
955 -- 0G. David Forney Jr.. Review of Sphere Packings, Lattices and Groups (Conway, J.H., and Sloane, N.J.A.; 1988)

Volume 36, Issue 3

453 -- 471Bertrand S. Clarke, Andrew R. Barron. Information-theoretic asymptotics of Bayes methods
472 -- 484Michael L. Honig, Kenneth Steiglitz, B. Gopinath, Stephen P. Boyd. Bounds on maximum throughput for digital communications with finite-precision and amplitude constraints
485 -- 501Richard J. Barton, H. Vincent Poor. An RKHS approach to robust L:::2::: estimation and signal detection
502 -- 515Iickho Song, Saleem A. Kassam. Locally optimum detection of signals in a generalized observation model: The known signal case
516 -- 530Iickho Song, Saleem A. Kassam. Locally optimum detection of signals in a generalized observation model: The random signal case
531 -- 539László Györfi, Elias Masry. The L::1:: and L::2:: strong consistency of recursive kernel density estimation from dependent samples
540 -- 547Jørn Justesen, Erik Paaske, Mark Ballan. Quasi-cyclic unit memory convolutional codes
548 -- 552Agnes Hui Chan, Richard A. Games. On the linear span of binary sequences obtained from q-ary m-sequences, q odd
553 -- 558Michael J. Wiener. Cryptanalysis of short RSA secret exponents
559 -- 578Serena M. Zabin, H. Vincent Poor. Recursive algorithms for identification of impulsive noise channels
579 -- 588John S. Sadowsky, James A. Bucklew. On large deviations theory and asymptotically efficient Monte Carlo estimation
589 -- 596Dale H. Mugler. Computationally efficient linear prediction from past samples of a band-limited signal and its derivative
597 -- 607Randall K. Bahr. Asymptotic analysis of error probabilities for the nonzero-mean Gaussian hypothesis testing problem
608 -- 613Tat Simchony, Ramalingam Chellappa, Ze ev Lichtenstein. Relaxation algorithms for MAP estimation of gray-level images with multiplicative noise
614 -- 0Nader Mahravari. Random-access communication with multiple reception
622 -- 0Feng Guo, Yoichiro Watanabe. On graphs in which the Shannon capacity is unachievable by finite product
623 -- 0Shlomo Shamai, Israel Bar-David. On the capacity penalty due to input-bandwidth restrictions with an application to rate-limited binary signaling
627 -- 0Kapil K. Chawla, Dilip V. Sarwate. Upper bounds on the probability of error for M-ary orthogonal signaling in white Gaussian noise
633 -- 0P. Vijay Kumar, Chao-Ming Liu. On lower bounds to the maximum correlation of complex roots-of-unity sequences
640 -- 0Agnes Hui Chan, Mark Goresky, Andrew Klapper. On the linear complexity of feedback registers
645 -- 0Yuichi Saitoh, Kazuhiko Yamaguchi, Hideki Imai. Some new binary codes correcting asymmetric/unidirectional errors
647 -- 0Peter Fuchs, Gerhard Hofer, Günter Pilz. Codes from planar near rings
651 -- 0W. Cary Huffman. On extremal self-dual quaternary codes of lengths 18 to 28, I
660 -- 0W. Cary Huffman. On 3-elements in monomial automorphism groups of quaternary codes
664 -- 0Wende Chen, Iiro S. Honkala. Lower bounds for q-ary covering codes
671 -- 0Mario Blaum. A family of efficient burst-correcting array codes
675 -- 0John J. O Reilly, A. Popplewell. A further note on DC-free coset codes
677 -- 0Amer A. Hassan, Wayne E. Stark. On decoding concatenated codes
683 -- 0Xiang-dong Hou. Some results on the norm of codes
686 -- 0Gilles Lachaud, Jacques Wolfmann. The weights of the orthogonals of the extended quadratic binary Goppa codes
692 -- 0Shyue-Win Wei, Che-Ho Wei. On high-speed decoding of the (23, 12, 7) Golay code
695 -- 0Øyvind Ytrehus, Tor Helleseth. There is no binary [25, 8, 10] code (corresp.)
696 -- 0Markus Antweiler, Leopold Bömer, Hans-Dieter Lüke. Perfect ternary arrays
706 -- 0Jacob Ziv. Review of Open Problems in Communication and Computation (Cover, T.M., and Gopinath, B., Eds.; 1987)

Volume 36, Issue 2

241 -- 255Maurizio Longo, Tom D. Lookabaugh, Robert M. Gray. Quantization for decentralized hypothesis testing under communication constraints
256 -- 261John C. Kieffer. Comparison of two optimum rates for noiseless encoding of a nonstationary information source
262 -- 275John A. Gubner. On the deterministic-code capacity of the multiple-access arbitrarily varying channel
276 -- 284Kon Max Wong, Shuang Chen. The entropy of ordered sequences and order statistics
285 -- 288Thomas K. Philips, Donald F. Towsley, Jack K. Wolf. On the diameter of a class of random graphs
289 -- 295Dan Hajela. On computing the minimum distance for faster than Nyquist signaling
296 -- 304Morteza Naraghi-Pour, David L. Neuhoff. Mismatched DPCM encoding of autoregressive processes
305 -- 311Morteza Naraghi-Pour, David L. Neuhoff. On the continuity of the stationary state distribution of DPCM
312 -- 321Ofir Shalvi, Ehud Weinstein. New criteria for blind deconvolution of nonminimum phase systems (channels)
322 -- 333Upamanyu Madhow, Michael B. Pursley. Limiting performance of frequency-hop random access
334 -- 346Tassos Nakasis, Anthony Ephremides. Steady-state behavior of interacting queues-A numerical approach
347 -- 357T. T. Kadota. A nonlinear optimum-detection problem - I: Theory
358 -- 371Gerald R. Benitz, James A. Bucklew. Large deviation rate calculations for nonlinear detectors in Gaussian noise
372 -- 380Yariv Ephraim, Lawrence R. Rabiner. On the relations between modeling approaches for speech recognition
381 -- 385Jehoshua Bruck, Moni Naor. The hardness of decoding linear codes with preprocessing
386 -- 392Henk D. L. Hollmann. Design of test sequences for VLSI self-testing using LFSR
393 -- 0Jehoshua Bruck, Vwani P. Roychowdhury. On the number of spurious memories in the Hopfield model
397 -- 0Marcel van der Vlugt. The true dimension of certain binary Goppa codes
399 -- 0Richard A. Brualdi, Vera Pless. Orphans of the first order Reed-Muller codes
401 -- 406Alistair Moffat. Linear time adaptive arithmetic coding
406 -- 0Sulaiman Al-Bassam, Bella Bose. On balanced codes
408 -- 0József Dénes, Gary L. Mullen, Stephan J. Suchower. Another generalized Golomb-Posner code
411 -- 0Leopold Bömer, Markus Antweiler. Two-dimensional perfect binary arrays with 64 elements
414 -- 0Zabih Nasseri, Morton Kanefsky. Doubly adaptive DPCM
420 -- 0Philippe Jacquet, Eric Merle. Analysis of a stack algorithm for CSMA-CD random length packet communication
426 -- 0Evaggelos Geraniotis. Robust matched filters for noise uncertainty within two alternating capacity classes
429 -- 0Pierre Comon, Dinh-Tuan Pham. Estimating the order of a FIR filter for noise cancellation
434 -- 0T. T. Kadota. A nonlinear optimum-detection problem-II: Simple numerical examples
439 -- 0Kailash Birmiwal. The minimum codeword length and redundancy in the binary Huffman code for uncertain sources
443 -- 0Jovan Dj. Golic, Milorad M. Obradovic. Correction to A lower bound on the redundancy of D-ary Huffman codes (Nov 87 910-911)
443 -- 0Nick J. Patterson, Douglas H. Wiedemann. Correction to The covering radius of the (2:::15:::, 16) Reed-Muller code is at least 16276 (May 83 354-356)

Volume 36, Issue 1

3 -- 16Alon Orlitsky, Abbas El Gamal. Average and randomized communication complexity
17 -- 22Lawrence H. Ozarow. Random coding for additive Gaussian channels with feedback
23 -- 30Lee K. Jones, Charles L. Byrne. General entropy criteria for inverse problems, with applications to data compression, pattern classification, and cluster analysis
31 -- 39Gordon B. Agnew. Cryptographic systems using redundancy
40 -- 46Michael Ben-Or, Oded Goldreich, Silvio Micali, Ronald L. Rivest. A fair protocol for signing contracts
47 -- 53Tatsuaki Okamoto. A fast signature scheme based on congruential polynomial operations
54 -- 62Masakazu Jimbo, Ryoh Fuji-Hara. Optimal authentication systems and combinatorial designs
63 -- 89Steven S. Pietrobon, Robert H. Deng, Alain Lafanechére, Gottfried Ungerboeck, Daniel J. Costello Jr.. Trellis-coded multidimensional phase modulation
90 -- 93Henning Stichtenoth. On the dimension of subfield subcodes
94 -- 107Fure-Ching Jeng, John W. Woods. Simulated annealing in compound Gaussian random fields
108 -- 125Richard R. Hansen Jr., Ramalingam Chellappa. Noncausal 2-D spectrum estimation for direction finding
126 -- 140Chein-I Chang, Lee D. Davisson. Two iterative algorithms for finding minimax solutions
141 -- 152Adam Krzyzak. On estimation of a class of nonlinear systems by the kernel regression estimate
153 -- 0János Körner, Katalin Marton. On the capacity of uniform hypergraphs
156 -- 0Lawrence H. Ozarow. Upper bounds on the capacity of Gaussian channels with feedback
162 -- 0Erdal Arikan. An implementation of Elias coding for input-restricted channels
166 -- 0Rudolf Ahlswede. Extremal properties of rate distortion functions
171 -- 0Srinivasan V. Ramanan, Harry F. Jordan, Jon R. Sauer. A new time domain, multistage permutation algorithm
173 -- 0Toby Berger, Flavio Bonomi. Capacity and zero-error capacity of Ising channels
180 -- 0Erdal Arikan. On the achievable rate region of sequential decoding for a class of multiaccess channels
183 -- 0James B. Shearer. Some new optimum Golomb rulers
184 -- 0Torleiv Kløve. Bounds and constructions of disjoint sets of distinct difference sets
190 -- 0Jovan Dj. Golic, Miodrag J. Mihaljevic. Minimal linear equivalent analysis of a variable-memory binary sequence generator
192 -- 0Jack Koplowitz, Michael Lindenbaum, Alfred M. Bruckstein. The number of digital straight lines on an N×N grid
197 -- 0Soura Dasgupta, C. Richard Johnson Jr., A. Maylar Baksho. Sign-sign LMS convergence with independent stochastic inputs
202 -- 0Costas N. Georghiades. Optimum delay and sequence estimation from incomplete data
208 -- 0A. Vourdas. Information in quantum optical binary communications
211 -- 0Aimo Tietäväinen. An asymptotic bound on the covering radii of binary BCH codes
214 -- 0Patrick 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
222 -- 0Pascale Charpin. On a class of primitive BCH-codes
228 -- 0Zhi Chen, Jin Fan, Fan Jin. On a new binary [22, 13, 5] code
229 -- 0Patrick Solé. A limit law on the distance distribution of binary codes
232 -- 0Lawrence H. Ozarow, Lawrence A. Shepp. The exact information complexity of Indian poker