IEEE Transactions on Information Theory

Issue 1 • Jan 1991

Filter Results

Displaying Results 1 - 25 of 35
  • On the competitive optimality of Huffman codes

    Publication Year: 1991, Page(s):172 - 174
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (252 KB)

    Let X be a discrete random variable drawn according to a probability mass function p(x), and suppose p(x), is dyadic, i.e., log(1/p(x)) is an integer for each x. It is shown that the binary code length assignment l(x)=log(1/p(x)) dominates any other uniquely decodable assignment l'(... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improvement to generalized-minimum-distance decoding

    Publication Year: 1991, Page(s):167 - 172
    Cited by:  Papers (67)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (552 KB)

    A novel acceptance criterion that is less stringent than previous criteria is developed. The criterion accepts the codeword that is closest to the received vector for many cases where previous criteria fail to accept any codeword. As a result, the performance of generalized minimum distance (GMD) decoding is better if the new criterion is used. For M-ary signaling, the weights used in GMD... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient estimation of Class A noise parameters via the EM algorithm

    Publication Year: 1991, Page(s):60 - 72
    Cited by:  Papers (75)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (900 KB)

    The Class A Middleton noise model is a commonly used statistical-physical, parametric model for non-Gaussian interference superimposed on a Gaussian background. In this study, the problem of efficient estimation of the Class A parameters for small sample sizes is considered. The proposed estimator is based on the EM algorithm, a two-step iterative estimation technique that is ideally suited for th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On `The optimal linear receiving filter for digital transmission over nonlinear channels'

    Publication Year: 1991
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (104 KB)

    A recent paper by E. Biglieri et al. (see ibid., vol.35, p.620-5, May 1989) shows that the matched-filter/tapped-delay-line structure is optimum not only for linear pulse-modulated signals and linear channel distortion, but also for nonlinear finite-alphabet pulse-modulation and some nonlinear channel distortion. This has important practical applications. Therefore, its connection with other work ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The optimal power law for the detection of a Gaussian burst in a background of Gaussian noise

    Publication Year: 1991, Page(s):209 - 214
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (448 KB)

    The optimal power law is analyzed using characteristic function techniques. For a signal occupying more than about λ=0.5 of the integration time, the standard square-law energy detector is close to optimal (among the class of power-law detectors). The optimal power is ν*=3 for λ≈0.3, increasing rapidly as λ decreases below this value. The SNR advantage of the optimal pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Short linear incremental redundancy codes having optimal weight structure profile

    Publication Year: 1991, Page(s):192 - 195
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (280 KB)

    A set of binary block codes with incremental redundancy is developed using a combination of a constructive method and a computer search. Generator matrices of thirteen codes with information word lengths of 4 to 16 and with code rates as low as 1/4 or 1/3, respectively, are given. For two codes the minimum distance is compared to the minimum distance of the best known linear block codes with the s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On linear structure and phase rotation invariant properties of block M-PSK modulation codes

    Publication Year: 1991, Page(s):164 - 167
    Cited by:  Papers (22)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (340 KB)

    Two important structural properties of block M(=2' )-ary PSK modulation codes, linear structure and phase symmetry, are investigated. An M-ary modulation code is first represented as a code with symbols from the integer group SM-PSK=(0,1,2,---,M-1) under modulo-M addition. Then the linear structure of block M-PSK modulati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State constraints for the multiple-access arbitrarily varying channel

    Publication Year: 1991, Page(s):27 - 35
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (588 KB)

    A discrete multiple-access arbitrarily varying channel with two transmitters and one receiver is considered. It has recently been shown that if such a channel is symmetrizable, then the capacity region has an empty interior. It is shown that if the channel is subject to a suitable state constraint, then the capacity region can contain certain open rectangles and thereby possess a nonempty interior... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error-correcting codes for authentication and subliminal channels

    Publication Year: 1991, Page(s):13 - 17
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (364 KB)

    The application of coding theory to security scenarios is studied. Authentication systems are introduced that are based on algebraic codes and provide high protection against an intruder's impersonation and substitution attacks. It is shown that a subliminal channel can be embedded into these systems and that there is a trade-off between the authentication capability, subliminal capacity, and erro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal bi-level quantization and its application to multilevel quantization

    Publication Year: 1991, Page(s):160 - 163
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (336 KB)

    A special form of optimal quantization, optimal bilevel quantization, is studied. A fixed-point method is embedded in a search scheme to find all the locally optimal bilevel quantizers, resulting in an algorithm for computing the globally optimal bilevel quantizer. Some interesting relations between the optimal bilevel quantizer, and the mean and the median of the density function p(x... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Divergence measures based on the Shannon entropy

    Publication Year: 1991, Page(s):145 - 151
    Cited by:  Papers (908)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (460 KB)

    A novel class of information-theoretic divergence measures based on the Shannon entropy is introduced. Unlike the well-known Kullback divergences, the new measures do not require the condition of absolute continuity to be satisfied by the probability distributions involved. More importantly, their close relationship with the variational distance and the probability of misclassification error are e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear codes with covering radius 2 and other new covering codes

    Publication Year: 1991, Page(s):219 - 224
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (436 KB)

    Infinite families of linear binary codes with covering radius R=2 and minimum distance d=3 and d=4 are given. Using the constructed codes with d=3, R=2, families of covering codes with R>2 are obtained. The parameters of many constructed codes with R⩽2 are better than the parameters of known codes. The parity check matrices of c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The optimality of the censored mean-level detector

    Publication Year: 1991, Page(s):206 - 209
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (304 KB)

    It is shown that the CMLD (censored mean-level detector) is optimal in that the probability of detection is maximized for a given probability of false alarm when no contaminating signals are present in the reference cells. Since the probability of detection in this case is the same as the probability of detection for the MLD (mean-level detector) when k reference cells are used, and since... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A calculus for network delay. II. Network analysis

    Publication Year: 1991, Page(s):132 - 141
    Cited by:  Papers (486)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (736 KB)

    For pt.I see ibid., vol.37, no.1, p.114-31 (1991). A method to analyze the flow of data in a network consisting of the interconnection of network elements is presented. Assuming the data that enters the network satisfies burstiness constraints, burstiness constraints are derived for traffic flowing between network elements. These derived constraints imply bounds on network delay and buffering requ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Timing estimation for a filtered Poisson process in Gaussian noise

    Publication Year: 1991, Page(s):92 - 106
    Cited by:  Papers (27)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (992 KB)

    The problem of estimation of time shift of an inhomogeneous casually filtered Poisson process in the presence of additive Gaussian noise is discussed. Approximate expressions for the likelihood function, the MAP estimator, and the MMSE estimator that becomes increasingly accurate as the per-unit-time density of superimposed filter responses becomes small are obtained. The optimal MAP estimator tak... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalization of the Norse bounds to codes of higher strength

    Publication Year: 1991, Page(s):190 - 192
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (224 KB)

    The Norse bounds state that all codes of strength 1 and length n have covering radius at most n/2 and all self-complementary codes of strength 2 and length n have covering radius at most (n-√n)/2. This is generalized to arbitrary even values of strength, still assuming self-complementarity, and to odd strengths without this hypothesis. The proof t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A class of least-squares filtering and identification algorithms with systolic array architectures

    Publication Year: 1991, Page(s):43 - 52
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (764 KB)

    A unified approach is presented for deriving a large class of new and previously known time and order recursive least-squares algorithms with systolic array architectures, suitable for high throughput rate and VLSI implementations of space-time filtering and system identification problems. The geometrical derivation given is unique in that no assumption is made concerning the rank of the sample da... View full abstract»

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

    Publication Year: 1991, Page(s):174 - 179
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (488 KB)

    An upper bound on the redundancy of D-ary Huffman codes in terms of the probability p1 of the most likely source letter is provided. For large values of p1, the bound improves the one given by R.G. Gallager (1978). Additionally, some results known for the binary case (D=2) are extended to arbitrary D-ary Huffman codes. As a consequ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the performance and complexity of channel-optimized vector quantizers

    Publication Year: 1991, Page(s):155 - 160
    Cited by:  Papers (203)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (452 KB)

    The performance and complexity of channel-optimized vector quantizers are studied for the Gauss-Markov source. Observations on the geometric structure of these quantizers are made, which have an important implication on the encoding complexity. For the squared-error distortion measure, it is shown that an operation equivalent to a Euclidean distance measurement with respect to an appropriately def... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identification of MISO nonlinear regressions in the presence of a wide class of disturbances

    Publication Year: 1991, Page(s):214 - 216
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (224 KB)

    A nonparametric algorithm, based on multiple Fourier series, for identification of MISO (multidimensional-input-single-output) systems is investigated. It is shown that the algorithm converges for a wide class of noise View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the dimension of trace codes

    Publication Year: 1991, Page(s):196 - 199
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (316 KB)

    An improvement of the trivial upper bound for the dimension of certain binary trace codes, as well as their true dimension under certain conditions, is derived. The dimension of trace codes of hermitian codes is developed, and the dimension of trace codes of elliptic codes is presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capacity of the Gaussian arbitrarily varying channel

    Publication Year: 1991, Page(s):18 - 26
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (536 KB)

    The Gaussian arbitrarily varying channel with input constraint Γ and state constraint Λ admits input sequences x=(x1,---,Xn) of real numbers with Σxi2⩽nΓ and state sequences s=(S1,---,sn ) of real numbers with Σsi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error-correcting codes for list decoding

    Publication Year: 1991, Page(s):5 - 12
    Cited by:  Papers (59)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (720 KB)

    In the list-of-L decoding of a block code the receiver of a noisy sequence lists L possible transmitted messages, and is in error only if the correct message is not on the list. Consideration is given to (n,e,L) codes, which correct all sets of e or fewer errors in a block of n bits under list-of-L decoding. New geometric rela... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the error probability of signals in additive white Gaussian noise

    Publication Year: 1991, Page(s):151 - 155
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (332 KB)

    A new upper bound to the probability of error in detecting one of M equally probable signals in additive white Gaussian noise is presented. This bound is easy to calculate, can be applied to any signal set. It is always better than the union and minimum distance bounds. Examples demonstrate the use of the bound View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on the absolute epsilon entropy

    Publication Year: 1991, Page(s):142 - 144
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (240 KB)

    A novel characterization of the absolute epsilon entropy of an ergodic information source is presented. This characterization allows one to derive a new lower bound to this quantity, which is shown to be tight in some interesting special cases 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