

Stop the war!
Остановите войну!
for scientists:


default search action
IEEE Transactions on Information Theory, Volume 45
Volume 45, Number 1, January 1999
- Fabio Fagnani, Sandro Zampieri

:
Minimal Syndrome Formers for Group Codes. 3-31
- Steven T. Dougherty, Philippe Gaborit, Masaaki Harada, Patrick Solé:

Type II Codes Over F2 + u F2. 32-45
- Mario Blaum, Ron M. Roth:

On Lowest Density MDS Codes. 46-59
- Stavros Konstantinidis

:
Structural Analysis of Error-Correcting Codes for Discrete Channels That Involve Combinations of Three Basic Error Types. 60-77
- Takeshi Hashimoto:

Composite Scheme LR + Th for Decoding with Erasures and Its Effective Equivalence to Forney's Rule. 78-93
- A. Robert Calderbank, Alexandra Duel-Hallen

, Peter C. Fishburn, Asya Rabinovich:
Interpolation by Convolutional Codes, Overload Distortion, and the Erasure Channel. 94-105
- Ram Zamir, Toby Berger:

Multiterminal Source Coding with High Resolution. 106-117
- Søren Forchhammer, Jørn Justesen:

Entropy Bounds for Constrained Two-Dimensional Random Fields. 118-127
- Bertrand M. Hochwald, Predrag R. Jelenkovic:

State Learning and Mixing in Entropy of Hidden Markov Processes and the Gilbert-Elliott Channel. 128-138
- Thomas L. Marzetta, Bertrand M. Hochwald:

Capacity of a Mobile Multiple-Antenna Communication Link in Rayleigh Flat Fading. 139-157
- Rick S. Blum

:
Distributed Detection for Diversity Reception of Fading Signals in Noise. 158-164
- Bertrand S. Clarke:

Asymptotic Normality of the Posterior in Relative Entropy. 165-176
- Majeed M. Hayat, John A. Gubner, Sajjad Abdullah:

Asymptotic Distributions for the Performance Analysis of Hypothesis Testing of Isolated-Point-Penalization Point Processes. 177-187
- Bart Preneel, Paul C. van Oorschot

:
On the Security of Iterated Message Authentication Codes. 188-199
- Roar Hagen, Per Hedelin:

Robust Vector Quantization by a Linear Mapping of a Block Code. 200-218
- Mahesh K. Varanasi:

Decision Feedback Multiuser Detection: A Systematic Approach. 219-240
- Shirish A. Altekar, Magnus Berggren, Bruce E. Moision, Paul H. Siegel, Jack K. Wolf:

Error-Event Characterization on Partial-Response Channels. 241-247
- Ilia Krasikov, Simon Litsyn:

On the Distance Distribution of Duals of BCH Codes. 247-250
- Osnat Keren, Simon Litsyn:

More on the Distance Distribution of BCH Codes. 251-255
- E. Hernquist, Donald W. Newhart, Richard A. Strong:

Finding Short and Light Codewords in BCH Codes. 255-260
- Douglas A. Leonard:

Efficient Forney Functions for Decoding AG Codes. 260-265
- Eric M. Rains:

Quantum Codes of Minimum Distance Two. 266-271
- Lihao Xu, Jehoshua Bruck

:
X-Code: MDS Array Codes with Optimal Encoding. 272-276
- Wende Chen, Torleiv Kløve:

Weight Hierarchies of Extremal Non-Chain Binary Codes of Dimension 4. 276-281
- Nigel Boston:

The Minimum Distance of the [137, 69] Binary Quadratic Residue Code. 282
- Doug Kuhlman:

The Minimum Distance of the [83, 42] Ternary Quadratic Residue Code. 282
- C. Wayne Walker:

New Formulas for Solving Quadratic Equations over Certain Finite Fields. 283-284
- Vladimir I. Levenshtein:

New Lower Bounds on Aperiodic Crosscorrelation of Binary Codes. 284-288
- Eva Nuria Müller:

On the Crosscorrelation of Sequences Over GF(p) with Short Periods. 289-295
- Keqin Feng, Peter Jau-Shyong Shiue, Qing Xiang:

On Aperiodic and Periodic Complementary Binary Sequences. 296-303
- Jinjun Zhou, Weihong Chen, Fengxiu Gao:

Best Linear Approximation and Correlation Immunity of Functions Over Z*m. 303-308
- Fang-Wei Fu, A. J. Han Vinck:

On the Capacity of Generalized Write-Once Memory with State Transitions Described by an Arbitrary Directed Acyclic Graph. 308-313
- Matthias Löwe:

On the Storage Capacity of the Hopfield Model with Biased Patterns. 314-318
- Han Wu Chen, Kenjiro Yanagi:

Refinements of the Half-Bit and Factor-of-Two Bounds for Capacity in Gaussian Channel with Feedback. 319-325
- Rudolf Ahlswede, Vladimir B. Balakirsky:

Construction of Uniquely Decodable Codes for the Two-User Binary Adder Channel. 326-330
- Neri Merhav, Ron M. Roth, Erdal Arikan:

Hierarchical Guessing with a Fidelity Criterion. 330-337
- Jun Muramatsu, Fumio Kanaya:

