IEEE Transactions on Information Theory

Volume 42 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
  • 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.
  • 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.
  • 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.
  • Efficient scalar quantization of exponential and Laplacian random variables

    Publication Year: 1996, Page(s):1365 - 1374
    Cited by:  Papers (104)  |  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.
  • 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.
  • Non-BCH triple-error-correcting codes

    Publication Year: 1996, Page(s):1612 - 1614
    Cited by:  Papers (2)
    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.
  • Sample complexity for learning recurrent perceptron mappings

    Publication Year: 1996, Page(s):1479 - 1487
    Cited by:  Papers (19)
    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.
  • 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.
  • Context weighting for general finite-context sources

    Publication Year: 1996, Page(s):1514 - 1520
    Cited by:  Papers (25)
    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.
  • 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.
  • 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.
  • 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.
  • A method for constructing decodable de Bruijn sequences

    Publication Year: 1996, Page(s):1472 - 1478
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 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 simp... 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 (4)
    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 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.
  • First-order approximation of the ordered binary-symmetric channel

    Publication Year: 1996, Page(s):1381 - 1387
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 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.
  • 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.
  • 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.
  • Generation of discrete distributions from biased coins

    Publication Year: 1996, Page(s):1541 - 1546
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 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.
  • 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 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.
  • 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.

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