By Topic

IEEE Transactions on Information Theory

Issue 6 • Date Nov. 1994

Filter Results

Displaying Results 1 - 25 of 40
  • Rotationally invariant nonlinear trellis codes for two-dimensional modulation

    Publication Year: 1994, Page(s):1773 - 1791
    Cited by:  Papers (12)  |  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1616 KB)

    A general parity-check equation is presented that defines rotationally invariant trellis codes of rate k/(k+1) for two-dimensional signal sets. This parity-check equation is used to find rate k/(k+1) codes for 4PSK, 8PSK, 16PSK, and QAM signal sets by systematic code searches. The MPSK codes exhibit smaller free Euclidean distances than nonrotationally invariant linear codes with the same number o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Erasure-free sequential decoding of trellis codes

    Publication Year: 1994, Page(s):1803 - 1817
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1418 KB)

    An erasure-free sequential decoding algorithm for trellis codes, called the buffer looking algorithm (BLA), is introduced. Several versions of the algorithm can be obtained by choosing certain parameters and selecting a resynchronization scheme. These can be categorized as block decoding or continuous decoding, depending on the resynchronization scheme. Block decoding is guaranteed to resynchroniz... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variable-rate source coding theorems for stationary nonergodic sources

    Publication Year: 1994, Page(s):1920 - 1925
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (412 KB)

    For a stationary ergodic source, the source coding theorem and its converse imply that the optimal performance theoretically achievable by a fixed-rate or variable-rate block quantizer is equal to the distortion-rate function, which is defined as the infimum of an expected distortion subject to a mutual information constraint. For a stationary nonergodic source, however, the. Distortion-rate funct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Variance of a generalized polarity-coincidence spectral-centroid estimator for Gaussian processes

    Publication Year: 1994, Page(s):2045 - 2048
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (432 KB)

    The polarity coincidence estimator of the spectral centroid counts the net number of times the phasor of a stationary Gaussian process crosses a chosen phase-reference straight line through the origin during a time T. By following Pawula's (1968) approach, the covariance of two different simultaneous polarity-coincidence estimates having distinct phase reference lines is derived. This basic result... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the generalized Hamming weights of geometric Goppa codes

    Publication Year: 1994, Page(s):2092 - 2099
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    We study the generalized Hamming weights of geometric Goppa codes, giving a translation of these weights into arithmetical terms, concerning the arithmetic of the curve used to construct the code. We derive some results and bounds that we apply to some known codes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized DFT for Abelian codes over Zm

    Publication Year: 1994, Page(s):2082 - 2090
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    A generalized discrete Fourier transform defined over an appropriate extension ring is given that is suitable to characterize Abelian codes over residue class integer rings Zm. The characterization is in terms of generalized discrete Fourier transform components taking values from certain ideals of the extension ring. It is shown that the results known for cyclic codes over Z... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rate-distortion function when side-information may be present at the decoder

    Publication Year: 1994, Page(s):2031 - 2034
    Cited by:  Papers (54)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    A discrete memoryless source {Xk} is to be coded into a binary stream of rate R bits/symbol such that {Xk} can be recovered with minimum possible distortion. The system is to be optimized for best performance with two decoders, one of which has access to side-information about the source. For given levels of average distortion for these two decoders, the minimum achievable ra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Construction of fixed-length insertion/deletion correcting runlength-limited codes

    Publication Year: 1994, Page(s):1841 - 1856
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1220 KB)

    An algorithm is presented for the construction of fixed-length insertion/deletion correcting runlength-limited (RLL) codes. In this construction binary (d,k)-constrained codewords are generated by codewords of a q-ary Lee metric based code. It is shown that this new construction always yields better codes than known constructions. The use of a q-ary Lee (1987) metric code (q odd) is based on the a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On communication complexity of vector-valued functions

    Publication Year: 1994, Page(s):2062 - 2067
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    New upper and lower bounds on the two-way communication complexity of abstract functions g:ℋ×𝒴→𝒵 give tight bounds, when applied to vector-valued functions fn(f1 ,...,fn):ℋu×𝒴n →𝒵n, if the alphabets are small. For the set-intersection function, an optimal protocol is presented. It ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weight distributions of some binary primitive cyclic codes

    Publication Year: 1994, Page(s):2068 - 2071
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    Let s and k be integers such that s is a divisor of 2k-1. Let g(x) be a divisor of xs-1 over F2 , and let π(x) be a primitive polynomial of degree k over F2. We consider the binary cyclic code C of length N=2k -1 generated by (XN-1)/g(x)π(x). For special cases, we determine the weight distribution of C by using the weights of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Superimposed codes in the Hamming space

    Publication Year: 1994, Page(s):1882 - 1893
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    We consider the problem of simultaneous identification and transmission of information by means of superimposed codes. It is assumed that a total population of T users share a common channel. At each time at most in of the T users are active. The output from the channel is the modulo-2 sum of the binary codewords transmitted by the active users, possibly disturbed by errors. A superimposed code is... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding

    Publication Year: 1994, Page(s):1728 - 1740
    Cited by:  Papers (47)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1040 KB)

    Rate of convergence results are established for vector quantization. Convergence rates are given for an increasing vector dimension and/or an increasing training set size. In particular, the following results are shown for memoryless real-valued sources with bounded support at transmission rate R. (1) If a vector quantizer with fixed dimension k is designed to minimize the empirical mean-square er... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal coding for the Slepian-Wolf data compression system and the strong converse theorem

    Publication Year: 1994, Page(s):1908 - 1919
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    Universal coding for the Slepian-Wolf (1973) data compression system is considered. We shall demonstrate based on a simple observation that the error exponent given by Csiszar and Korner (1980) for the universal coding system can strictly be sharpened in general for a region of relatively higher rates. This kind of observation can be carried over also to the case of lower rates outside the Slepian... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Upper bounds on generalized distances

    Publication Year: 1994, Page(s):2090 - 2092
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    We derive new asymptotic bounds for generalized distances. Our approach extends the classical Hamming, Plotkin, and Elias bounds. The latter bound involves extending the definition of generalized distances to nonlinear codes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A communication channel modeled on contagion

    Publication Year: 1994, Page(s):2035 - 2041
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    We introduce a binary additive communication channel with memory. The noise process of the channel is generated according to the contagion model of G. Polya (1923); our motivation is the empirical observation of Stapper et al. (1980) that defects in semiconductor memories are well described by distributions derived from Polya's urn scheme. The resulting channel is stationary but not ergodic, and i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A sequential procedure for multihypothesis testing

    Publication Year: 1994, Page(s):1994 - 2007
    Cited by:  Papers (75)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (972 KB)

    The sequential testing of more than two hypotheses has important applications in direct-sequence spread spectrum signal acquisition, multiple-resolution-element radar, and other areas. A useful sequential test which we term the MSPRT is studied in this paper. The test is shown to be a generalization of the sequential probability ratio test. Under Bayesian assumptions, it is argued that the MSPRT a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A mapping approach to rate-distortion computation and analysis

    Publication Year: 1994, Page(s):1939 - 1952
    Cited by:  Papers (40)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1136 KB)

    In rate-distortion theory, results are often derived and stated in terms of the optimizing density over the reproduction space. In this paper, the problem is reformulated in terms of the optimal mapping from the unit interval with Lebesgue measure that would induce the desired reproduction probability density. This results in optimality conditions that are “random relatives” of the kno... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An upper bound on the volume of discrete spheres

    Publication Year: 1994, Page(s):2071 - 2073
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (260 KB)

    Finite-length sequences over a finite alphabet with weights are considered. An information-theoretic upper bound on the number of such sequences whose weight does not exceed some given threshold is presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic results on codes for symmetric, unidirectional, and asymmetric error control

    Publication Year: 1994, Page(s):2073 - 2075
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    The asymptotic behavior of the rates of optimal codes correcting and/or detecting combinations of symmetric, unidirectional, and/or asymmetric errors is studied. These rates are expressed in terms of the rate of optimal codes,,with a certain Hamming distance. As a consequence, well-known bounds on the latter rate can also be applied to bound the former rates. Furthermore, it turns out that, withou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dimension/length profiles and trellis complexity of linear block codes

    Publication Year: 1994, Page(s):1741 - 1752
    Cited by:  Papers (116)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    This semi-tutorial paper discusses the connections between the dimension/length profile (DLP) of a linear code, which is essentially the same as its “generalized Hamming weight hierarchy”, and the complexity of its minimal trellis diagram. These connections are close and deep. DLP duality is closely related to trellis duality. The DLP of a code gives tight bounds on its state and branc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Density/length profiles and trellis complexity of lattices

    Publication Year: 1994, Page(s):1753 - 1772
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1492 KB)

    The density/length profile (DCP) of a lattice Λ is analogous to the dimension/length profile of a linear code. The DLP is a geometrical invariant of Λ that includes the coding gain of Λ. Duality results analogous to those of linear block codes are derived for lattices. Bounds on the DLP may be derived from bounds on Hermite's constants; these hold with equality for many dense ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic bounds on optimal noisy channel quantization via random coding

    Publication Year: 1994, Page(s):1926 - 1938
    Cited by:  Papers (31)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (980 KB)

    Asymptotically optimal zero-delay vector quantization in the presence of channel noise is studied using random coding techniques. First, an upper bound is derived for the average rth-power distortion of channel optimized k-dimensional vector quantization at transmission rate R on a binary symmetric channel with bit error probability ε. The upper bound asymptotically equals 2-rRg(ε,k... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Intersecting codes and independent families

    Publication Year: 1994, Page(s):1872 - 1881
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    A binary intersecting code is a linear code with the property that any two nonzero codewords have intersecting supports. These codes appear in a wide variety of contexts and applications, e.g., multiple access, cryptography, and information theory. This paper is devoted partly to the study of intersecting codes, and partly to their use in constructing large t-independent families of binary vectors... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The MacWilliams-Sloane conjecture on the tightness of the Carlitz-Uchiyama bound and the weights of duals of BCH codes

    Publication Year: 1994, Page(s):1894 - 1907
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    Research Problem 9.5 of MacWilliams and Sloane's book, The Theory of Error Correcting Codes (Amsterdam: North-Holland, 1977), asks for an improvement of the minimum distance bound of the duals of BCH codes, defined over F2m with m odd. The objective of the present article is to give a solution to the above problem by with (i) obtaining an improvement to the Ax (1964) theorem, which we p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the asymptotic tightness of the Shannon lower bound

    Publication Year: 1994, Page(s):2026 - 2031
    Cited by:  Papers (52)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    New results are proved on the convergence of the Shannon (1959) lower bound to the rate distortion function as the distortion decreases to zero. The key convergence result is proved using a fundamental property of informational divergence. As a corollary, it is shown that the Shannon lower bound is asymptotically tight for norm-based distortions, when the source vector has a finite differential en... 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