Scheduled System Maintenance
On Tuesday, December 18, IEEE Xplore will undergo scheduled maintenance from 1:00-5:00 PM ET
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

IEEE Transactions on Information Theory

Volume 42 Issue 5 • Sept. 1996

Filter Results

Displaying Results 1 - 25 of 44
  • Source coding and graph entropies

    Publication Year: 1996, Page(s):1329 - 1339
    Cited by:  Papers (83)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (901 KB)

    A sender wants to accurately convey information to a receiver who has some, possibly related, data. We study the expected number of bits the sender must transmit for one and for multiple instances in two communication scenarios and relate this number to the chromatic and Korner (1973) entropies of a naturally defined graph. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Information rates of pre/post-filtered dithered quantizers

    Publication Year: 1996, Page(s):1340 - 1353
    Cited by:  Papers (63)  |  Patents (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1323 KB)

    We consider encoding of a source with pre-specified second-order statistics, but otherwise arbitrary, by entropy-coded dithered (lattice) quantization (ECDQ) incorporating linear pre- and post-filters. In the design and analysis of this scheme we utilize the equivalent additive-noise channel model of the ECDQ. For Gaussian sources and a square error distortion measure, the coding performance of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical universal coding

    Publication Year: 1996, Page(s):1354 - 1364
    Cited by:  Papers (22)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1095 KB)

    In an earlier paper, we proved a strong version of the redundancy-capacity converse theorem of universal coding, stating that for "most" sources in a given class, the universal coding redundancy is essentially lower-bounded by the capacity of the channel induced by this class. Since this result holds for general classes of sources, it extends Rissanen's (1986) strong converse theorem for parametri... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient scalar quantization of exponential and Laplacian random variables

    Publication Year: 1996, Page(s):1365 - 1374
    Cited by:  Papers (111)  |  Patents (31)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1105 KB)

    This paper presents solutions to the entropy-constrained scalar quantizer (ECSQ) design problem for two sources commonly encountered in image and speech compression applications: sources having the exponential and Laplacian probability density functions. We use the memoryless property of the exponential distribution to develop a new noniterative algorithm for obtaining the optimal quantizer design... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Match-length functions for data compression

    Publication Year: 1996, Page(s):1375 - 1380
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    We investigate uniquely decodable match-length functions (MLFs) in conjunction with Lempel-Ziv (1977) type data compression. An MLF of a data string is a function that associates a nonnegative integer with each position of the string. The MLF is used to parse the input string into phrases. The codeword for each phrase consists of a pointer to the beginning of a maximal match consistent with the ML... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • First-order approximation of the ordered binary-symmetric channel

    Publication Year: 1996, Page(s):1381 - 1387
    Cited by:  Papers (12)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (584 KB)

    Soft-decision decoding algorithms of binary linear block codes require reordering of the received symbols within each block in decreasing reliability. Efficient decoding algorithms based on reordering have been devised. This paper presents different results related to the ordering of a sequence of N received symbols with respect to their reliability measure, for BPSK transmission over the AWGN cha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The intersymbol interference channel: lower bounds on capacity and channel precoding loss

    Publication Year: 1996, Page(s):1388 - 1404
    Cited by:  Papers (81)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1592 KB)

    The discrete-time additive Gaussian intersymbol interference (ISI) channel with i.i.d. (not necessarily Gaussian) input signals is considered. Several new and old lower bounds on the capacity are derived in a unified manner by assuming different front-end receiver filters, in particular the sampled whitened matched filter (SWMF) and the minimum mean-squared error-decision feedback equalizer (MMSE-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constrained block codes for class-IV partial-response channels with maximum-likelihood sequence estimation

    Publication Year: 1996, Page(s):1405 - 1424
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1881 KB)

    Significant improvements in magnetic storage densities have been made feasible by the application of partial-response signaling combined with maximum-likelihood sequence estimation. To enhance the performance of this technique when applied to the class-IV partial-response channel, which is recognized as being appropriate to model the magnetic recording channel, it is often required to bound the nu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recovering band-limited signals under noise

    Publication Year: 1996, Page(s):1425 - 1438
    Cited by:  Papers (20)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1081 KB)

    We consider the problem of recovering a band-limited signal f(t) from noisy data yk=f(k/spl tau/)+/spl Gt/epsilon//sub k/, where /spl tau/ is the sampling rate. Starting from the truncated Whittaker-Shannon cardinal expansion with or without sampling windows (both cases yield inconsistent estimates of f(t)) we propose estimators that are convergent to f(t) in the pointwise and uniform sense. The b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mismatched decoding and the multiple-access channel

    Publication Year: 1996, Page(s):1439 - 1452
    Cited by:  Papers (45)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1229 KB)

    An achievable region is derived for the multiple-access channel under decoding mismatch conditions. It is shown that achievable rates higher than the random coding capacity of the single-user mismatched channel can sometimes be demonstrated by treating the single-user channel as a multiple-access channel. Refining these ideas we derive a lower bound on the capacity of the mismatched single-user ch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The total capacity of two-user multiple-access channel with binary output

    Publication Year: 1996, Page(s):1453 - 1465
    Cited by:  Papers (9)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (977 KB)

    The total capacity is evaluated for an arbitrary two-user multiple-access channel (MAC) with a binary output. The basic idea is to subdivide the MAC into a finite number of elementary MACs, i.e., a two-user MAC with binary inputs and binary outputs. These elementary MACs are classified further into two cases by the type of channel matrix. For each case, a necessary and sufficient condition of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Crosspoint complexity of sparse crossbar concentrators

    Publication Year: 1996, Page(s):1466 - 1471
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (985 KB)

    A sparse crossbar (n,m,c)-concentrator is a bipartite graph with n inputs and m outputs in which any c or fewer inputs can be matched with an equal number of outputs, where c is called its capacity. We present a number of new results on the crosspoint complexity of such concentrators. First, we describe a sparse crossbar (n, m, m)-concentrator whose crosspoint complexity matches Nakamura-Masson's ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method for constructing decodable de Bruijn sequences

    Publication Year: 1996, Page(s):1472 - 1478
    Cited by:  Papers (18)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (738 KB)

    We present two related methods of construction for de Bruijn (1946) sequences, both based on interleaving "smaller" de Bruijn sequences. Sequences obtained using these construction methods have the advantage that they can be "decoded" very efficiently, i.e., the position within the sequence of any particular "window" can be found very simply. Sequences with simple decoding algorithms are of consid... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sample complexity for learning recurrent perceptron mappings

    Publication Year: 1996, Page(s):1479 - 1487
    Cited by:  Papers (19)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (953 KB)

    Recurrent perceptron classifiers generalize the usual perceptron model. They correspond to linear transformations of input vectors obtained by means of "autoregressive moving-average schemes", or infinite impulse response filters, and take into account those correlations and dependences among input coordinates which arise from linear digital filtering. This paper provides tight bounds on the sampl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The optimal error exponent for Markov order estimation

    Publication Year: 1996, Page(s):1488 - 1497
    Cited by:  Papers (17)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (860 KB)

    We consider the problem of estimating the order of a stationary ergodic Markov chain. Our focus is on estimators which satisfy a generalized Neyman-Pearson criterion of optimality. Specifically, the optimal estimator minimizes the probability of underestimation among all estimators with probability of overestimation not exceeding a given value. Our main result identifies the best exponent of asymp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A geometric construction procedure for geometrically uniform trellis codes

    Publication Year: 1996, Page(s):1498 - 1513
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1500 KB)

    The problem of maximizing the minimum free squared Euclidean distance of a trellis code is developed from a geometric point of view. This approach provides a new way of constructing constellations for trellis coding. A decomposition of the trellis topology leads to a systematic construction of signal sets and generators for geometrically uniform trellis codes. An algorithm is proposed to construct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Context weighting for general finite-context sources

    Publication Year: 1996, Page(s):1514 - 1520
    Cited by:  Papers (26)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (697 KB)

    Context weighting procedures are presented for sources with models (structures) in four different classes. Although the procedures are designed for universal data compression purposes, their generality allows application in the area of classification. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nearest neighbor decoding for additive non-Gaussian noise channels

    Publication Year: 1996, Page(s):1520 - 1529
    Cited by:  Papers (131)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1082 KB)

    We study the performance of a transmission scheme employing random Gaussian codebooks and nearest neighbor decoding over a power limited additive non-Gaussian noise channel. We show that the achievable rates depend on the noise distribution only via its power and thus coincide with the capacity region of a white Gaussian noise channel with signal and noise power equal to those of the original chan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the relative entropy of discrete-time Markov processes with given end-point densities

    Publication Year: 1996, Page(s):1529 - 1535
    Cited by:  Papers (11)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (727 KB)

    Given a Markov process x(k) defined over a finite interval I=[0,N], I/spl sub/Z we construct a process x*(k) with the same initial density as x, but a different end-point density, which minimizes the relative entropy of x and x*. It is shown that x* is a Markov process in the same reciprocal class as x. In the Gaussian case, the minimum relative entropy problem is related to a minimum energy LQG o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some inequalities for channel capacities, mutual informations and mean-squared errors

    Publication Year: 1996, Page(s):1536 - 1540
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (466 KB)

    We derive some information-theoretic inequalities to evaluate the channel capacity and mean-squared error. We prove an inequality for the capacity of an additive-noise channel with feedback. We also prove an inequality for mutual information and mean-squared error. The inequality is applied to bound minimum mean-squared transmission errors. The results for the channel capacity and the mean-squared... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generation of discrete distributions from biased coins

    Publication Year: 1996, Page(s):1541 - 1546
    Cited by:  Papers (11)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (665 KB)

    The procedure of Knuth and Yao (1976) to simulate random numbers with specified distribution by parsing sequences of fair coin tosses is generalized to employ discrete distributions of particular form instead of fair coins. Each probability in these distributions is an integral power of some fixed value t. The parse tree for the simulation procedure is closely related to the code trees arising in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity of channels with redundant multitrack (d,k) constraints: the k<d case

    Publication Year: 1996, Page(s):1546 - 1548
    Cited by:  Papers (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    Run-length-limited or (d,k) recording codes are widely used in digital storage systems with peak detection. The channel capacities of the redundant multitrack (d,k) constraint are calculated and tabulated for k<d. The channel capacities table completes the table obtained by Orcutt and Marcellin (see ibid., vol.39, no.5, p.1744, 1993), who considered the k/spl ges/d case. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On weak convergence of probability measures, channel capacity and code error probabilities

    Publication Year: 1996, Page(s):1549 - 1551
    Cited by:  Papers (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (353 KB)

    The relationship between weak convergence of channel probability measures, channel capacity, and error probability of block codes is examined for memoryless channels with general input and output alphabets. It is shown that channel capacity is a lower semi-continuous function and that every block code with maximal probability of error /spl delta/ for a nominal channel for any /spl epsiv/>0 can ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A rate 4/6 (d=1, k=11) block-decodable runlength-limited code

    Publication Year: 1996, Page(s):1551 - 1553
    Cited by:  Patents (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (374 KB)

    A new rate 4/6 (d=1, k'=11) runlength-limited code which is well adapted to byte-oriented storage systems is presented. The new code has the virtue that it can be decoded on a block basis, i.e., without knowledge of previous or next codewords, and, therefore, it does not suffer from error propagation. This code is particularly attractive as many commercially available Reed-Solomon codes operate in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Encoding of dklr-sequences using one weight set

    Publication Year: 1996, Page(s):1553 - 1554
    Cited by:  Papers (12)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (259 KB)

    Traditional schemes for encoding and decoding runlength-constrained sequences using the enumeration principle require two sets of weighting coefficients. A new enumeration is presented requiring only one set of coefficients. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

IEEE Transactions on Information Theory publishes papers concerned with the transmission, processing, and utilization of information.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Alexander Barg

Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland

email: abarg-ittrans@ece.umd.edu