By Topic

IEEE Transactions on Information Theory

Issue 5 • Date Sept. 1996

Filter Results

Displaying Results 1 - 25 of 44
  • A geometric construction procedure for geometrically uniform trellis codes

    Publication Year: 1996, Page(s):1498 - 1513
    Cited by:  Papers (1)
    Request permission for commercial 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.
  • Two-Dimensional Imaging [Book Reviews]

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (234 KB)
    Freely Available from IEEE
  • Contributors

    Publication Year: 1996
    Request permission for commercial reuse | PDF file iconPDF (527 KB)
    Freely Available from IEEE
  • The total capacity of two-user multiple-access channel with binary output

    Publication Year: 1996, Page(s):1453 - 1465
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 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.
  • Source coding and graph entropies

    Publication Year: 1996, Page(s):1329 - 1339
    Cited by:  Papers (66)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 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.
  • Sample complexity for learning recurrent perceptron mappings

    Publication Year: 1996, Page(s):1479 - 1487
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (804 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 ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reed-Muller codes for error detection: the good, the bad, and the ugly

    Publication Year: 1996, Page(s):1615 - 1622
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (420 KB)

    The error detecting capability of Reed-Muller codes is analyzed. If a block code is used for error detection only, then an error is undetectable if it transforms a codeword into another codeword. The probability of undetected error for a binary [n,k] code C used on a binary-symmetric channel with crossover probability p, is given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the weight hierarchy of Kerdock codes over Z4

    Publication Year: 1996, Page(s):1587 - 1593
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    The rth generalized Hamming weight dr of the Kerdock code of length 2m over Z4 is considered. A lower bound on dr is derived for any r, and dr is exactly determined for r=0.5, 1, 1.5, 2, 2.5. In the case of length 2 2m, dr is determined for any r, where 0⩽r⩽m and 2r is an integer. In addition, it is shown that it ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Upper bounds on the minimum distance of spherical codes

    Publication Year: 1996, Page(s):1576 - 1581
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    We use linear programming techniques to obtain new upper bounds on the maximal squared minimum distance of spherical codes with fixed cardinality. Functions Qj(n,s) are introduced with the property that Qj(n,s)<0 for some j>m if and only if the Levenshtein bound Lm(n,s) on A(n,s)=max{|W|:W is an (n,|W|,s) code} can be improved by a polynomial of degree at lea... 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 (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 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.
  • Codes spanned by quadratic and Hermitian forms

    Publication Year: 1996, Page(s):1600 - 1604
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB)

    We study the parameters of codes spanned by quadratic and Hermitian forms in projective space. The resulting codes have high minimum distance and few distinct weights. An example is a new ternary [91.9,54] code View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New ternary and quaternary linear block codes

    Publication Year: 1996, Page(s):1625 - 1628
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    We present several new ternary and quaternary codes found with a heuristic search procedure, originally proposed by the authors to find good binary codes, and which is based on combinatorial optimization 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 (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 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.
  • On the relative entropy of discrete-time Markov processes with given end-point densities

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

    Given a Markov process x(k) defined over a finite interval I=[0,N], I⊂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 ... 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 (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1580 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.
  • Single-track Gray codes

    Publication Year: 1996, Page(s):1555 - 1561
    Cited by:  Papers (12)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    A particular class of Gray codes, called single-track Gray codes, is introduced. These codes have advantages over conventional Gray codes in certain practical applications. A simple construction for single-track Gray codes is given and it is shown how to obtain such codes for a large range of parameters of practical interest 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 (60)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1128 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.
  • The intersymbol interference channel: lower bounds on capacity and channel precoding loss

    Publication Year: 1996, Page(s):1388 - 1404
    Cited by:  Papers (74)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1368 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.
  • Encoding of dklr-sequences using one weight set

    Publication Year: 1996, Page(s):1553 - 1554
    Cited by:  Papers (12)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 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.
  • 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 commercial reuse | Click to expandAbstract | PDF file iconPDF (276 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⩾d case 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 (101)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 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.
  • Non-BCH triple-error-correcting codes

    Publication Year: 1996, Page(s):1612 - 1614
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (212 KB)

    We determine the weight distribution of the dual codes of a class of non-BCH triple-error-correcting codes. Our result implies that the codes from this class have the same weight distribution as the triple-error-correcting BCH codes. We also consider binary cyclic codes 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 (84)  |  Patents (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (948 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.
  • Cyclic codes and quadratic residue codes over Z4

    Publication Year: 1996, Page(s):1594 - 1600
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    A set of n-tuples over Z4 is called a code over Z4 or a Z4 code if it is a Z4 module. We prove that any Z4-cyclic code C has generators of the form (fh, 2fg) where fgh=xn-1 over Z4 and |C|=4deg g 2deg h. We also show that C has generators of the form (g*h*, 2f... 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 (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 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 δ for a nominal channel for any ε>0 can be modifi... 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
Frank R. Kschischang

Department of Electrical and Computer Engineering