Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIEEE Transactions on Information Theory, Volume 34
Volume 34, Number 1, January 1988
- Razmik Karabed, Brian H. Marcus:
Sliding-block coding for input-restricted channels. 2-26 - Imre Csiszár, Prakash Narayan:
Arbitrarily varying channels with constrained inputs and states. 27-34 - Frans M. J. Willems:
Totally asynchronous Slepian-Wolf data compression. 35-44 - Ephraim Zehavi
, Jack K. Wolf:
On runlength codes. 45-54 - Erdal Arikan:
An upper bound on the cutoff rate of sequential decoding. 55-63 - Nirmal R. Saxena, John P. Robinson:
Syndrome and transition count are uncorrelated. 64-69 - Arne Dür:
On the computation of the performance probabilities for block codes with a bounded-distance decoding rule. 70-78 - Peter A. Galko, Subbarayan Pasupathy:
Optimization of linear receivers for data communication signals. 79-92 - Naoki Suehiro, Mitsutoshi Hatori:
Modulatable orthogonal sequences and their application to SSMA systems. 93-100 - Israel Cidon, Moshe Sidi:
Conflict multiplicity estimation and batch resolution algorithms. 101-110 - James A. Bucklew, Stamatis Cambanis:
Estimating random integrals from noisy observations: Sampling designs and their performance. 111-127
- Noga Alon, Ernest E. Bergmann, Don Coppersmith, Andrew M. Odlyzko:
Balancing sets of vectors. 128-130 - Prem Nath, Ranjit Singh:
Some characterizations of the directed divergence using cyclic symmetry. 130-134 - Renato M. Capocelli, Alfredo De Santis, Inder Jeet Taneja:
Bounds on the entropy series. 134-138 - Mario Blaum:
A (16, 9, 6, 5, 4) error-correcting DC free block code. 138-141 - Thu Nguyen:
Coset correlation of m-sequences. 141-143 - Naoki Suehiro, Mitsutoshi Hatori:
N-shift cross-orthogonal sequences. 143-146 - P. Vijay Kumar:
Frequency-hopping code sequence designs having large linear span. 146-151 - Sho Kikkawa, Masayuki Ishida:
Number of degrees of freedom, correlation times, and equivalent bandwidths of a random process. 151-155 - Jean-Pierre Carmichael, Jean-Claude Massé, Radu Theodorescu:
Representations for multivariate reciprocal Gaussian processes. 155-157 - L. Montgomery Smith:
Nonstationary noise effects in the Abel inversion. 158-161 - Tom Høholdt, Helge Elbrønd Jensen:
Determination of the merit factor of Legendre sequences. 161-164 - Aart Blokhuis, H. J. Tiersma:
Bounds for the size of radar arrays. 164-167
Volume 34, Number 2, March 1988
- Toby Berger:
Andrei Nikolaevich Kolmogorov (April 25, 1903-October 20, 1987). IEEE Trans. Inf. Theory 34(2): 173 (1988) - Leonid A. Bassalygo, Roland L. Dobrushin, Mark S. Pinsker:
Kolmogorov remembered. IEEE Trans. Inf. Theory 34(2): 174-175 (1988)
- Robert G. Gallager:
Finding parity in a simple broadcast network. 176-180 - Imre Csiszár, Prakash Narayan:
The capacity of the arbitrarily varying channel revisited: Positivity, constraints. 181-193 - Nicholas Pippenger:
Reliable computation by formulas in the presence of noise. 194-197 - Zhen Zhang, Toby Berger:
Estimation via compressed information. 198-211 - Mark A. Herro, Daniel J. Costello Jr., Laizhao Hu:
Capacity and cutoff rate calculations for a concatenated coding system. 212-222 - Sergio Benedetto, Marco Ajmone Marsan, Guido Albertengo, Egidio P. Giachin:
Combined coding and modulation: Theory and applications. 223-236 - Gerhard J. M. van Wee:
Improved sphere bounds on the coveting radius of codes. 237-245 - Erdal Arikan:
Sequential decoding for multiple access channels. 246-259 - Bixio Rimoldi:
A decomposition approach to CPM. 260-270 - P. Vijay Kumar:
On the existence of square dot-matrix patterns having a specific three-valued periodic-correlation function. 271-277 - Jacob Ziv:
On classification with empirically observed statistics and universal data compression. 278-286 - Alfred O. Hero III, Stuart C. Schwartz:
Poisson models and mean-squared error for correlator estimators of time delay. 287-303 - Bernard C. Picinbono, Patrick Duvaut:
Optimal linear-quadratic systems for detection and estimation. 304-311
- János Körner, Katalin Marton:
Random access communication and graph entropy. 312-314 - W. M. C. J. van Overveld:
Fixed-length strategies for the binary multiplying channel. 314-318 - Kenji Nakagawa, Fumio Kanaya:
A new geometric capacity characterization of a discrete memoryless channel. 318-321 - Wayne E. Stark, Robert J. McEliece:
On the capacity of channels with block memory. 322-324 - Muzhong Wang:
Almost asymptotically optimal flag encoding of the integers. 324-326 - Iiro S. Honkala:
Lower bounds for binary covering codes. 326-329 - Khaled A. S. Abdel-Ghaffar:
On the existence of optimum cyclic burst correcting codes over GF(q). 329-332 - Ludo M. G. M. Tolhuizen, Wil J. van Gils:
A large automorphism group decreases the number of computations in the construction of an optimal encoder/decoder pair for a linear block code. 333-338 - Ehud Weinstein, Anthony J. Weiss:
A general class of lower bounds in parameter estimation. 338-342 - Ehud Weinstein:
Relations between Belini-Tartara, Chazan-Zakai-Ziv, and Wax-Ziv lower bounds. 342-343 - Samir S. Soliman, Robert A. Scholtz:
Spread ambiguity functions. 343-347 - Solomon M. Fleisher, Hardish Singh, Edward Shwedyk:
A generalized two-threshold detection procedure. 347-352 - Amir Dembo:
Bounds on the extreme eigenvalues of positive-definite Toeplitz matrices. 352-355 - Torleiv Kløve:
Bounds on the size of optimal difference triangle sets. 355-361 - Kei Takikawa:
Correction to 'Fast Progressive Reconstruction of a Transformed Image'. IEEE Trans. Inf. Theory 34(2): 361- (1988)
Volume 34, Number 3, May 1988
- Lawrence H. Ozarow, Aaron D. Wyner, Jacob Ziv:
Achievable rates for a constrained Gaussian channel. 365-370 - Israel Bar-David, Shlomo Shamai:
On information transfer by envelope-constrained signals over the AWGN channel. 371-379 - Walter Hirt, James L. Massey:
Capacity of the discrete-time Gaussian channel with intersymbol interference. 380-388 - Jonathan J. Ashley:
A linear bound for sliding-block decoder window size. 389-399 - Taejeong Kim, David L. Neuhoff:
Delta codes for line drawings. 400-416 - Boris Fitingof, Zeev Waksman:
Fused trees and some new approaches to source coding. 417-424 - A. Robert Calderbank, Ting-Ann Lee, James E. Mazo:
Baseband trellis codes with a spectral null at zero. 425-434 - Gregory J. Pottie, Desmond P. Taylor:
Sphere-packing upper bounds on the free distance of trellis codes. 435-447 - Tadao Kasami, Toru Fujiwara, Toyoo Takata, Shu Lin:
A cascaded coding scheme for error control and its performance analysis. 448-462 - Wenlong Zhang, Jack K. Wolf:
A class of binary burst error-correcting quasi-cyclic codes. 463-479 - Jiapeng Gao, Luther D. Rudolph, Carlos R. P. Hartmann:
Iteratively maximum likelihood decodable spherical codes and a method for their construction. 480-485 - W. Cary Huffman:
On the [24, 12, 10] quaternary code and binary codes with an automorphism having two cycles. 486-493 - Khaled A. S. Abdel-Ghaffar, Robert J. McEliece, Henk C. A. van Tilborg:
Two-dimensional burst identification codes and their use in burst correction. 494-504 - Hamid R. Amirazizi, Martin E. Hellman:
Time-memory-processor trade-offs. 505-512 - Gadiel Seroussi, Nader H. Bshouty:
Vector sets for exhaustive testing of logic circuits. 513-522 - Pierre Baldi:
Neural networks, orientations of the hypercube, and algebraic threshold functions. 523-530 - Ilan Kessler, Moshe Sidi:
Mixing collision resolution algorithms exploiting information of successful messages. 531-536 - Paul G. Flikkema, Lee D. Davisson:
Detection of baseband signals using a delta modulator. 537-543 - Andrew B. Martinez, John B. Thomas:
Detector design using a density fit to non-Gaussian noise. 544-550 - John K. Goutsias, Jerry M. Mendel:
Optimal simultaneous detection and estimation of filtered discrete semi-Markov chains. 551-568
- Guo-Zhen Xiao, James L. Massey:
A spectral characterization of correlation-immune combining functions. 569-571 - Costas N. Georghiades:
On PPM sequences with good autocorrelation properties. 571-576 - S. M. Lee, C. B. Bell, Andrew L. Mason:
Discrimination, signal detection, and estimation for Weibull-type Poisson processes. 576-580 - Michael L. Stein:
An application of the theory of equivalence of Gaussian measures to a prediction problem. 580-582 - Pierre Brémaud:
An averaging principle for filtering a jump process with point process observations. 582-586 - Jørn M. Jensen:
Bounds on the free distance of systematic convolutional codes. 586-589 - Antoine Lobstein:
Comments on 'A note on perfect arithmetic codes' by J. Astola. 589-590 - Stefan M. Dodunekov, Krassimir N. Manev, Vladimir D. Tonchev:
On the covering radius of binary [14, 6] codes containing the all-one vector. 591-593 - Ron M. Roth, Gadiel Seroussi:
Encoding and decoding of BCH codes using light and short codewords. 593-596
Volume 34, Number 4, July 1988
- Ingrid Daubechies:
Time-frequency localization operators: A geometric phase space approach. 605-612 - Helge Elbrønd Jensen, Tom Høholdt, Jørn Justesen:
Double series representation of bounded signals. 613-624 - Sueo Sugimoto, Teruyo Wada:
Spectral expressions of information measures of Gaussian time series and their relation to AIC and CAT. 625-631 - Randall K. Bahr, James A. Bucklew:
Minimax estimation of unknown deterministic signals in colored noise. 632-641 - Abraham Krieger, Elias Masry:
Convergence analysis of adaptive linear estimation for dependent stationary processes. 642-654 - Stamatis Cambanis, Elias Masry:
Performance of discrete-time predictors of continuous-time stationary processes. 655-668 - Gonzalo R. Arce, Neal C. Gallagher Jr.:
Stochastic analysis for the recursive median filter process. 669-679 - Moshe Tarrab, Arie Feuer:
Convergence and performance analysis of the normalized LMS algorithm with uncorrelated Gaussian data. 680-691 - Hong Fan:
Application of Benveniste's convergence results in the study of adaptive IIR filtering algorithms. 692-709 - Ben-Zion Bobrovsky, Moshe Zakai, Ofer Zeitouni:
Error bounds for the nonlinear filtering of signals with small diffusion coefficients. 710-721 - Daniel R. Fuhrmann, Michael I. Miller:
On the existence of positive-definite maximum-likelihood estimates of structured covariance matrices. 722-729 - Fidel Morales-Moreno, Subbarayan Pasupathy:
Structure, optimization, and realization of FFSK trellis codes. 730-751 - Robert Michael Tanner:
A transform theory for a class of group-invariant codes. 752-775 - Unjeng Cheng, Gaylord K. Huth:
Bounds of the bit error probability of a linear cyclic code over GF(2l) and its extended code. 776-785 - Robert H. Deng, Mark A. Herro:
DC-free coset codes. 786-792 - G. Robert Redinbo:
Speedier decoding of cyclic codes using chord properties. 793-802 - Ezio Biglieri, Michele Elia:
Multidimensional modulation and coding for band-limited digital channels. 803-809 - Ron M. Roth, Abraham Lempel:
Composition of Reed-Solomon codes and geometric designs. 810-816 - Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro:
On the characterization of statistically synchronizable variable-length codes. 817-825 - Yariv Ephraim, Robert M. Gray:
A unified approach for encoding clean and noisy sources by means of waveform and autoregressive model vector quantization. 826-834 - Hirosuke Yamamoto:
A rate-distortion problem for a communication system with a secondary decoder to be hindered. 835-842 - Robert D. Cameron:
Source encoding using syntactic information source models. 843-850 - Claude A. Christen:
Optimal contention among three senders. 851-857 - Mark A. Herro, Laizhao Hu:
A new look at coding for APD-based direct-detection optical channels. 858-866
- Mao Chao Lin, Shu Lin:
Cyclic unequal error protection codes constructed from cyclic codes of composite length. 867-871 - Shojiro Sakata:
Cycle representatives of quasi-irreducible two-dimensional cyclic codes. 871-875 - Heikki O. Hämäläinen:
Two new binary codes with minimum distance three. 875- - R. L. A. van Ravesteijn, Cornelis de Vroedt:
A direct proof of the weight retaining property of polynomials over a finite field. 875-877 - Thomas H. E. Ericson, László Györfi:
Superimposed codes in Rn. 877-880 - Bruce L. Montgomery, B. V. K. Vijaya Kumar:
On decoding rules to minimize the probability of information bit errors. 880-881 - Nicholas J. Weyland, Edward A. Puckett:
Lossless coding for sources of floating-point and fixed-precision numbers. 882-888 - John H. Wilson:
Error-correcting codes for a T-user binary adder channel. 888-890 - Ofer Zeitouni, Amir Dembo:
Exact filters for the estimation of the number of transitions of finite-state continuous-time Markov processes. 890-893 - Jan L. P. de Lameillieure:
Correction to 'A heuristic algorithm for the construction of a code with limited word length' (May 87 438-443). 893-894
Volume 34, Number 5, September 1988
- Benny Chor, Ronald L. Rivest:
A knapsack-type public key cryptosystem based on arithmetic in finite fields. 901-909 - Bruce E. Hajek, Galen H. Sasaki:
Link scheduling in polynomial time. 910-917 - Ramesh R. Rao, Anthony Ephremides:
On the stability of interacting queues in a multiple-access system. 918-930 - Lazaros F. Merakos, Chatschik Bisdikian:
Delay analysis of the n -ary stack random-access algorithm. 931-942 - Richard J. Barton, H. Vincent Poor:
Signal detection in fractional Gaussian noise. 943-959 - H. Vincent Poor:
Fine quantization in signal detection and estimation. 960-972 - Lee K. Jones:
A stochastic multisample extension of Morris's robust detector in bounded amplitude noise. 973-978 - Rodney M. Goodman, Padhraic Smyth:
Decision tree design from a communication theory standpoint. 979-994 - Brian L. Hughes, Prakash Narayan:
The capacity of a vector Gaussian arbitrarily varying channel. 995-1003 - Chein-I Chang, Lee D. Davisson:
On calculating the capacity of an infinite-input finite (infinite)-output channel. 1004-1010 - Marc Rouanne, Daniel J. Costello Jr.:
A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes. 1011-1020 - Paul K. M. Ho, Peter J. McLane:
Spectrum, distance, and receiver complexity of encoded continuous phase modulation. 1021-1032 - Yariv Ephraim, Hanoch Lev-Ari, Robert M. Gray:
Asymptotic minimum discrimination information measure for asymptotically weakly stationary processes. 1033-1040 - Ofer Zeitouni:
On the filtering of noise-contaminated signals observed via hard limiters. 1041-1048
- Douglas J. Muder:
Minimal trellises for block codes. 1049-1053 - Martin C. Rost, Khalid Sayood:
The root lattices as low bit rate vector quantizers. 1053-1058 - Vladimir Sidorenko, Rolf Johannesson, Kamil Sh. Zigangirov:
On sequential decoding for the Gilbert channel. 1058-1061 - Mario Blaum, Patrick Guy Farrell, Henk C. A. van Tilborg:
Multiple burst-correcting array codes. 1061-1066 - C. Foias, Arthur E. Frazho, Peter J. Sherman:
A geometric approach to the maximum likelihood spectral estimator for sinusoids in noise. 1066-1070 - Peter Elias:
Zero error capacity under list decoding. 1070-1074 - David C. Larson, Jonathan J. Ashley, Thomas D. Howell:
On the minimum length error event of minimum Euclidean weight. 1074-1076 - Jovan Dj. Golic, Miodrag V. Zivkovic:
On the linear complexity of nonuniformly decimated PN-sequences. 1077-1079 - Kjell Jørgen Hole:
New short constraint length rate (n-1)/n punctured convolutional codes for soft-decision Viterbi decoding. 1079-1081 - James A. Bucklew:
A large deviation theory proof of the abstract alphabet source coding theorem. 1081-1083 - Fabrizio Pollara, Robert J. McEliece, Khaled A. S. Abdel-Ghaffar:
Finite-state codes. 1083-1089 - Jehoshua Bruck, Joseph W. Goodman:
A generalized convergence theorem for neural networks. 1089-1092 - Ahmed H. Tewfik, Bernard C. Levy, Alan S. Willsky:
Sampling theorems for two-dimensional isotropic random fields. 1092-1096 - Andrew R. Barron, Thomas M. Cover:
A bound on the financial value of information. 1097-1100 - Peter Vanroose:
Code construction for the noiseless binary switching multiple-access channel. 1100-1106 - Zhen Zhang:
Partial converse for a relay channel. 1106-1110 - Hanan Rosenthal, Jacob Binia:
On the epsilon entropy of mixed random variables. 1110-1114
- Toby Berger:
Preface to special issue on coding techniques and coding theory. IEEE Trans. Inf. Theory 34(5): 1121 (1988) - Daniel J. Costello Jr.:
Introduction to special section on coding techniques. IEEE Trans. Inf. Theory 34(5): 1122 (1988)
- G. David Forney Jr.:
Coset codes-I: Introduction and geometrical classification. 1123-1151 - G. David Forney Jr.:
Coset codes-II: Binary lattices and related codes. 1152-1187 - Jean-Pierre Adoul, Michel Barth:
Nearest neighbor algorithm for spherical codes from the Leech lattice. 1188-1202 - Nambirajan Seshadri, John B. Anderson:
Asymptotic error performance of modulation codes in the presence of severe intersymbol interference. 1203-1216 - Jørn Justesen, Christian Thommesen, Victor V. Zyablov:
Concatenated codes with convolutional inner codes. 1217-1225 - George H. Freeman, Ian F. Blake, Jon W. Mark:
Trellis source code design as an optimization problem. 1226-1241 - Anselm Blumer, Robert J. McEliece:
The Rényi redundancy of generalized Huffman codes. 1242-1249 - John C. Kieffer, Teresa M. Jahns, Viktor A. Obuljen:
New results on optimal entropy-constrained quantization. 1250-1258
- Federico Kuhlmann, James A. Bucklew:
Piecewise uniform vector quantizers. 1259-1263 - Göran Lindell, Carl-Erik W. Sundberg:
An upper bound on the bit error probability of combined convolutional coding and continuous phase modulation. 1263-1269 - Daniel Zwillinger:
Differential PPM has a higher throughput than PPM for the band-limited and average-power-limited optical channel (corresp.). 1269-1273
- Jacobus H. van Lint:
Introduction to special section on coding theory. 1274-1275
- A. Robert Calderbank, Neil J. A. Sloane:
Inequalities for covering codes. 1276-1280 - János Pach, Joel Spencer:
Explicit codes with low covering radius. 1281-1285 - Jean-Paul Boly, Wil J. van Gils:
Codes for combined symbol and digit error control. 1286-1307 - Tuvi Etzion:
Constructions for perfect maps and pseudorandom arrays. 1308-1316 - Heinz Georg Quebbemann:
Cyclotomic Goppa codes. 1317-1320 - Jacobus H. Weber, Cornelis de Vroedt, Dick E. Boekee:
Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6. 1321-1331 - Patrick Stevens:
Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities. 1332-1340
- Michael Wirtz:
On the parameters of Goppa codes. 1341-1343 - Iiro S. Honkala, Heikki O. Hämäläinen:
A new construction for covering codes. 1343-1344 - Juriaan Simonis:
The minimal covering radius t[15, 6] of a six-dimensional binary linear code of length 15 is equal to 4. 1344-1345 - Henning Stichtenoth:
A note on Hermitian codes over GF(q2). 1345-1348 - J. C. C. M. Remijn, H. J. Tiersma:
A duality theorem for the weight distribution of some cyclic codes. 1348-1351 - Akira Shiozaki:
Decoding of redundant residue polynomial codes using Euclid's algorithm. 1351-1354 - Jeffrey S. Leon:
A probabilistic algorithm for computing minimum weights of large error-correcting codes. 1354-1359
Volume 34, Number 6, November 1988
- Jack Salz:
Introduction to special issue commemorating Stephen O. Rice (1907-1986). IEEE Trans. Inf. Theory 34(6): 1365-1366 (1988)
- David Middleton:
Rice and the theory of random noise: Some personal recollections. 1367-1373 - David S. Slepian, Aaron D. Wyner:
S.O. Rice's contributions to Shannon Theory. 1374 - Robert Price:
An orthonormal Laguerre expansion yielding Rice's envelope density function for two sine waves in noise. 1375-1382 - Attilio J. Rainal:
Origin of Rice's formula. 1383-1387 - L. Lorne Campbell, Paul H. Wittke, Glenn D. Swanson:
The distribution of the amplitude and continuous phase of a sinusoid in noise. 1388-1395 - Nelson M. Blachman:
Gaussian noise-I: The shape of large excursions. 1396-1400 - Nelson M. Blachman:
Gaussian noise-II: Distribution of phase change of narrow-band noise plus sinusoid. 1401-1405 - Israel Bar-David, Shlomo Shamai:
On the Rice model of noise in FM receivers. 1406-1419 - James E. Mazo, Henry J. Landau:
On the minimum distance problem for faster-than-Nyquist signaling. 1420-1427 - Paul H. Wittke, Wendy S. Smith, L. Lorne Campbell:
Infinite series of interference variables with Cantor-type distributions. 1428-1436 - Gerard J. Foschini, Giovanni Vannucci:
Characterizing filtered light waves corrupted by phase noise. 1437-1448 - Aaron D. Wyner:
Capacity and error exponent for the direct detection photon channel-Part I. 1449-1461 - Aaron D. Wyner:
Capacity and error-exponent for the direct detection photon channel-Part II. 1462-1471 - Edward Bedrosian:
Amplitude demodulation of filtered AM/PM signals. 1472-1482 - John H. Roberts:
Phase-difference distribution for a narrow-band non-Gaussian noise and related statistics. 1483-1490 - Harry Leib, Subbarayan Pasupathy:
The phase of a vector perturbed by Gaussian' noise and differentially coherent receivers. 1491-1501 - Edgar N. Gilbert:
Retrials and balks. 1502-1508 - Lester E. Dubins, Alon Orlitsky, James A. Reeds, Lawrence A. Shepp:
Self-avoiding random loops. 1509-1516 - T. T. Kadota:
Approximately optimum detection of deterministic signals in Gaussian and compound Poisson noise. 1517-1527 - Harrison E. Rowe:
Radio imaging of moving targets: The one-dimensional case. 1528-1537
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-07 23:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