Almost-Sure Variable-Length Source Coding Theorems for General Sources. 337-342
- Anna Scaglione, Sergio Barbarossa

:
Statistical Analysis of the Product High-Order Ambiguity Function. 343-356
- Oran Sharon:

On the Relation Between Bit Delay for Slot Reuse and the Number of Address Bits in the Dual-Bus Configuration. 356-365
- T. V. Selvakumaran, B. Sundar Rajan:

Block-Coded Modulation Using Two-Level Group Codes Over Generalized Quaternion Groups. 365-372
- Jovan Dj. Golic:

Comment on 'Relations Between Entropy and Error Probability'. 372
Volume 45, Number 2, March 1999
- Simon Litsyn:

New Upper Bounds on Error Exponents. 385-398
- David J. C. MacKay:

Good Error-Correcting Codes Based on Very Sparse Matrices. 399-431
- Mohammad Amin Shokrollahi, Hal Wasserman:

List Decoding of Algebraic-Geometric Codes. 432-437
- Alexei E. Ashikhmin, Alexander Barg:

Binomial Moments of the Distance Distribution: Bounds and Applications. 438-452
- Cunsheng Ding, Vera Pless:

Cyclotomy and Duadic Codes of Prime Lengths. 453-466
- Cunsheng Ding, Tor Helleseth:

Generalized Cyclotomic Codes of Length p1e1 ... ptet. 467-474
- Tor Helleseth, Chunming Rong

, Daniel Sandberg:
New Families of Almost Perfect Nonlinear Power Mappings. 475-485
- Renato Menicocci, Jovan Dj. Golic:

Correlation Attacks on Up/Down and Stop/Go Cascades. 486-498
- Ueli M. Maurer, Stefan Wolf

:
Unconditionally Secure Key Agreement and the Intrinsic Conditional Information. 499-514
- Mikael Skoglund, Per Hedelin:

Hadamard-Based Soft Decoding for Vector Quantization Over Noisy Channels. 515-532
- Tamás Linder, Ram Zamir:

High-Resolution Source Coding for Non-Difference Distortion Measures: The Rate-Distortion Function. 533-547
- Tamás Linder, Ram Zamir, Kenneth Zeger:

High-Resolution Source Coding for Non-Difference Distortion Measures: Multidimensional Companding. 548-561
- A. Yuan, Bertrand S. Clarke:

An Information Criterion for Likelihood Selection. 562-571
- Jenn-Sen Leu, Adrian Papamarcou:

Asymptotic Optimality of Likelihood Ratio Threshold Tests in Decentralized Detection. 572-585
- En-Hui Yang, Zhen Zhang:

Variable-Rate Trellis Source Encoding. 586-608
- Raymond W. Yeung, Zhen Zhang:

On Symmetrical Multilevel Diversity Coding. 609-621
- Sergio Verdú, Shlomo Shamai:

Spectral Efficiency of CDMA with Random Spreading. 622-640
- David N. C. Tse, Stephen V. Hanly

:
Linear Multiuser Receivers: Effective Interference, Effective Bandwidth and User Capacity. 641-657
- Stefan Höst, Rolf Johannesson, Kamil Sh. Zigangirov, Victor V. Zyablov

:
Active Distances for Convolutional Codes. 658-669
- Vahid Tarokh, Alexander Vardy

, Kenneth Zeger:
Universal Bound on the Performance of Lattice Codes. 670-681
- Xiaohong Chen, Halbert White:

Improved Rates and Asymptotic Normality for Nonparametric Neural Network Estimators. 682-691
- Guang Gong, Solomon W. Golomb:

Binary Sequences with Two-Level Autocorrelation. 692-693
- Tuvi Etzion:

Linear Complexity of de Brujin Sequences - Old and New Results. 693-698
- Tim Blackmore:

Every Binary (2m-2, 22m-2-m, 3) Code Can Be Lengthened to Form a Perfect Code of Length 2m-1. 698-700
- Thomas Honold, Ivan N. Landjev:

All Reed-Muller Codes Are Linearly Representable over the Ring of Dual Numbers over Z2. 700-701
- T. Aaron Gulliver, Nikolai Senkevitch:

On a Class of Self-Dual Codes Derived from Quadratic Residues. 701-702
- T. Aaron Gulliver, Masaaki Harada:

Codes of Lengths 120 and 136 Meeting the Grey-Rankin Bound and Quasi-Symmetric Designs. 703-706
- Hao Chen:

Codes on Garcia-Stichtenoth Curves with True Distance Greater Than Feng-Rao Distance. 706-709
- Carlos Munuera

, Domingo Ramirez:
The Second and Third Generalized Hamming Weights of Hermitian Codes. 709-712
- Ilan Reuven, Yair Be'ery:

Generalized Hamming Weights of Nonlinear Codes and the Relation to the Z4-Linear Representation. 713-720
- Vladimir Sidorenko

, Ian Martin, Bahram Honary:
On the Rectangularity of Nonlinear Block Codes. 720-725
- Robert Morelos-Zaragoza

