Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarIEEE Transactions on Information Theory, Volume 43, 1997
Volume 43, Number 1, January 1997
- Guy Louchard, Wojciech Szpankowski:
On the average redundancy rate of the Lempel-Ziv code. 2-8 - Serap A. Savari:
Redundancy of the Lempel-Ziv incremental parsing rule. 9-21 - Rudolf Ahlswede, Ning Cai, Zhen Zhang:
On interactive communication. 22-37 - Amos Lapidoth:
On the role of mismatch in rate distortion theory. 38-47 - Rudolf Ahlswede, En-Hui Yang, Zhen Zhang:
Identification via compressed data. 48-70 - Zhen Zhang, En-Hui Yang, Victor K. Wei:
The redundancy of source coding with a fidelity criterion: 1. Known statistics. 71-91 - Feng Chen, Zheng Gao, John D. Villasenor:
Lattice vector quantization of generalized Gaussian sources. 92-103 - T. Kohda, A. Tsuneda:
Statistics of chaotic binary sequences. 104-112 - John T. Coffey, Aaron B. Kiely:
The capacity of coded systems. 113-127 - Conny Voss, Tom Høholdt:
An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound: The first steps. 128-135 - Dieter Jungnickel, Scott A. Vanstone:
Graphical codes revisited. 136-146 - Jürgen Ganz:
Factoring polynomials using binary representations of finite fields. 147-153 - Sanjeev R. Kulkarni, M. Vidyasagar:
Learning decision rules for pattern classification under a family of probability measures. 154-166 - L. K. Jones:
The computational intractability of training sigmoidal neural networks. 167-173 - Mohamad A. Akra, Sanjoy K. Mitter:
Waveform recognition in the presence of domain and amplitude noise. 174-182 - Vladimir Katkovnik
:
Nonparametric estimation of instantaneous frequency. 183-189 - N. Parker Willis, Yoram Bresler:
Lattice-theoretic analysis of time-sequential sampling of spatiotemporal signals: I. 190-207 - N. Parker Willis, Yoram Bresler:
Lattice-theoretic analysis of time-sequential sampling of spatiotemporal signals: II. Large space-bandwidth product asymptotics. 208-220 - J. DeLucia, H. Vincent Poor:
Performance analysis of sequential tests between Poisson processes. 221-238 - D. Gazelle, Jakov Snyders:
Reliability-based code-search algorithms for maximum-likelihood decoding of block codes. 239-249 - Saud A. Al-Semari, Thomas E. Fuja:
I-Q TCM: reliable communication over the Rayleigh fading channel close to the cutoff rate. 250-262 - Chun-Ye Susan Chang, Peter J. McLane:
Bit-error-probability for noncoherent orthogonal signals in fading with optimum combining for correlated branch diversity. 263-274
- Krishna Balachandran, John B. Anderson:
Reduced complexity sequence detection for nonminimum phase intersymbol interference channels. 275-279 - C. C. Leang, Don H. Johnson:
On the asymptotics of M-hypothesis Bayesian detection. 280-282 - Ewaryst Rafajlowicz:
Consistency of orthogonal series density estimators based on grouped observations. 283-284 - Rossitza Dodunekova, Stefan M. Dodunekov, Torleiv Kløve:
Almost-MDS and near-MDS codes for error detection. 285-289 - John P. Robinson:
Golomb rectangles as folded rulers. 290-293 - Jay Cheng, Chi-Chao Chao:
On generalized Hamming weights of binary primitive BCH codes with minimum distance one less than a power of two. 294-298 - Heeralal Janwa, Arbind K. Lal:
On the generalized Hamming weights of cyclic codes. 299-307 - Iliya Boukliev, Stoyan N. Kapralov, Tatsuya Maruta, M. Fukui:
Optimal linear codes of dimension 4 over F5. 308-313 - T. Aaron Gulliver, Vijay K. Bhargava:
New optimal binary linear codes of dimensions 9 and 10. 314-318 - Han-Ping Tsai:
The covering radius of extremal self-dual code D11 and its application. 316-318 - Tuvi Etzion:
Cascading methods for runlength-limited arrays. 319-323 - M. F. Hole, Øyvind Ytrehus:
Two-step trellis decoding of partial unit memory convolutional codes. 324-329 - Joachim Rosenthal, Eric V. York:
On the generalized Hamming weights of convolutional codes. 330-334 - E. A. Gelblum, A. Robert Calderbank:
A forbidden rate region for generalized cross constellations. 335-341 - Ivan J. Fair, Qiang Wang, Vijay K. Bhargava:
Characteristics of guided scrambling encoders and their coded sequences. 342-346 - M. J. Durst:
The progressive transmission disadvantage. 347-349 - J. Chow, Toby Berger:
Failure of successive refinement for symmetric Gaussian mixtures. 350-351 - Ping Wah Wong:
Rate distortion efficiency of subband coding with crossband prediction. 352-355 - John K. Karlof, Yaw O. Chang:
Optimal permutation codes for the Gaussian channel. 356-358 - W. Wesley Peterson:
A note on permutation modulation. 359-360 - H. D. Luke:
Almost-perfect polyphase sequences with small phase alphabet. 361-362 - Leonid A. Bassalygo, Mark S. Pinsker:
On codes correcting weakly localized errors. 363-364 - H. D. Luke:
Binary odd-periodic complementary sequences. 365-367 - Miklós Ruszinkó, Peter Vanroose:
How an Erdöos-Rényi-type search approach gives an explicit code construction of rate 1 for random access with multiplicity feedback. 368-372 - Alister G. Burr, Timothy J. Lunn:
Block-coded modulation optimized for finite error rate on the white Gaussian noise channel. 373-385
Volume 43, Number 2, March 1997
- Oscar E. Agazzi, Nambirajan Seshadri:
On the use of tentative decisions to cancel intersymbol interference and nonlinear distortion (with application to magnetic recording channels). 394-408 - Daniel M. Yellin, Alexander Vardy, Ofer Amrani:
Joint equalization and coding for intersymbol interference channels. 409-425 - Tricia J. Willink, Paul H. Wittke:
Optimization and performance evaluation of multicarrier transmission. 426-440 - Bartolomeu F. Uchôa Filho, Mark A. Herro:
Good convolutional codes for the precoded (1-D)(1+D)n partial-response channels. 441-453 - Ho-Kyoung Lee, Charles L. Weber:
Multiple-symbol trellis-coded modulation applied to noncoherent continuous-phase frequency shift keying. 454-468 - Kutluyil Dogancay, Rodney A. Kennedy:
Blind detection of equalization errors in communication systems. 469-482 - Gusztáv Morvai, Sidney Yakowitz, Paul H. Algoet:
Weakly convergent nonparametric forecasting of stationary time series. 483-498 - Karim Abed-Meraim, Philippe Loubaton, Eric Moulines:
A subspace algorithm for certain blind identification problems. 499-511 - H. Pezeshki-Esfahani, Andrew J. Heunis:
Strong diffusion approximations for recursive stochastic algorithms. 512-523 - Adel A. Zerai, James A. Bucklew:
Poisson approximation for excursions of adaptive algorithms with a lattice state space. 524-536 - Simon R. Blackburn:
Fast rational interpolation, Reed-Solomon decoding, and the linear complexity profiles of sequences. 537-548 - Tor Helleseth, Torleiv Kløve, Vladimir I. Levenshtein:
On the information function of an error-correcting code. 549-557 - Yosef Kofman, Ephraim Zehavi, Shlomo Shamai:
nd-convolutional codes. I. Performance analysis. 558-575 - Yosef Kofman, Ephraim Zehavi, Shlomo Shamai:
nd-convolutional codes. II. Structural analysis. 576-589 - Josep Rifà, Jaume Pujol:
Translation-invariant propelinear codes. 590-598 - Te Sun Han, Mamoru Hoshi:
Interval algorithm for random number generation. 599-611 - Tamás Linder, Gábor Lugosi, Kenneth Zeger:
Empirical quantizer design in the presence of source noise or channel noise. 612-623 - Kristine L. Bell, Yossef Steinberg, Yariv Ephraim, Harry L. Van Trees:
Extended Ziv-Zakai lower bound for vector parameter estimation. 624-637 - Xiaolin Wu:
Optimal binary vector quantization via enumeration of covering codes. 638-645 - Qun Xie, Andrew R. Barron:
Minimax redundancy for the class of memoryless sources. 646-657 - Serap A. Savari, Robert G. Gallager:
Generalized Tunstall codes for sources with memory. 658-668 - Rudolf Ahlswede, Te Sun Han, Kingo Kobayashi:
Universal coding of integers and unbounded search trees. 669-682 - Mark R. Titchener:
The synchronization of variable-length codes. 683-691
- Steven W. McLaughlin, Ali S. Khayrallah:
Shaping codes constructed from cost-constrained graphs. 692-699 - Steven W. McLaughlin:
The construction of M-ary (d, {infty}) codes that achieve capacity and have the fewest number of encoder states. 699-703 - J.-C. Batllo, Vinay A. Vaishampayan:
Asymptotic performance of multiple description transform codes. 703-707 - Leif Wilhelmsson, Kamil Sh. Zigangirov:
On uncoordinated transmission over the T-user q-ary noiseless multiple-access channel. 707-711 - Marten van Dijk:
On a special class of broadcast channels with confidential messages. 712-714 - Eva K. Englund, A. I. Hansson:
Constructive codes with unequal error protection. 715-721 - W. C. Ferreira, Willem A. Clarke, Albertus S. J. Helberg, Khaled A. S. Abdel-Ghaffar, A. J. Han Vinck:
Insertion/deletion correction with spectral nulls. 722-732 - Li-Zhong Tang, Cheong Boon Soh, Erry Gunawan:
A note on the q-ary image of a qm-ary repeated-root cyclic code. 732-737 - Muzhong Wang, Ian F. Blake:
Normal basis of the finite field F2(p-1)pm over F2. 737-739 - Klaus Huber:
Codes over tori. 740-744 - Enzo Baccarelli, Roberto Cusani, Stefano Galli:
Novel analytical performance bounds for symbol-by-symbol decoding of digital-data impaired by ISI and AWGN. 744-750 - Corneliu Eugen D. Sterian:
Wei-type trellis-coded modulation with 2N -dimensional rectangular constellation for N not a power of two. 750-758 - Tolga M. Duman, Masoud Salehi:
Optimal quantization for finite-state channels. 758-765 - Neri Merhav:
On list size exponents in rate-distortion coding. 765-769 - Igor V. Nikiforov:
Two strategies in the problem of change detection and isolation. 770-776 - Elias Masry:
Polynomial interpolation and prediction of continuous-time processes from random samples. 776-783 - Hsien-Kuei Hwang:
Optimal algorithms for inserting a random element into a random heap. 784-787 - Linzhang Lu, Weiwei Sun:
The minimal eigenvalues of a class of block-tridiagonal matrices. 787-791 - Ilya Dumer:
Correction to 'Suboptimal decoding of linear codes: Partition technique' [Nov 96 1971-1986]. 792
Volume 43, Number 3, May 1997
- Brian L. Hughes:
The smallest list for the arbitrarily varying channel. 803-815 - Kojiro Kobayashi:
The Kolmogorov complexity, universal distribution, and coding theorem for generalized length functions. 816-826 - Hirosuke Yamamoto:
Rate-distortion theory for the Shannon cipher system. 827-835 - Shlomo Shamai, Sergio Verdú:
The empirical distribution of good codes. 836-846 - Sergio Verdú, Te Sun Han:
The role of the asymptotic equipartition property in noiseless source coding. 847-857 - Harold Vincent Poor, Sergio Verdú:
Probability of error in MMSE multiuser detection. 858-871 - Alexander Goldenshluger, Arkadi Nemirovski:
Adaptive de-noising of signals satisfying differential inequalities. 872-889 - W. W. Choy, Norman C. Beaulieu:
Improved bounds for error recovery times of decision feedback equalization. 890-902 - Kim L. Blackmore, Robert C. Williamson, Iven M. Y. Mareels:
Decision region approximation by polynomials or neural networks. 903-907 - Joseph M. Francos:
Bounds on the accuracy of estimating the parameters of discrete homogeneous random fields with mixed spectral distributions. 908-922 - Leonidas Georgiadis, Wojciech Szpankowski, Leandros Tassiulas:
Stability analysis of quota allocation access protocols in ring networks with spatial reuse. 923-937 - X. Giraud, Emmanuel Boutillon, Jean-Claude Belfiore:
Algebraic tools to build modulation schemes for fading channels. 938-952 - Jürgen Bierbrauer, Yves Edel:
New code parameters from Reed-Solomon subfield codes. 953-968 - Alexis Bonnecaze, Patrick Solé, Christine Bachoc, Bernard Mourrain:
Type II codes over Z4. 969-976 - A. Robert Calderbank, Wen-Ching W. Li, Bjorn Poonen:
A 2-adic approach to the analysis of cyclic codes. 977-986
- Ilia Krasikov, Simon Litsyn:
Estimates for the range of binomiality in codes' spectra. 987-991 - Yves Edel, Jürgen Bierbrauer:
Lengthening and the Gilbert-Varshamov bound. 991-992 - Tomohiko Uyematsu, Eiji Okamoto:
A construction of codes with exponential error bounds on arbitrary discrete memoryless channels. 992-996 - Jon Hamkins, Kenneth Zeger:
Improved bounds on maximum size binary radar arrays. 997-1000 - Wai Ho Mow, Shuo-Yen Robert Li:
Aperiodic autocorrelation and crosscorrelation of polyphase sequences. 1000-1007 - Guang Gong:
A new class of nonlinear PN sequences over GF(qn). 1007-1012 - J. Carmelo Interlando, Reginaldo Palazzo Jr., Michele Elia:
On the decoding of Reed-Solomon and BCH codes over integer residue rings. 1013-1021 - Vladimir D. Tonchev:
Binary codes derived from the Hoffman-Singleton and Higman-Sims graphs. 1021-1025 - Xiang-dong Hou:
On the norm and covering radius of the first-order Reed-Muller codes. 1025-1027 - Marc P. C. Fossorier, Shu Lin:
Weight distribution for closest coset decoding of |u|u+v| constructed codes. 1028-1030 - Hari T. Moorthy, Shu Lin, Tadao Kasami:
Soft-decision decoding of binary linear block codes based on an iterative search algorithm. 1030-1040 - Morteza Esmaeili, T. Aaron Gulliver, Norman P. Secord:
Quasi-cyclic structure of Reed-Muller codes and their smallest regular trellis diagram. 1040-1052 - M. F. Hole, Kjell Jørgen Hole:
Low-complexity decoding of partial unit memory codes on precoded partial-response channels. 1052-1058 - James R. Roche, Raymond W. Yeung, Ka Pun Hau:
Symmetrical multilevel diversity coding. 1059-1064 - Ying-Wah Wu, Shih-Chun Chang:
Coding scheme for synchronous-CDMA systems. 1064-1067 - Leandros Tassiulas:
Scheduling and performance limits of networks with constantly changing topology. 1067-1073 - Tiberiu Constantinescu, Ali H. Sayed, Thomas Kailath:
Displacement structure and maximum entropy. 1074-1080 - Z. Fabian:
Information and entropy of continuous random variables. 1080-1084 - Ilan Reuven, Hagit Messer:
A Barankin-type lower bound on the estimation error of a hybrid parameter vector. 1084-1093 - Daniel R. Fuhrmann:
Correction to 'On the existence of positive-definite maximum-likelihood estimates of structured covariance matrices'. 1094-1096
Volume 43, Number 4, July 1997
- En-Hui Yang, John C. Kieffer:
On the redundancy of the fixed-database Lempel-Ziv algorithm for phi -mixing sources. 1101-1111 - Neri Merhav, Jacob Ziv:
On the amount of statistical side information required for lossy data compression. 1112-1121 - Andrew B. Nobel:
Recursive partitioning to reduce distortion. 1122-1133 - M. F. Larsen, Richard L. Frost:
Complexity-constrained trellis quantizers. 1134-1144 - Te Sun Han:
An information-spectrum approach to source coding theorems with a fidelity criterion. 1145-1164 - J. Takeuchi:
Characterization of the Bayes estimator and the MDL estimator for exponential families. 1165-1174 - José L. Balcázar, Ricard Gavaldà, Hava T. Siegelmann:
Computational power of neural networks: a characterization in terms of Kolmogorov complexity. 1175-1183 - Sam Efromovich:
Robust and efficient recovery of a signal passed through a filter and then contaminated by non-Gaussian noise. 1184-1191 - Rolf T. Gustafsson, Ola G. Hössjer, Tommy Öberg:
Adaptive detection of known signals in additive noise by means of kernel density estimators. 1192-1204 - Feng-Wen Sun, Harry Leib:
Optimal phases for a family of quadriphase CDMA sequences. 1205-1217 - Alexis Bonnecaze, Iwan M. Duursma:
Translates of linear codes over Z4. 1218-1230