IEEE Transactions on Information Theory

Issue 5  Part 1 • Sept. 1988

Filter Results

Displaying Results 1 - 25 of 56
  • A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes

    Publication Year: 1988, Page(s):1011 - 1020
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    A lower bound on the minimum free Euclidean distance of trellis-coded modulation (TCM) is derived that guarantees the existence of good TCM codes of any complexity. The bound is used to compare trellis codes combined with phase-shift keying, pulse amplitude modulation, and quadratic amplitude-shift keying modulation. This random coding bound is the first lower bound on the free distance of trellis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the stability of interacting queues in a multiple-access system

    Publication Year: 1988, Page(s):918 - 930
    Cited by:  Papers (207)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    The standard discrete-time slotted ALOHA system with a finite number of buffered terminals is considered. The stability (ergodicity) region for this system is known only for the case of two terminals and for the case of any number of symmetric terminals. The stability of the system is studied by means of a simple concept of dominance. It is shown that the stability region for the case of two termi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Link scheduling in polynomial time

    Publication Year: 1988, Page(s):910 - 917
    Cited by:  Papers (311)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    Two polynomial-time algorithms are given for scheduling conversations in a spread spectrum radio network. The constraint on conversations is that each station can converse with only one other station at a time. The first algorithm is strongly polynomial and finds a schedule of minimum length that allows each pair of neighboring stations to converse directly for a prescribed length of time. The sec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A knapsack-type public key cryptosystem based on arithmetic in finite fields

    Publication Year: 1988, Page(s):901 - 909
    Cited by:  Papers (58)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    A knapsack-type public key cryptosystem is introduced that is the system is based on a novel application of arithmetic in finite fields. By appropriately choosing the parameters, one can control the density of the resulting knapsack, which is the ratio between the number of elements in the knapsack and their size in bits. In particular, the density can be made high enough to foil so-called low-den... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sampling theorems for two-dimensional isotropic random fields

    Publication Year: 1988, Page(s):1092 - 1096
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    Sampling theorems are developed for isotropic random fields and their associated Fourier coefficient processes. A wave-number-limited isotropic random field z(r) is considered whose spectral density function is zero outside a disk of radius B centered at the origin of the wavenumber plane. z(r) can be reconstructed in the mean-square sense from its obse... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The minimal covering radius t[15,6] of a six-dimensional binary linear code of length 15 is equal to 4

    Publication Year: 1988, Page(s):1344 - 1345
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (148 KB)

    The nonexistence of a binary linear [15,6] code with covering radius 3 is proved by geometrically based arguments. The author also considers the wider application of the techniques View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partial converse for a relay channel

    Publication Year: 1988, Page(s):1106 - 1110
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    A special case of the general discrete memoryless relay channel is studied. This channel consists of an input x, a relay output z, a channel output y, and a noiseless channel of capacity Cr allowing the relay sender to send additional information to the decoder. The channel is described by a collection of distributions {p(y, z View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the minimum length error event of minimum Euclidean weight

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

    Let η denote the length of the shortest error event achieving the minimum detection distance of maximum-likelihood signal detection for an impulse response having memory v. A family of impulse responses where η is of order v2 is exhibited. This, in turn, shows that some difficulty can arise in computing the minimum detection distance View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple burst-correcting array codes

    Publication Year: 1988, Page(s):1061 - 1066
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    Two families of binary linear multiple-burst-correcting array codes are presented. The codes consist of all possible n1 ×n2 arrays over GF(2), where the columns have even parity and the rows belong to any given code of length n 2 and minimum distance 2t. It is shown that if the bits are read out diagonally instead of horizo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized convergence theorem for neural networks

    Publication Year: 1988, Page(s):1089 - 1092
    Cited by:  Papers (81)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (404 KB)

    A neural network model is presented in which each neuron performs a threshold logic function. The model always converges to a stable state when operating in a serial mode and to a cycle of length at most 2 when operating in a fully parallel mode. This property is the basis for the potential applications of the model, such as associative memory devices and combinatorial optimization. The two conver... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes for combined symbol and digit error control

    Publication Year: 1988, Page(s):1286 - 1307
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1656 KB)

    An approach to error-control coding is described for systems in which digit as well as symbol errors and erasures can occur, a symbol being a position-fixed group of digits. Codes that can deal with both types of errors and erasures simultaneously are constructed. A theoretical basis for determination of the error-control capacity of such codes is given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimal trellises for block codes

    Publication Year: 1988, Page(s):1049 - 1053
    Cited by:  Papers (122)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB)

    Basic concepts in the study of trellises of block codes are defined. It is shown that minimal proper trellises exists for all block codes. Bounds on the size of such trellises are established. These bounds are shown to be exact for maximum distance separable codes and nearly so for perfect codes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new construction for covering codes

    Publication Year: 1988, Page(s):1343 - 1344
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    A novel method for constructing normal binary nonlinear covering codes is presented. The construction improves several upper bounds on K(n,R), the minimum cardinality of a binary code of length n and covering radius R View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On calculating the capacity of an infinite-input finite (infinite)-output channel

    Publication Year: 1988, Page(s):1004 - 1010
    Cited by:  Papers (11)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    A version of the Arimoto-Blahut algorithm for continuous channels involves evaluating integrals over an entire input space and thus is not tractable. Two generalized discrete versions of the Arimoto-Blahut algorithm are presented for this purpose. Instead of calculating integrals, both algorithms require only the computation of a sequence of finite sums. This significantly reduces numerical comput... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Code construction for the noiseless binary switching multiple-access channel

    Publication Year: 1988, Page(s):1100 - 1106
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (620 KB)

    The noiseless coding problem is considered for a discrete memoryless multiple-access channel that is a counterpart to the well-known binary adder channel. Upper and lower bounds on the number of code words in a uniquely decodable code pair are given, from which the zero-error capacity region of the channel is derived. This region coincides with the classical capacity region of this channel. The pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New short constraint length rate (n-1)/n punctured convolutional codes for soft-decision Viterbi decoding

    Publication Year: 1988, Page(s):1079 - 1081
    Cited by:  Papers (16)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    Punctured convolutional codes with good performance are reported for rates (n-1)/n with n=5, 6, 7, 8 and constraint lengths k=2, 3, . . ., 6. The tabulated codes are nonsystematic binary convolutional codes with maximum free distance and minimum information weight, for use with soft-decision Viterbi decoding View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zero error capacity under list decoding

    Publication Year: 1988, Page(s):1070 - 1074
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    Shannon's zero-error channel capacities COF, CO with and without noiseless feedback are generalized to list decoding: the receiver lists L messages, erring if the correct one is not listed. The corresponding capacities COF(L), CO(L) are nondecreasing in L. For an I-letter in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cyclotomic Goppa codes

    Publication Year: 1988, Page(s):1317 - 1320
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    The general Goppa code construction is applied to certain so-called cyclotomic fields of algebraic functions. The resulting codes are metabelian group codes with binary subfield subcodes of minimum distance d≳(1-R)N/log2 log 2N for a given rate R and length N approaching ∞ View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On sequential decoding for the Gilbert channel

    Publication Year: 1988, Page(s):1058 - 1061
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (360 KB)

    It is well known that the computational performance of sequential decoding deteriorates greatly when channel errors occur in clusters, as in Gilbert channels. A way of using sequential decoding to exploit the memory of a Gilbert channel that alleviates this problem is presented. A Fano-like metric matched to this channel is used. The method is investigated by simulating sequential decoding utilizi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finite-state codes

    Publication Year: 1988, Page(s):1083 - 1089
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (744 KB)

    A class of codes called finite-state (FS) codes is defined and investigated. The codes, which generalize both block and convolutional codes, are defined by their encoders, which are finite-state machines with parallel inputs and outputs. A family of upper bounds on the free distance of a given FS code is derived. A general construction for FS codes is given, and it is shown that in many cases the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Explicit codes with low covering radius

    Publication Year: 1988, Page(s):1281 - 1285
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    A series of explicit low-rate binary linear codes that have relatively low covering radius and can be rapidly decoded is exhibited. These codes can be derived from higher-dimensional analogs of the Gale-Berlekamp switching game. Conjectures of independent interest involving Hadamard matrices are given that could yield semiexplicit covering codes of very low density View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fine quantization in signal detection and estimation

    Publication Year: 1988, Page(s):960 - 972
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB)

    The performance lost to data quantization in signal detection and estimation procedures is considered. The performance is measured by f-divergences, which are useful indices of discrimination information between statistical hypotheses. Some properties of the f -divergences are briefly discussed, and a general result for the loss in divergence due to uniform data quantization is o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the filtering of noise-contaminated signals observed via hard limiters

    Publication Year: 1988, Page(s):1041 - 1048
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    The problem of signal estimation from a measurement of its noise crossings is considered, following a nonlinear filtering approach that is different from the classical Davenport method. By focusing on a specific noise model and applying recent results on the excursions of a Brownian motion, an exact representation of the optimal filter is derived. Various extensions of the results are considered View full abstract»

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

    Publication Year: 1988, Page(s):1341 - 1343
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    A proof of V.D. Goppa's (1983) lower bound to the dimension of subfield subcodes of his geometric codes is given. A result on the minimum distance of these subfield subcodes is also given that generalizes the well-known bound: minimum distance of Γ(L,G)⩾2 deg(G(X))+1 for classical Goppa codes Γ(L,G) over the field F 2... View full abstract»

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

    Publication Year: 1988, Page(s):995 - 1003
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (548 KB)

    The random coding capacity of a vector Gaussian arbitrarily varying channel (VGAVC) is determined, along with a simple general method for computing this capacity. The VGAVC is a discrete-time memoryless vector channel with an input power constraint and additive Gaussian noise that is further corrupted by an additive jamming signal. The statistics of this jamming signal are unknown and can be arbit... 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