, Toru Fujiwara, Tadao Kasami, Shu Lin:
Constructions of Generalized Concatenated Codes and Their Trellis-Based Decoding Complexity. 725-731
- Takuya Koumoto, Toyoo Takata, Tadao Kasami, Shu Lin:

A Low-Weight Trellis-Based Iterative Soft-Decision Decoding Algorithm for Binary Linear Block Codes. 731-741
- Rudolf Ahlswede, Ning Cai:

Arbitrarily Varying Multiple-Access Channels Part I - Ericson's Symmetrizability Is Adequate, Gubner's Conjecture Is True. 742-749
- Rudolf Ahlswede, Ning Cai:

Arbitrarily Varying Multiple-Access Channels - Part II - Correlated Senders' Side Information, Correlated Messages, and Ambiguous Transmission. 749-756
- Te Sun Han, Mitsuru Hamada:

Disjointness of Random Sequence Sets with Respect to Distinct Probability Measures. 756-760
- Harish Viswanathan:

Capacity of Markov Channels with Receiver CSI and Delayed Feedback. 761-771
- Esa Malkamäki, Harry Leib:

Coded Diversity on Block-Fading Channels. 771-781
- Liuyang Yang, Thomas R. Fischer:

Trellis-Coded Quantization for Binary Erasure Channels. 781-787
- András Méhes, Kenneth Zeger:

Randomly Chosen Index Assignments Are Asymptotically Bad for Uniform Sources. 788-794
- Roman Talyansky, Tuvi Etzion, Ron M. Roth:

Efficient Code Construction for Certain Two-Dimensional Constraints. 794-799
- Zoltán Füredi, Miklós Ruszinkó:

An Improved Upper Bound of the Rate of Euclidean Superimposed Codes. 799-802
- Fang-Wei Fu, Torleiv Kløve, Shi-Yi Shen:

On the Hamming Distance Between Two i.i.d. Random n-Tuples over a Finite Set. 803-807
- Eric Bach, Klaus Huber:

Note on Taking Square-Roots Modulo N. 807-809
- Edwin K. P. Chong

, I-Jeng Wang, Sanjeev R. Kulkarni:
Noise Conditions for Prespecified Convergence Rates of Stochastic Approximation Algorithms. 810-814
Volume 45, Number 3, April 1999
- Hamid Krim, Walter Willinger, Anatoli B. Juditsky, David N. C. Tse:

Introduction to Special Issue on Mutliscale Statistical Signal Analysis and Its Application. 825-827
- Khalid Daoudi, Austin B. Frakt

, Alan S. Willsky:
Multiscale Autoregressive Models and Wavelets. 828-845
- Klaus E. Timmermann, Robert D. Nowak:

Multiscale Modeling and Estimation of Poisson Processes with Application to Photon-Limited Imaging. 846-862
- David Leporini, Jean-Christophe Pesquet:

High-Order Wavelet Packets and Cumulant Field Analysis. 863-877
- Darryl Veitch, Patrice Abry

:
A Wavelet-Based Joint Estimator of the Parameters of Long-Range Dependence. 878-897
- Hamid Krim, Irvin C. Schick:

Minimax Description Length for Signal Denoising and Optimized Representation. 898-908
- Pierre Moulin, Juan Liu:

Analysis of Multiresolution Image Denoising Schemes Using Generalized Gaussian and Complexity Priors. 909-919
- Alfred O. Hero III, Robinson Piramuthu, Jeffrey A. Fessler, Stephen R. Titus:

Minimax Emission Computed Tomography using High-Resolution Anatomical Side Information and B-Spline Models. 920-938
- Stefano Casadei, Sanjoy K. Mitter:

An Efficient and Provably Correct Algorithm for the Multiscale Estimation of Image Contours by Means of Polygonal Lines. 939-954
- Michael M. Daniel, Alan S. Willsky:

The Modeling and Estimation of Statistically Self-Similar Processes in a Multiresolution Framework. 955-970
- Anna C. Gilbert, Walter Willinger, Anja Feldmann:

Scaling Analysis of Conservative Cascades, with Applications to Network Traffic. 971-991
- Rudolf H. Riedi, Matthew S. Crouse, Vinay J. Ribeiro, Richard G. Baraniuk:

A Multifractal Wavelet Model with Application to Network Traffic. 992-1018
- Anna Scaglione, Sergio Barbarossa

, Georgios B. Giannakis
:
Filterbank Transceivers Optimizing Information Rate in Block Transmissions over Dispersive Channels. 1019-1032
- Béatrice Pesquet-Popescu:

Wavelet Packet Decompositions for the Analysis of 2-D Fields with Stationary Fractional Increments. 1033-1039
- Peter Singer:

Uncertainty Inequalities for the Continuous Wavelet Transform. 1039-1042
- Brian M. Sadler

, Ananthram Swami:
Analysis of Multiscale Products for Step Detection and Estimation. 1043-1051
- Jon Sporring, Joachim Weickert:

Information Measures in Scale-Spaces. 1051-1058
Volume 45, Number 4, May 1999
- Jorma Rissanen:

Fast Universal Coding With Context Models. 1065-1071
- Philippe Jacquet, Wojciech Szpankowski:

