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
  • Hierarchical universal coding

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

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The finest homophonic partition and related code concepts

    Publication Year: 1996, Page(s):1569 - 1575
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    Let C be a finite set of n words having total length L where all words are taken over a R-element alphabet. The set C is called numerically decipherable if any two factorizations of the same word over the given alphabet into words in C have the same length. An O(nL2 ) time and O((n+k)L) space algorithm is presented for computing the finest homophonic partition of C provided that this se... 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.
  • 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.
  • Information rates of pre/post-filtered dithered quantizers

    Publication Year: 1996, Page(s):1340 - 1353
    Cited by:  Papers (61)  |  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 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 existence of certain extremal [54,27,10] self-dual codes

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

    Some new extremal binary [54,27,10] self-dual codes are constructed using automorphisms of order 7 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 (78)
    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.
  • Context weighting for general finite-context sources

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

    Publication Year: 1996, Page(s):1329 - 1339
    Cited by:  Papers (79)
    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.
  • On the relative entropy of discrete-time Markov processes with given end-point densities

    Publication Year: 1996, Page(s):1529 - 1535
    Cited by:  Papers (8)
    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.
  • 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.
  • New ternary and quaternary linear block codes

    Publication Year: 1996, Page(s):1625 - 1628
    Cited by:  Papers (1)
    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.
  • 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.
  • On the weight hierarchy of Kerdock codes over Z4

    Publication Year: 1996, Page(s):1587 - 1593
    Cited by:  Papers (22)
    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.
  • 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.
  • 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.
  • The intersymbol interference channel: lower bounds on capacity and channel precoding loss

    Publication Year: 1996, Page(s):1388 - 1404
    Cited by:  Papers (79)  |  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.
  • 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 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.
  • Efficient scalar quantization of exponential and Laplacian random variables

    Publication Year: 1996, Page(s):1365 - 1374
    Cited by:  Papers (101)  |  Patents (31)
    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.
  • 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.

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