IEEE Transactions on Information Theory

Issue 5 • 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 (2)
    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
  • Codes spanned by quadratic and Hermitian forms

    Publication Year: 1996, Page(s):1600 - 1604
    Cited by:  Papers (1)
    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.
  • Recovering band-limited signals under noise

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

    We consider the problem of recovering a band-limited signal f(t) from noisy data yk=f(kτ)+≫epsilon/k, where τ 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 basic id... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on bounds for q-ary covering codes

    Publication Year: 1996, Page(s):1640 - 1642
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (196 KB)

    Two strongly seminormal codes over Z5 are constructed to prove a conjecture of Ostergard (see ibid., vol.37, no.3, p.660-4, 1991). It is shown that a result of Honkala (see ibid., vol.37, no.4, p.1203-6, 1991) on (k,t)-subnormal codes holds also under weaker assumptions. A lower bound and an upper bound on Kq(n, R), the minimal cardinality of a q-ary code of length n with cov... 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 (83)
    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.
  • 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 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.
  • On the probability of error of convolutional codes

    Publication Year: 1996, Page(s):1562 - 1568
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (620 KB)

    New upper and lower bounds and approximations on the sequence, event, first event, and bit-error probabilities of convolutional codes are presented. Each of these probabilities are precisely defined and the relationship between them described. Some of the new bounds and approximations are found to be very close to computer simulations at very high error ratios. Simple modifications to the traditio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The weight distribution of the third-order Reed-Muller code of length 512

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

    A method for computing the weight distribution of the third-order Reed-Muller code of length 512 is presented. Linear block codes are also examined View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the weight hierarchy of generalized concatenated codes

    Publication Year: 1996, Page(s):1635 - 1640
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (536 KB)

    We determine upper and lower bounds to the generalized Hamming weights of generalized concatenated codes. They are derived from the generalized Hamming weights of the outer codes and certain properties of the inner code and its partitions 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 (18)
    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.
  • On the weight hierarchy of Kerdock codes over Z4

    Publication Year: 1996, Page(s):1587 - 1593
    Cited by:  Papers (23)
    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.
  • Some inequalities for channel capacities, mutual informations and mean-squared errors

    Publication Year: 1996, Page(s):1536 - 1540
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (384 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.
  • The intersymbol interference channel: lower bounds on capacity and channel precoding loss

    Publication Year: 1996, Page(s):1388 - 1404
    Cited by:  Papers (80)  |  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.
  • Single-track Gray codes

    Publication Year: 1996, Page(s):1555 - 1561
    Cited by:  Papers (14)  |  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.
  • Nearest neighbor decoding for additive non-Gaussian noise channels

    Publication Year: 1996, Page(s):1520 - 1529
    Cited by:  Papers (122)
    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.
  • Reed-Muller codes for error detection: the good, the bad, and the ugly

    Publication Year: 1996, Page(s):1615 - 1622
    Cited by:  Papers (10)
    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.
  • Crosspoint complexity of sparse crossbar concentrators

    Publication Year: 1996, Page(s):1466 - 1471
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (892 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.
  • On the minimum distance of a q-ary image of a qm-ary cyclic code

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

    We discuss a lower bound on the minimum distance of a q-ary image of qm-ary cyclic code, based on its concatenated structure due to Jensen (see ibid., vol.31, no.6, p.788-93, 1985) and Seguin (see ibid., vol.41, no.2, p.387-99, 1995). An explicit estimate for the minimum distance of the outer codes, which is analogous to the BCH bound, is derived. Complete lists of the values obtained f... 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 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.
  • 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 commercial reuse | Click to expandAbstract |PDF file iconPDF (308 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.
  • Information rates of pre/post-filtered dithered quantizers

    Publication Year: 1996, Page(s):1340 - 1353
    Cited by:  Papers (62)  |  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.
  • On the search for good aperiodic binary invertible sequences

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

    For an aperiodic invertible sequence of length L, the optimality criterion is chosen to be the minimum noise enhancement factor of the corresponding aperiodic inverse filter. The noise enhancement factor is defined as the ratio of the noise energies at the outputs of the aperiodic inverse and the normalized matched filters of the sequence due to white noise at the filter inputs. Optimal binary seq... 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 (38)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1048 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.

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
Prakash Narayan 

Department of Electrical and Computer Engineering