Entropy Computations via Analytic Depoissonization. 1072-1081
- Jia Li, Navin Chaddha, Robert M. Gray:

Asymptotic Performance of Vector Quantizers with a Perceptual Distortion Measure. 1082-1091
- En-Hui Yang, Zhen Zhang:

On the Redundancy of Lossy Source Coding with Abstract Alphabets. 1092-1110
- Raymond W. Yeung, Zhen Zhang:

Distributed Source Coding for Satellite Communications. 1111-1120
- Vahid Tarokh, Ayman F. Naguib, Nambi Seshadri, A. Robert Calderbank:

Combined Array Processing and Space-Time Coding. 1121-1128
- David Middleton:

Non-Gaussian Noise Models in Signal Processing for Telecommunications: New Methods and Results for Class A and Class B Noise Models. 1129-1149
- H. Vincent Poor:

Maximum Entropy and Robust Prediction on a Simplex. 1150-1164
- Paul H. Algoet:

Universal Schemes for Learning the Best Nonlinear Predictor Given the Infinite Past and Side Information. 1165-1185
- Chaoping Xing, Harald Niederreiter, Kwok-Yan Lam:

Constructions of Algebraic-Geometry Codes. 1186-1193
- Eiichi Bannai, Steven T. Dougherty, Masaaki Harada, Manabu Oura:

Type II Codes, Even Unimodular Lattices, and Invariant Rings. 1194-1205
- Alexei E. Ashikhmin, Simon Litsyn:

Upper Bounds on the Size of Quantum Codes. 1206-1215
- Christopher A. Fuchs, Jeroen van de Graaf:

Cryptographic Distinguishability Measures for Quantum-Mechanical States. 1216-1227
- Esa Malkamäki, Harry Leib:

Coded Diversity on Block-Fading Channels. IEEE Trans. Inf. Theory 45(4): 1228-1229 (1999)
- Patric R. J. Östergård, Tsonka Stefanova Baicheva

, Emil Kolev:
Optimal Binary One-Error-Correcting Codes of Length 10 Have 72 Codewords. 1229-1231
- Masaaki Harada:

Construction of an Extremal Self-Dual Code of Length 62. 1232-1233
- Sylvia B. Encheva, Gérard D. Cohen:

Constructions of Intersecting Codes. 1234-1237
- Caroline Fontaine:

On Some Cosets of the First-Order Reed-Muller Code with High Minimum Weight. 1237-1243
- Marko J. Moisio, Keijo O. Väänänen:

Two Recursive Algorithms for Computing the Weight Distribution of Certain Irreducible Cyclic Codes. 1244-1249
- Alexis Bonnecaze, Parampalli Udaya

:
Cyclic Codes and Self-Dual Codes Over F2 + uF2. 1250-1255
- Tor Helleseth, Bo Hove, Kyeongcheol Yang:

Further Results on Generalized Hamming Weights for Goethals and Preparata Codes Over Z4. 1255-1258
- Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:

New Upper Bounds on Generalized Weights. 1258-1263
- Thierry P. Berger:

New Classes of Cyclic Extended Goppa Codes. 1264-1266
- Chaoping Xing, Kwok-Yan Lam:

Sequences with Almost Perfect Linear Complexity Profiles and Curves Over Finite Fields. 1267-1270
- Hans Dobbertin:

Almost Perfect Nonlinear Power Functions on GF(2n): The Welch Case. 1271-1275
- Solomon W. Golomb, Guang Gong:

Periodic Binary Sequences with the "Trinomial Property". 1276-1279
- Taejoo Chang, Bongjoo Park, Yun Hee Kim, Iickho Song:

An Efficient Implementation of the D-Homomorphism for Generation of de Bruijn Sequences. 1280-1283
- Paul C. Shields:

Performance of LZ Algorithms on Individual Sequences. 1283-1288
- Dean P. Foster, Robert A. Stine:

Local Asymptotic Coding and the Minimum Description Length. 1289-1293
- Mikael Skoglund:

Soft Decoding for Vector Quantization Over Noisy Channels with Memory. 1293-1307
- Jiangtao Wen, John D. Villasenor:

Structured Prefix Codes for Quantized Low-Shape-Parameter Generalized Gaussian Sources. 1307-1314
- Georges A. Darbellay, Igor Vajda:

Estimation of the Information by an Adaptive Partitioning of the Observation Space. 1315-1321
- Paul P. B. Eggermont, Vincent N. LaRiccia:

Best Asymptotic Normality of the Kernel Density Entropy Estimator for Smooth Densities. 1321-1326
- Arthur H. M. Ross:

Algorithm for Calculating the Noncentral Chi-Square Distribution. 1327-1333
- Volodia Blinovsky:

Multiple Packing of the Euclidean Sphere. 1334-1337
- Walid K. M. Ahmed, Peter J. McLane:

Random Coding Error Exponents for Two-Dimensional Flat Fading Channels with Complete Channel State Information. 1338-1346
- Rafail E. Krichevskiy, Vladimir N. Potapov

:
Rapid Encoding of Run Lengths and Pyramid Cubic Lattices. 1347-1350
Volume 45, Number 5, July 1999
- Udo Wachsmann, Robert F. H. Fischer, Johannes B. Huber:

