Scheduled System Maintenance
On Tuesday, September 26, IEEE Xplore will undergo scheduled maintenance from 1:00-4:00 PM ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

IEEE Transactions on Information Theory

Issue 1 • Jan 1994

Filter Results

Displaying Results 1 - 25 of 41
  • Estimation of the autocorrelation function of complex Gaussian stationary processes by amplitude clipped signals

    Publication Year: 1994, Page(s):239 - 245
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    The normalized autocorrelation function of a Gaussian process may be recovered from second order moments of their polarity, through the arcsin law. By analogy, it is possible to calculate the normalized autocorrelation function of a circularly complex Gaussian process from the knowledge of moments of its instantaneous phase. In the present paper, two estimators of the normalized autocorrelation fu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The normalized second moment of the binary lattice determined by a convolutional code

    Publication Year: 1994, Page(s):166 - 174
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    Calculates the per-dimension mean squared error μ(S) of the two-state convolutional code C with generator matrix [1,1+D], for the symmetric binary source S=(0,1), and for the uniform source S={0,1}. When S=(0,1), the quantity μ(S) is the second moment of the coset weight distribution, which gives the expected Hamming distance of a random binary sequence from the code. When S={0,1}, the quant... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic normality of some Hermitian forms with complex noisy data

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

    Hermitian forms with complex random data arise in some areas of physics when one studies the effect of the noise in some frequency interval. In this context, a central-limit theorem is proved for independent Gaussian variables in the complex plane. The non-Gaussian case is also studied and the same result holds provided that the fourth-order moments are bounded View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The weight hierarchy of higher dimensional Hermitian codes

    Publication Year: 1994, Page(s):275 - 278
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    Studies a class of projective systems and linear codes corresponding to Hermitian varieties over finite fields. The weight hierarchy, also known as the set of generalized Hamming weights, of the code is calculated. The higher weight distribution is also found View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes over Gaussian integers

    Publication Year: 1994, Page(s):207 - 216
    Cited by:  Papers (64)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    The author shows how block codes over Gaussian integers can be used for coding over two-dimensional signal space. He introduces a two-dimensional modular distance called the Mannheim distance and proposes using codes designed for this distance. Some simple constructions of such codes are given, among them icyclic codes which belong to the class of constacyclic codes. As a special case icyclic code... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance limits for channelized cellular telephone systems

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

    Studies the performance of channel assignment algorithms for “channelized” (e.g., FDMA or TDMA) cellular telephone systems, via mathematical models, each of which is characterized by a pair (H,p), where H is a hypergraph describing the channel reuse restrictions, and p is a probability vector describing the variation of traffic intensity from cell to cell. For a given channel assignmen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of a general decoding technique over the class of randomly chosen parity check codes

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

    The paper extends a general decoding technique developed by Metzner and Kapturowski (1990) for concatenated code outer codes and for file disagreement location. That work showed the ability to correct most cases of d-2 or fewer erroneous block symbols, where d is the outer code minimum distance. Any parity check code can be used as the basis for the outer codes, and yet decoding complexity increas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Successive refinement of information: characterization of the achievable rates

    Publication Year: 1994, Page(s):253 - 259
    Cited by:  Papers (150)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    Let R(·) be the rate-distortion function. Assume that we want to describe a source with distortion no larger than Δ1 . From the rate-distortion theory we know that we need to do so at a rate R1 no smaller than R(Δ1) [bits/symbol]. If it turns out that a more accurate description at distortion Δ2, Δ2<Δ View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Five new optimal ternary linear codes

    Publication Year: 1994
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (76 KB)

    Optimal ternary linear codes with parameters [29,5,18], [34,5,21], [43,5,27], [61,5,39], and [31,6,18] have been found. Codes with these parameters were not known until now View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A bound on the rate of a system for encoding an unknown Gaussian autoregressive source

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

    To obtain the rate distortion function of an autoregressive (AR) source when the source parameters are fixed but unknown, it is common simply to insert the estimated parameters into the known-spectrum rate distortion expressions. This approach, although asymptotically correct, ignores any error in estimating the parameters, ignores distortion incurred by the need to encode the parameters for trans... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric polyspectral estimators for kth-order (almost) cyclostationary processes

    Publication Year: 1994, Page(s):67 - 84
    Cited by:  Papers (93)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1288 KB)

    Second- and higher-order almost cyclostationary processes are random signals with almost periodically time-varying statistics. The class includes stationary and cyclostationary processes as well as many real-life signals of interest. Cyclic and time-varying cumulants and polyspectra are defined for discrete-time real kth-order cyclostationary processes, and their interrelationships are explored. S... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An attack on the Interlock Protocol when used for authentication

    Publication Year: 1994, Page(s):273 - 275
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    Exponential key exchange may be used to establish secure communications between two parties who do not share a private key. It fails in the presence of an active wiretap, however. Davies and Price suggest the use of Shamir and Rivest's “Interlock Protocol” to surmount this difficulty. The authors demonstrate that an active attacker can, at the cost of a timeout alarm, bypass the passwo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Idempotents and the BCH bound

    Publication Year: 1994, Page(s):204 - 207
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    Using a characterization of the idempotents of a narrow-sense primitive binary BCH code, the authors are able to give classes of such codes whose minimum distance does not exceed the BCH bound. Their results are compiled in a table View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequential amplitude estimation in multiuser communications

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

    Considers the problem of multiuser amplitude estimation, i.e., the problem of estimating the amplitudes of several digital communications signals superimposed in the same channel. This problem is of importance in communications environments such as spread-spectrum radio networks, in which nonorthogonal multiplexing is used. Multiuser amplitude estimation is a critical prerequisite to the optimum d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DPCM encoding of regenerative composite processes

    Publication Year: 1994, Page(s):153 - 160
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    Fixed (nonadaptive) and forward adaptive differential pulse code modulation of regenerative composite sources is investigated. In the fixed code, an approximate formula is given for the optimal value of the prediction coefficient. This is then used as an initial guess to optimize the code (predictor and quantizer) through a numerical method. In the forward adaptive scheme, the state of the switch ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of entropy-constrained multiple-description scalar quantizers

    Publication Year: 1994, Page(s):245 - 250
    Cited by:  Papers (110)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB)

    The problem of entropy-constrained multiple-description scalar quantizer design is posed as an optimization problem, necessary conditions for optimality are derived, and an iterative design algorithm is presented. Performance results are presented for a Gaussian source, along with comparisons to the multiple-description rate distortion bound and a reference system View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes satisfying the chain condition

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

    The authors considered weight hierarchies of codes satisfying the chain condition, they called these chain-good. First, they gave a set of simple necessary conditions for a sequence to be chain-good. They proved that given one chain-good sequence, there is an infinite set of chain-good sequences that can be constructed from this one sequence. Finally, they used this result to completely describe t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of routing in Clos permutation networks

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

    A lower bound on the amount of information necessary to compute the switch settings for a three-stage Clos network is derived. The bound is derived by considering the effect of a family of permutations, called balanced multiloops, on the settings of the switches of a Clos network. By carefully selecting these permutations, it is proven that there exists at least one switch in each stage whose sett... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A finite group of complex integers and its application to differentially coherent detection of QAM signals

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

    A finite multiplicative group of complex integers is constructed and its application to differential detection of 16 QAM signals is given. In this group the algebraic properties of regular complex multiplication, such as commutativity, associativity, and conjugation are preserved. The challenge in finding such a group lies in the requirements for the existence of multiplicative inverses for number... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimax robust decentralized detection

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

    Decentralized detection problems are studied where the sensor distributions are not specified completely. The sensor distributions are assumed to belong to known uncertainty classes. It is shown for a broad class of such problems that a set of least favorable distributions exists for minimax robust testing between the hypotheses. It is hence established that the corresponding minimax robust tests ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relations between entropy and error probability

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

    The relation between the entropy of a discrete random variable and the minimum attainable probability of error made in guessing its value is examined. While Fano's inequality provides a tight lower bound on the error probability in terms of the entropy, the present authors derive a converse result-a tight upper bound on the minimal error probability in terms of the entropy. Both bounds are sharp, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Restrictions on the weight distribution of binary linear codes imposed by the structure of Reed-Muller codes

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

    The words of a binary linear [n, k] code C whose weights belong to a given subset I⊂{0,1,...,n} constitute a word in a certain Reed-Muller code ℜ𝔐(r, k). Appropriate choices of I result in low values of the order r and thus yield restrictions on the weight distribution of C View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coding theorems for Shannon's cipher system with correlated source outputs, and common information

    Publication Year: 1994, Page(s):85 - 95
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    Source coding problems are treated for Shannon's (1949) cipher system with correlated source outputs (X,Y). Several cases are considered based on whether both X and Y, only X, or only Y must be transmitted to the receiver, whether both X and Y, only X, or only Y must be kept secret, or whether the security level is measured by (1/KH(XK|W), (1/K View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On maximizing linear system output energy with an input envelope constraint

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

    This correspondence addresses the problem of finding an input signal u that maximizes the output energy of a linear filter subject to the constraint |u|⩽e where e is a specified envelope. The main contribution is to provide a new direct proof of the necessity of a certain fixed point condition. Using the weak* topology on the input signal space, the author also proves certain compactness and c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some notes on Varn coding

    Publication Year: 1994, Page(s):181 - 186
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    A duality between Varn (1971) coding and Tunstall (1968) coding is demonstrated and new bounds on the expected transmission cost per source symbol for Varn codes are established. For binary channels, the superiority of the new upper bound over Krause's (1962) upper bound is proven 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