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
- M. A. Akra, S. 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
- S. 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
Correspondence
- Kumar Balachandran, John B. Anderson:
Reduced complexity sequence detection for nonminimum phase intersymbol interference channels.
275-279
- C. C. Leang, D. 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
- I. 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, T. 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
- M. Ruszinko, 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-
Volume 43,
Number 2,
March 1997
Papers
- 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, E. Moulines:
A subspace algorithm for certain blind identification problems.
499-511
- H. Pezeshki-Esfahani, A. 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
- S. 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
- K. 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
Correspondence
- 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
- L. 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, W. 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
Papers
- 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, A. 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, E. 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
Correspondence
- 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
- H. 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
- J. 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
- T. 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
Papers
- 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
- R. T. Gustafsson, Ola Hössjer, T. Oberg:
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
- Scott A. Vanstone, Robert J. Zuccherato:
Elliptic curve cryptosystems using curves of smooth order over the ring Zn.
1231-1237
- Ilia Krasikov, Simon Litsyn:
Linear programming bounds for doubly-even self-dual codes.
1238-1244
- Wanzhi Qiu, Yingbo Hua:
Performance analysis of the matrix pair method for blind channel identification.
1245-1253
Correspondence
- Rudolf Ahlswede, Ning Cai:
Correlated sources help transmission over an arbitrarily varying channel.
1254-1255
- Andrew L. McKellips, Sergio Verdú:
Worst case additive noise for binary-input channels and zero-threshold detection under constraints of power and divergence.
1256-1264
- Hongwei Li, QianSheng Cheng:
Almost sure convergence analysis of mixed time averages and k th-order cyclic statistics.
1265-1268
- Wern-Ho Sheen, Huan-Chun Wang:
Performance analysis of the biased square-law sequential detector with signal present.
1268-1272
- Bernard C. Picinbono:
Ergodicity and fourth-order spectral moments.
1273-1276
- David Haussler:
A general minimax result for relative entropy.
1276-1280
- Peter Willett, Peter F. Swaszek:
A fact about the logistic distribution.
1280-1281
- Yong In Han, Taejon Kim:
Randomized fusion rules can be optimal in distributed Neyman-Pearson detectors.
1281-1288
- M. C. Pardo, Igor Vajda:
About distances of discrete distributions satisfying the data processing theorem of information theory.
1288-1293
- Vahid Tarokh, Alexander Vardy:
Upper bounds on trellis complexity of lattices.
1294-1300
- M. F. Hole, Kjell Jørgen Hole:
Tight bounds on the minimum average weight per branch for rate (N-1)/N convolutional codes.
1301-1305
- Irina E. Bocharova, Boris D. Kudryashov:
Rational rate punctured convolutional codes for soft-decision Viterbi decoding.
1305-1313
- T. Kaneko, T. Nishijima, Shigeichi Hirasawa:
An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding.
1314-1319
- S. Kallel, Kaipin Li:
Bidirectional sequential decoding.
1319-1326
- Jonathan J. Ashley, Brian H. Marcus:
A generalized state-splitting algorithm.
1326-1338
- Ioannis Kontoyiannis:
Second-order noiseless source coding theorems.
1339-1341
- Mark Goresky, Andrew Klapper:
Arithmetic crosscorrelations of feedback with carry shift register sequences.
1342-1345
- Yeow Meng Chee, Charles J. Colbourn:
Constructions for difference triangle sets.
1346-1349
- Hao Chen, Stephen S. Yau:
Contribution to Munuera's problem on the main conjecture of geometric hyperelliptic MDS codes.
1349-1354
- Marcel van der Vlugt:
Surfaces and the weight distribution of a family of codes.
1354-1360
- Tuvi Etzion:
The depth distribution-a new characterization for linear codes.
1361-1363
- Y. Desaki, Toru Fujiwara, Tadao Kasami:
The weight distributions of extended binary primitive BCH codes of length 128.
1364-1371
- Andrew Klapper:
The multicovering radii of codes.
1372-1377
- T. Aaron Gulliver, Patric R. J. Östergård:
Improved bounds for ternary linear codes of dimension 7.
1377-1381
Volume 43,
Number 5,
September 1997
Papers
- Kees A. Schouhamer Immink:
A practical method for approaching the channel capacity of constrained channels.
1389-1399
- C. P. M. J. Baggen, Ludo M. G. M. Tolhuizen:
On Diamond codes.
1400-1411
- Bertrand M. Hochwald, Kenneth Zeger:
Tradeoff between source and channel coding.
1412-1424
- Ron M. Roth:
Probabilistic crisscross error correction.
1425-1438
- Tomasz Luczak, Wojciech Szpankowski:
A suboptimal lossy data compression based on approximate pattern matching.
1439-1451
- A. J. Wyner:
The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm.
1452-1464
- En-Hui Yang, Zhen Zhang, Toby Berger:
Fixed-slope universal lossy data compression.
1465-1476
- Norifumi Kamiya:
On acceptance criterion for efficient successive errors-and-erasures decoding of Reed-Solomon and BCH codes.
1477-1488
- Khaled A. S. Abdel-Ghaffar:
A lower bound on the undetected error probability and strictly optimal codes.
1489-1502
- Giuseppe Caire, Giorgio Taricco, Javier Ventura-Traveset, Ezio Biglieri:
A multiuser approach to narrowband cellular communications.
1503-1517
- Leonidas Georgiadis, Roch Guérin, Abhay K. Parekh:
Optimal multiplexing on a single link: delay and buffer requirements.
1518-1535
- L. K. Hansen, Guanghan Xu:
A hyperplane-based algorithm for the digital co-channel communications problem.
1536-1548
- Harish Viswanathan, Toby Berger:
The quadratic Gaussian CEO problem.
1549-1559
- José M. F. Moura, S. Goswami:
Gauss-Markov random fields (CMrf) with continuous indices.
1560-1573
- Yi Sun:
Stochastic iterative algorithms for signal set design for Gaussian channels and optimality of the L2 signal set.
1574-1587
Correspondence
- Judy L. Walker:
The Nordstrom-Robinson code is algebraic-geometric.
1588-1593
- Sami Koponen, Jyrki T. Lahtonen:
On the aperiodic and odd correlations of the binary Shanbhag-Kumar-Helleseth sequences.
1593-1596
- Jong-Seon No, Kyeongcheol Yang, Habong Chung, Hong-Yeop Song:
New construction for families of binary sequences with optimal correlation properties.
1596-1602
- Erez Petrank, Ron M. Roth:
Is code equivalence easy to decide?
1602-1604
- Ludo M. G. M. Tolhuizen:
The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction].
1605-1606
- Sfefka Buyuklieva:
New extremal self-dual codes of lengths 42 and 44.
1607-1612
- W. Cary Huffman:
Characterization of quaternary extremal codes of lengths 18 and 20.
1613-1616
- Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Patrick Solé:
Long packing and covering codes.
1617-1619
- Sulaiman Al-Bassam, Ramarathnam Venkatesan, Sultan Al-Muhammadi:
New single asymmetric error-correcting codes.
1619-1623
- Kari J. Nurmela, Markku K. Kaikkonen, Patric R. J. Östergård:
New constant weight codes from linear permutation groups.
1623-1630
- Mattias Svanström:
A lower bound for ternary constant weight codes.
1630-1632
- T. Aaron Gulliver:
Improvements to the bounds on optimal ternary linear codes of dimension 6.
1632-1638
- Alexander A. Davydov:
Constructions of nonlinear covering codes.
1639-1647
- Rumen N. Daskalov, T. Aaron Gulliver:
New good quasi-cyclic ternary and quaternary linear codes.
1647-1650
- Takeshi Hashimoto, M. Taguchi:
Performance of explicit error detection and threshold decision in decoding with erasures.
1650-1655
- Yunghsiang S. Han, Carlos R. P. Hartmann:
The zero-guards algorithm for general minimum-distance decoding problems.
1655-1658
- L. Huynh, Alistair Moffat:
A probability-ratio approach to approximate binary arithmetic coding.
1658-1662
- Marc P. C. Fossorier, Shu Lin:
Some decomposable codes: the |a+x|b+x|a+b+x| construction.
1663-1667
- Marc P. C. Fossorier, Shu Lin:
Complementary reliability-based decodings of binary linear block codes.
1667-1672
- Henk D. L. Hollmann:
On an approximate eigenvector associated with a modulation code.
1672-1678
- Lei Wei, Tor Aulin, Honghui Qi:
On the effect of truncation length on the exact performance of a convolutional code.
1678-1681
- Jinn-Ja Chang, Der-June Hwang, Mao Chao Lin:
Some extended results on the search for good convolutional codes.
1682-1697
- Marcelo J. Weinberger, Gadiel Seroussi:
Sequential prediction and ranking in universal context modeling and data compression.
1697-1706
- Neri Merhav:
How many information bits does a decoder need about the channel statistics?
1707-1714
- Milan M. Milosavljevic, Milutin R. Dostanic:
On generalized stable nonuniform sampling expansions involving derivatives.
1714-1716
- A. I. Zayed, A. G. Garcia:
Nonuniform sampling of bandlimited signals with polynomial growth on the real axis.
1717-1721
- Peter L. Bartlett, Sanjeev R. Kulkarni, S. E. Posner:
Covering numbers for real-valued function classes.
1721-1724
- Alex J. Grant, Christian Schlegel:
Collision-type multiple-user communications.
1725-1736
- H. Herzberg:
On the spectrum of distances of a multilevel code, decoded by a multistage decoder.
1736-1740
- Xian-Mo Zhang, Yuliang Zheng:
Cryptographically resilient functions.
1740-1747
- Marcel van der Vlugt:
Addendum to 'Non-BCH triple-error-correcting codes'.
1747
Volume 43,
Number 6,
November 1997
Papers
- Alexander Vardy:
The intractability of computing the minimum distance of a code.
1757-1766
- Hans-Andrea Loeliger:
Averaging bounds for lattices and linear codes.
1767-1773
- Jon Hamkins, Kenneth Zeger:
Asymptotically dense spherical codes - Part h Wrapped spherical codes.
1774-1785
- Jon Hamkins, Kenneth Zeger:
Asymptotically dense spherical codes - Part II: Laminated spherical codes.
1786-1798
- Gui Liang Feng, Thammavarapu R. N. Rao, G. A. Berg, J. Zhu:
Generalized Bezout's theorem and its applications in coding theory.
1799-1810
- Françoise Levy-dit-Vehel, Simon Litsyn:
Parameters of Goppa codes revisited.
1811-1819
- Tor Helleseth, Torleiv Kløve:
The Newton radius of codes.
1820-1831
- Kyeongcheol Yang, Tor Helleseth:
On the weight hierarchy of Preparata codes over Z4.
1832-1842
- Osnat Keren, Simon Litsyn:
A class of array codes correcting multiple column erasures.
1843-1851
- Nitin H. Vaidya, S. Perisetty:
Systematic proximity-detecting codes.
1852-1863
- G. Robert Redinbo:
Decoding real-number convolutional codes: Change detection, Kalman estimation.
1864-1876
- Shlomo Shamai, Aaron D. Wyner:
Information-theoretic considerations for symmetric, cellular, multiple-access fading channels - Part I.
1877-1894
- Shlomo Shamai, Aaron D. Wyner:
Information-theoretic considerations for symmetric, cellular, multiple-access fading channels - Part II.
1895-1911
- Yasutada Oohama:
Gaussian multiterminal source coding.
1912-1923
- Raymond W. Yeung:
A framework for linear information inequalities.
1924-1934
- John T. Lewis, C. E. Pfister, Raymond Russell, W. G. Sullivan:
Reconstruction sequences and equipartition measures: An examination of the asymptotic equipartition property.
1935-1947
- Gerasimos Potamianos, John K. Goutsias:
Stochastic approximation algorithms for partition function estimation of Gibbs random fields.
1948-1965
- Yehuda Hershkovits, Jacob Ziv:
On fixed-database universal data compression with limited memory.
1966-1976
Correspondence
- Ì. Emre Telatar:
Zero-error list capacities of discrete memoryless channels.
1977-1982
- Zhen Zhang, Raymond W. Yeung:
A non-Shannon-type conditional inequality of information quantities.
1982-1986
- Andrea J. Goldsmith, Pravin Varaiya:
Capacity of fading channels with channel side information.
1986-1992
- Abdel-Ghani A. Daraiseh, Carl W. Baum:
Exact performance analysis of linear block codes in frequency-hop spread spectrum communication systems.
1993-1999
- Oscar Moreno, Solomon W. Golomb, C. J. Corrada:
Extended sonar sequences.
1999-2005
- M. Y. Zaidan, Christopher F. Barnes, Stephen B. Wicker:
Use of sigma-trees as constellations in trellis-coded modulation.
2005-2012
- Fu-Quan Wang, Daniel J. Costello Jr.:
Sequential decoding of trellis codes at high spectral efficiencies.
2013-2019
- Erozan M. Kurtas, John G. Proakis, Masoud Salehi:
Coding for multitrack magnetic recording systems.
2020-2023
- Rossitza Dodunekova, Stefan M. Dodunekov:
Sufficient conditions for good and proper error-detecting codes.
2023-2026
- Tamás Linder, Vahid Tarokh, Kenneth Zeger:
Existence of optimal prefix codes for infinite source alphabets.
2026-2028
- Roberto De Prisco, Alfredo De Santis:
A new bound for the data expansion of Huffman codes.
2028-2032
- H. Zhang:
Maximum entropy modeling of periodically correlated processes.
2033-2035
- Steven T. Dougherty, T. Aaron Gulliver, Masaaki Harada:
Extremal binary self-dual codes.
2036-2047
- Wende Chen, Torleiv Kløve:
Bounds on the weight hierarchies of linear codes of dimension 4.
2047-2054
- Iliya Boukliev, Stefan M. Dodunekov, Tor Helleseth, Øyvind Ytrehus:
On the [162, 8, 80] codes.
2055-2057
- Tsonka Stefanova Baicheva, Evgenia D. Velikova:
Covering radii of ternary linear codes of small dimensions and codimensions.
2057-2061
- Serdar Boztas:
Comments on 'An inequality on guessing and its application to sequential decoding'.
2062-2063
- I. Vaughan L. Clarkson, Jane E. Perkins, Iven M. Y. Mareels:
Errata in 'Number theoretic solutions to intercept time problems' [May 96 959-971].
2064
- Tomasz Luczak, Wojciech Szpankowski:
Correction to 'A Suboptimal Lossy Data Compression Based on Approximate Pattern Matching'.
2064-2065
Copyright © Tue Nov 17 01:58:40 2009
by Michael Ley (ley@uni-trier.de)