Multilevel codes: Theoretical concepts and practical design rules. 1361-1391
- Alexander Barg, E. A. Krouk

, Henk C. A. van Tilborg:
On the complexity of minimum distance decoding of long linear codes. 1392-1405
- Eran Fishler, Ofer Amrani, Yair Be'ery:

Geometrical and performance analysis of GMD and Chase decoding algorithms. 1406-1422
- Chunming Rong

, Tor Helleseth, Jyrki T. Lahtonen:
On algebraic decoding of the Z4-linear Calderbank-McGuire code. 1423-1434
- A. Robert Calderbank, G. David Forney Jr., Alexander Vardy

:
Minimal tail-biting trellises: The Golay code and more. 1435-1455
- Vahid Tarokh, Hamid Jafarkhani

, A. Robert Calderbank:
Space-Time block codes from orthogonal designs. 1456-1467
- Giuseppe Caire, Giorgio Taricco

, Ezio Biglieri:
Optimum power control over fading channels. 1468-1489
- Hamid Jafarkhani

, Vahid Tarokh:
Design of successively refinable trellis-coded quantizers. 1490-1497
- Gil I. Shamir, Neri Merhav:

Low-complexity sequential lossless coding for piecewise-stationary memoryless sources. 1498-1519
- Toby Berger, Ram Zamir:

A semi-continuous version of the Berger-Yeung problem. 1520-1526
- Akiko Kato, Kenneth Zeger:

On the capacity of two-dimensional run-length constrained channels. 1527-1540
- Gunter Ritter:

Efficient estimation of neural weights by polynomial approximation. 1541-1550
- Michael A. Gibson, Jehoshua Bruck

:
Efficient digital-to-analog encoding. 1551-1554
- Cormac Herley, Ping Wah Wong:

Minimum rate sampling and reconstruction of signals with arbitrary frequency support. 1555-1564
- Guy Le Besnerais, Jean-François Bercher, Guy Demoment:

A new look at entropy for solving linear inverse problems. 1565-1578
- Wei Luo, Anthony Ephremides:

Stability of N interacting queues in random-access systems. 1579-1587
- Anlu Yan, Wei-Bo Gong:

Time-driven fluid simulation for high-speed networks. 1588-1599
- Luisa Gargano

, Ugo Vaccaro:
Efficient generation of fair dice with few biased coins. 1600-1606
- Rajit Manohar:

The entropy of traces in parallel computation. 1606-1608
- Francesco Fabris

, Andrea Sgarro:
On the composition of Tunstall messages. 1608-1612
- Serap A. Savari:

Variable-to-fixed length codes and the conservation of entropy. 1612-1620
- Ron Meir, Vitaly Maiorov:

Distortion bounds for vector quantizers with finite codebook size. 1621-1631
- Robert F. H. Fischer:

Calculation of shell frequency distributions obtained with shell-mapping schemes. 1631-1639
- Emanuele Viterbo

, Joseph Boutros:
A universal lattice code decoder for fading channels. 1639-1642
- Esa Malkamäki, Harry Leib:

Evaluating the performance of convolutional codes over block fading channels. 1643-1646
- Marc P. C. Fossorier, Shu Lin, Daniel J. Costello Jr.:

On the weight distribution of terminated convolutional codes. 1646-1648
- Victor V. Zyablov

, Sergo Shavgulidze
, Oleg Skopintsev, Stefan Höst, Rolf Johannesson:
On the error exponent for woven convolutional codes with outer warp. 1649-1653
- Rolf Johannesson, Per Ståhl:

New rate 1/2, 1/3, and 1/4 binary convolutional encoders with an optimum distance profile. 1653-1658
- Ilan Reuven, Yair Be'ery:

The weighted coordinates bound and trellis complexity of block codes and periodic packings. 1658-1667
- Yaron Shany, Yair Be'ery:

The Preparata and Goethals codes: Trellis complexity and twisted squaring constructions. 1667-1673
- Joe Fields, Philippe Gaborit:

On the non Z4-linearity of certain good binary codes. 1674-1677
- François Rodier:

On the minimum distance of the duals of 4-error correcting extended BCH codes. 1677-1678
- Alexander A. Davydov

:
Constructions and families of nonbinary linear codes with covering radius 2. 1679-1686
- Rumen N. Daskalov

, T. Aaron Gulliver, Elena Metodieva:
New ternary linear codes. 1687-1688
- Joaquim Borges

, Josep Rifà
:
A characterization of 1-perfect additive codes. 1688-1697
- Claude Le Dantec, Philippe Piret:

An encoder to match Reed-Solomon codes over GF(q) to a subalphabet of GF(q). 1697-1701
- Andrew M. Steane:

Quantum Reed-Muller codes. 1701-1703
- Farrokh Vatan, Vwani P. Roychowdhury, M. P. Anantram:

Spatially correlated qubit errors and burst-correcting quantum codes. 1703-1708
- Hao Chen:

On the number of correctable errors of the Feng-Rao decoding algorithm for AG codes. 1709-1712
- Helge Elbrønd Jensen, Rasmus Refslund Nielsen, Tom Høholdt:

