default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIEEE 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 - Andreas 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, Namit Arora:
DPCM encoding of regenerative composite processes. 153-160 - Kyung T. Oh, John 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). IEEE Trans. Inf. Theory 40(1): 285 (1994)
- Thomas M. Cover:
Review of 'Complexity, Entropy and the Physics of Information' (Zurek, W.H., Ed.; 1990). IEEE Trans. Inf. Theory 40(1): 286- (1994) - Nariman Farvardin:
Review of 'Vector Quantization and Signal Compression' (Gersho, A., and Gray, R.M.; 1992). IEEE Trans. Inf. Theory 40(1): 287- (1994) - Ian F. Blake:
Review of 'Source and Channel Coding: An Algorithmic Approach' (Anderson, J.B., and Mohan, S.; 1991). IEEE Trans. Inf. Theory 40(1): 289- (1994)
Volume 40, Number 2, March 1994
- A. Roger Hammons Jr., P. Vijay Kumar, A. Robert Calderbank, Neil J. A. Sloane, Patrick Solé:
The Z4-linearity of Kerdock, Preparata, Goethals, and related codes. 301-319 - Toshimitsu Kaneko, Toshihisa 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 - Per 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, Anna Gál:
Lower bounds for the complexity of reliable Boolean circuits with noisy gates. 579-583 - Craig 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). IEEE Trans. Inf. Theory 40(2): 601 (1994)
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, Mario 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 - Qu 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
- Richard 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, Dorothy 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 - Pascal 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