Performance analysis of a decoding algorithm for algebraic-geometry codes. 1712-1717
- Gerhard Frey, Michael Müller, Hans-Georg Rück:

The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems. 1717-1719
- Alfredo De Santis, Barbara Masucci

:
Multiple ramp schemes. 1720-1728
- Lang P. Withers Jr.:

Some inequalities relating different measures of divergence between two probability distributions. 1728-1735
- Sam Efromovich:

How to overcome the curse of long-memory errors. 1735-1741
Volume 45, Number 6, September 1999
- Venkatesan Guruswami, Madhu Sudan:

Improved decoding of Reed-Solomon and algebraic-geometry codes. 1757-1767
- José Felipe Voloch

, Judy L. Walker:
Codes over rings from curves of higher genus. 1768-1776
- Razmik Karabed, Paul H. Siegel, Emina Soljanin

:
Constrained coding for binary channels with high intersymbol interference. 1777-1797
- Gregory Freiman, Simon Litsyn:

Asymptotically exact bounds on the size of high-order spectral-null codes. 1798-1807
- Alexei E. Ashikhmin, Iiro S. Honkala, Tero Laihonen

, Simon Litsyn:
On relations between covering radius and dual distance. 1808-1816
- Lihao Xu, Vasken Bohossian, Jehoshua Bruck

, David G. Wagner:
Low-density MDS codes and factors of complete graphs. 1817-1836
- Eric M. Rains:

Nonbinary quantum codes. 1827-1832
- Joachim Rosenthal

, Eric V. York:
BCH convolutional codes. 1833-1844
- Fred Daneshgaran, Marina Mondin

:
Design of interleavers for turbo codes: Iterative interleaver growth algorithms of polynomial complexity. 1845-1859
- Neri Merhav, Erdal Arikan:

The Shannon cipher system with a guessing wiretapper. 1860-1866
- En-Hui Yang, Zhen Zhang:

The shortest common superstring problem: Average case analysis for both exact and approximate matching. 1867-1886
- Michelle Effros:

Distortion-rate bounds for fixed- and variable-rate multiresolution source codes. 1887-1910
- John S. Baras, Subhrakanti Dey

:
Combined compression and classification with learning vector quantization. 1911-1920
- Alfred O. Hero III, Olivier J. J. Michel:

Asymptotic theory of greedy approximations to minimal k-point random graphs. 1921-1938
- Elias Masry:

Multivariate regression estimation of continuous-time processes from sampled data: Local polynomial fitting approach. 1939-1953
- Shidong Li:

Discrete multi-Gabor expansions. 1954-1967
- Pramod Viswanath, Venkat Anantharam, David N. C. Tse:

Optimal sequences, power control, and user capacity of synchronous CDMA systems with linear MMSE multiuser receivers. 1968-1983
- Pramod Viswanath, Venkat Anantharam:

Optimal sequences and sum capacity of synchronous CDMA systems. 1984-1991
- Naftali Chayat, Shlomo Shamai:

Bounds on the information rate of intertransition-time-restricted binary signaling over an AWGN channel. 1992-2006
- Giuseppe Caire, Shlomo Shamai:

On the capacity of some channels with channel state information. 2007-2019
- Michele Elia, Giorgio Taricco

, Emanuele Viterbo
:
Optimal energy transfer in band-limited communication channels. 2020-2029
- Upamanyu Madhow, Michael L. Honig:

On the average near-far resistance for MMSE detection of direct sequence CDMA signals with random spreading. 2039-2045
- Biao Chen, Peter K. Willett

:
The theoretical bandwidth advantage of CDMA over FDMA in a Gaussian MAC. 2046-2053
- Gerhard Kramer

:
Feedback strategies for a class of two-user multiple-access channels. 2054-2059
- Guang Gong, Solomon W. Golomb:

Hadamard transforms of three-term sequences. 2059-2060
- Habong Chung, Jong-Seon No:

Linear span of extended sequences and cascaded GMW sequences. 2060-2065
- Guang Gong, Solomon W. Golomb:

Transform domain analysis of DES. 2065-2073
- Simon R. Blackburn:

The linear complexity of the self-shrinking generator. 2073-2077
- Lusheng Chen, Fang-Wei Fu:

On the constructions of new resilient functions from old ones. 2077-2082
- Boris Ryabko, Andrei Fionov:

Efficient homophonic coding. 2083-2091
- Kaoru Kurosawa, Takuya Yoshida:

Strongly universal hashing and identification codes via channels. 2091-2095
- Nicholas Pippenger:

Entropy and enumeration of boolean functions. 2096-2100
- Nadav Shulman, Meir Feder:

Random coding techniques for nonrandom codes. 2101-2104
- Kevin Atteson:

The asymptotic redundancy of Bayes rules for Markov chains. 2104-2109
- András György

, Tamás Linder, Kenneth Zeger:
On the rate-distortion function of random vectors and stationary sources with mixed distributions. 2110-2115
- Nelson M. Blachman:

The distributions of local extrema of Gaussian noise and of its envelope. 2115-2121
- Tomohiko Uyematsu, Fumio Kanaya:

Channel simulation by interval algorithm: A performance analysis of interval algorithm. 2121-2129
- Han-Ping Tsai:

Extremal self-dual codes of lengths 66 and 68. 2129-2133
- Steven T. Dougherty, Masaaki Harada:

New extremal self-dual codes of length 68. 2133-2136
- David B. Jaffe, Juriaan Simonis:

New binary linear codes which are dual transforms of good codes. 2136-2137
- Jonas Olsson, Wolfgang Willems:

A characterization of certain Griesmer codes: MMD codes in a more general sense. 2138-2142
- Marten van Dijk

, Ludo M. G. M. Tolhuizen:
Efficient encoding for a class of subspace subcodes. 2142-2146
- Ana Salagean-Mandache

:
On the isometries between Zpk and Zkp. 2146-2148
- Parampalli Udaya

, Alexis Bonnecaze:
Decoding of cyclic codes over F2 + µF2. 2148-2157
- Hao Chen:

On minimum Lee weights of Hensel lifts of some binary BCH codes. 2157-2162
- Toru Aoki, Philippe Gaborit, Masaaki Harada, Michio Ozeki, Patrick Solé:

On the covering radius of Z4-codes and their lattices. 2162-2168
- Amir H. Banihashemi, Ian F. Blake:

On the trellis complexity of root lattices and their duals. 2168-2172
- Tuvi Etzion, Ari Trachtenberg, Alexander Vardy:

Which codes have cycle-free Tanner graphs? 2173-2181
- Alberto Jiménez Feltström, Kamil Sh. Zigangirov:

Time-varying periodic convolutional codes with low-density parity-check matrix. 2181-2191
- Sven Riedel, Christian Weiß:

The Golay convolutional code - Some application aspects. 2191-2199
- Suparna Datta, Steven W. McLaughlin:

An enumerative method for runlength-limited codes: permutation codes. 2199-2204
- Ezio Biglieri, John K. Karlof, Emanuele Viterbo

:
Representing group codes as permutation codes. 2204-2207
- C.-L. Chen:

On double-byte error-correcting codes. 2207-2208
- Gui Liang Feng, Xin-Wen Wu, T. R. N. Rao:

Correction to "New double-byte error-correcting codes for memory systems". 2209
- Bruce E. Hajek:

Information measures for discrete random fields. 2210-2211
Volume 45, Number 7, November 1999
- Hamid Krim, Dewey Tucker, Stéphane Mallat, David L. Donoho:

On denoising and best signal representation. 2225-2238
- Bernard C. Picinbono:

Polyspectra of ordered signals. 2239-2252
- Imre Csiszár, Fabrice Gamboa, Elisabeth Gassiat:

MEM pixel correlated solutions for generalized moment and interpolation problems. 2253-2270
- Yuhong Yang

:
Minimax nonparametric classification - Part I: Rates of convergence. 2271-2284
- Yuhong Yang

:
Minimax nonparametric classification - Part II: Model selection for adaptation. 2285-2292
- Ioannis Kontoyiannis:

An implementable lossy version of the Lempel-Ziv algorithm - Part I: Optimality for memoryless sources. 2293-2305
- Dong Sik Kim

, Ness B. Shroff:
Quantization based on a novel sample-adaptive product quantizer (SAPQ). 2306-2320
- Amos Lapidoth, Jacob Ziv:

On the decoding of convolutional codes on an unknown channel. 2321-2332
- Ilya Dumer

:
Sort-and-match algorithm for soft-decision decoding. 2333-2338
- Christoph Haslach, A. J. Han Vinck:

A decoding algorithm with restrictions for array codes. 2339-2344
- Steven T. Dougherty, Philippe Gaborit, Masaaki Harada, Akihiro Munemasa, Patrick Solé:

Type IV self-dual codes over rings. 2345-2360
- Eric M. Rains:

Quantum shadow enumerators. 2361-2366
- William S. Evans, Leonard J. Schulman

:
Signal propagation and noisy circuits. 2367-2373
- Jovan Dj. Golic:

Linear models for a time-variant permutation generator. 2374-2382
- Moshe Schwartz

, Tuvi Etzion:
The structure of single-track Gray codes. 2383-2396
- James A. Davis, Jonathan Jedwab:

Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes. 2397-2417
- Aradhana Narula, Mitchell D. Trott, Gregory W. Wornell:

Performance limits of coded diversity methods for transmitter antenna arrays. 2418-2433
- Jiangxin Chen, Urbashi Mitra:

Optimum near-far resistance for dual-rate DS/CDMA signals: Random signature sequence analysis. 2434-2447
- Vladimir P. Dragalin, Alexander G. Tartakovsky

, Venugopal V. Veeravalli:
Multihypothesis sequential probability ratio tests - Part I: Asymptotic optimality. 2448-2461
- Ramón Cáceres, Nick G. Duffield

, Joseph Horowitz, Donald F. Towsley
:
Multicast-based inference of network-internal loss characteristics. 2462-2480
- Andreas J. Winter

:
Coding theorem and strong converse for quantum channels. 2481-2485
- Tomohiro Ogawa, Hiroshi Nagaoka:

Strong converse to the quantum channel coding theorem. 2486-2489
- Eric M. Rains:

Monotonicity of the quantum linear programming bound. 2489-2492
- Andrew M. Steane:

Enlargement of Calderbank-Shor-Steane quantum codes. 2492-2495
- Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn:

On binary constructions of quantum codes. 2495-2498
- Chaoping Xing, Harald Niederreiter, Kwok-Yan Lam:

A generalization of algebraic-geometry codes. 2498-2501
- Ferruh Özbudak

, Henning Stichtenoth:
Constructing codes from algebraic curves. 2502-2505
- Oliver Pretzel:

Partial geometric codes. 2506-2512
- Ruud Pellikaan, Fernando Torres

:
On Weierstrass semigroups and the redundancy of improved geometric Goppa codes. 2512-2519
- T. Aaron Gulliver, Masaaki Harada:

Construction of optimal Type IV self-dual codes over F2+µF2. 2520-2521
- Marcus Greferath, Stefan E. Schmidt:

Gray isometries for finite chain rings and a nonlinear ternary (36, 312, 15) code. 2522-2524
- Marcus Greferath, Emanuele Viterbo

:
On Z4- and Z9-linear lifts of the Golay codes. 2524-2527
- Jacques Wolfmann:

Negacyclic and cyclic codes over Z4. 2527-2532
- Andrew Klapper:

Improved lower bounds for multicovering codes. 2532-2534
- Ernst M. Gabidulin, Torleiv Kløve:

On the Newton and covering radii of linear codes. 2534-2536
- Iiro S. Honkala, Tero Laihonen

:
The probability of undetected error can have several local maxima. 2537-2539
- Vassil Y. Yorgov:

On the minimal weight of some singly-even codes. 2539-2541
- Masaaki Harada:

New extremal self-dual codes of lengths 36 and 38. 2541-2543
- Stefan M. Dodunekov, Sugi Guritman, Juriaan Simonis:

Some new results on the minimum length of binary linear codes of dimension nine. 2543-2546
- C. L. Chen:

On a (145, 32) binary cyclic code. 2546-2547
- Alexander Barg, Shiyu Zhou:

Linear-time binary codes correcting localized erasures. 2547-2552
- Leonard J. Schulman

, David Zuckerman:
Asymptotically good codes correcting insertions, deletions, and transpositions. 2552-2557
- Li Ping

, Kwan Lawrence Yeung:
Symbol-by-symbol APP decoding of the Golay code and iterative decoding of concatenated Golay codes. 2558-2562
- Per Ståhl, John B. Anderson, Rolf Johannesson:

Optimal and near-optimal encoders for short and moderate-length tail-biting trellises. 2562-2571
- Michael Peleg

, Igal Sason, Shlomo Shamai, Avner Elia:
On interleaved, differentially encoded convolutional codes. 2572-2582
- Bartolomeu F. Uchôa Filho

, Mark A. Herro, Daniel J. Costello Jr.:
A multilevel approach to constructing trellis-matched codes for binary-input partial-response channels. 2582-2591
- Kees A. Schouhamer Immink, Augustus J. E. M. Janssen:

Error propagation assessment of enumerative coding schemes. 2591-2594
- Luca G. Tallini, Bella Bose:

On efficient high-order spectral-null codes. 2594-2601
- Guang Gong, Lein Harn:

Public-key cryptosystems based on cubic finite field extensions. 2601-2605
- Cunsheng Ding, Tor Helleseth, Kwok-Yan Lam:

Several classes of binary sequences with three-level autocorrelation. 2606-2612
- Boris Ryabko, Marina P. Sharova:

Fast coding of low-entropy sources. 2612-2615
- Mikael Skoglund:

On channel-constrained vector quantization and index assignment for discrete memoryless channels. 2615-2622
- Po-Ning Chen

, Fady Alajaji:
Optimistic Shannon coding theorems for arbitrary single-user systems. 2623-2629
- Ram Zamir:

Gaussian codes and Shannon bounds for multiple descriptions. 2629-2636
- Rudolf Ahlswede, Ning Cai:

Identification without randomization. 2636-2642
- László Györfi, Gábor Lugosi

, Gusztáv Morvai:
A simple randomized algorithm for sequential prediction of ergodic time series. 2642-2650
- L. Lorne Campbell:

Minimum cross-entropy estimation with inaccurate side information. 2650-2652
- Dimitry Taich, Israel Bar-David:

Maximum-likelihood estimation of phase and frequency of MPSK signals. 2652-2655
- Alberto Jiménez Feltström, Kamil Sh. Zigangirov:

On coherent reception of uplink transmitted signals in the DS-CDMA system. 2655-2661
- Da-Shan Shiu, Joseph M. Kahn:

Shaping and nonequiprobable signaling for intensity-modulated signals. 2661-2668
- Laura Rebollo-Neira, Juan Fernandez-Rubio:

On the inverse windowed Fourier transform. 2668-2671
- Harry Leib, Steven R. Weller:

Addendum and correction "Optimal phases for a family of quadriphase CDMA sequences". 2672-2673

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.

Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID
















