IEEE Transactions on Information Theory

Volume 44 Issue 3 • May 1998

Filter Results

Displaying Results 1 - 25 of 48
  • Contributors

    Publication Year: 1998, Page(s):1346 - 1350
    Request permission for commercial reuse | PDF file iconPDF (50 KB)
    Freely Available from IEEE
  • Decoding linear block codes using a priority-first search: performance analysis and suboptimal version

    Publication Year: 1998, Page(s):1233 - 1246
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    An efficient maximum-likelihood soft-decision decoding algorithm for linear block codes using a generalized Dijkstra's algorithm was proposed by Han, Hartmann, and Chen (1993). We prove that this algorithm is efficient for most practical communication systems where the probability of error is less than 10-3 by finding an upper bound of the computational effort of the algorithm. A subopt... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • How often is hard-decision decoding enough?

    Publication Year: 1998, Page(s):1187 - 1193
    Cited by:  Papers (9)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    The problem of decoding binary linear block codes has received much attention; the two extremes are optimal, high-complexity soft-decision (or maximum-likelihood) decoding and lower performance, much lower complexity hard-decision (or algebraic) decoding. This article considers a class of decoders which first implements hard-decision decoding; second, tests to see if that is enough, that its resul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The compound channel capacity of a class of finite-state channels

    Publication Year: 1998, Page(s):973 - 983
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (636 KB)

    A transmitter and receiver need to be designed to guarantee reliable communication on any channel belonging to a given family of finite-state channels defined over common finite input, output, and state alphabets. Both the transmitter and receiver are assumed to be ignorant of the channel over which transmission is carried out and also ignorant of its initial state. For this scenario we derive an ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MAP decoding of convolutional codes using reciprocal dual codes

    Publication Year: 1998, Page(s):1176 - 1187
    Cited by:  Papers (45)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (520 KB)

    A new symbol-by-symbol maximum a posteriori (MAP) decoding algorithm for high-rate convolutional codes using reciprocal dual convolutional codes is presented. The advantage of this approach is a reduction of the computational complexity since the number of codewords to consider is decreased for codes of rate greater than 1/2. The discussed algorithms fulfil all requirements for iterative (“t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Binary constant-weight codes for error detection

    Publication Year: 1998, Page(s):1294 - 1299
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB)

    The undetected error probability of binary constant weight codes on a binary symmetric channel is studied in this correspondence. First, we present a necessary condition for the binary constant weight codes to be proper for error detection. Then, by using the necessary condition, we study the error detection capability of binary optimum constant weight codes View full abstract»

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

    Publication Year: 1998, Page(s):1305 - 1309
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    We present a new construction for snake-in-the-box codes and circuit codes. Our technique is based on arranging necklaces, i.e., equivalence classes of words under cyclic shifting, to form codes and gives 21 new codes of lengths 8-17, all having more words than the best previously known codes. Included among these are two snake-in-the-box codes: one of length 8 with 96 words, the other of length 1... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The capacity of orthogonal and bi-orthogonal codes on the Gaussian channel

    Publication Year: 1998, Page(s):1217 - 1232
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (652 KB)

    This correspondence analyzes the performance of concatenated coding systems and modulation schemes operating over the additive white Gaussian noise (AWGN) channel by examining the loss of capacity resulting from each of the processing steps. The techniques described in this correspondence allow the separate evaluation of codes and decoders and thus the identification of where loss of capacity occu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximin performance of binary-input channels with uncertain noise distributions

    Publication Year: 1998, Page(s):947 - 972
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1352 KB)

    We consider uncertainty classes of noise distributions defined by a bound on the divergence with respect to a nominal noise distribution. The noise that maximizes the minimum error probability for binary-input channels is found. The effect of the reduction in uncertainty brought about by knowledge of the signal-to-noise ratio is also studied. The particular class of Gaussian nominal distributions ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Irregular sampling theorems for wavelet subspaces

    Publication Year: 1998, Page(s):1131 - 1142
    Cited by:  Papers (44)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    From the Paley-Wiener 1/4-theorem, the finite energy signal f(t) can be reconstructed from its irregularly sampled values f(k+δκ) if f(t) is band-limited and supκ|δκ|<1/4. We consider the signals in wavelet subspaces and wish to recover the signals from its irregular samples by using scaling functions. Then the method of estimating ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of network calculus to guaranteed service networks

    Publication Year: 1998, Page(s):1087 - 1096
    Cited by:  Papers (168)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    We use previous network calculus results to study some properties of lossless multiplexing as it may be used in guaranteed service networks. We call network calculus a set of results that apply min-plus algebra to packet networks. We provide a simple proof that shaping a traffic stream to conform to a burstiness constraint preserves the original constraints satisfied by the traffic stream. We show... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Metrics generated by families of subspaces

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

    A new family of metrics is introduced. Each of these is defined by a spanning set F of linear subspaces of a finite vector space. The norm of a vector is defined as the size of a minimal subset of F whose span contains this vector. Some examples and applications are presented. A-class of Varshamov-Gilbert bound based F-metrics is introduced. Connections with combinatorial metrics are discussed View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Guessing subject to distortion

    Publication Year: 1998, Page(s):1041 - 1056
    Cited by:  Papers (56)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (928 KB)

    We investigate the problem of guessing a random vector X within distortion level D. Our aim is to characterize the best attainable performance in the sense of minimizing, in some probabilistic sense, the number of required guesses G(X) until the error falls below D. The underlying motivation is that G(X) is the number of candidate codewords to be examined by a rate-distortion block encoder until a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric entropy estimation for stationary processes and random fields, with applications to English text

    Publication Year: 1998, Page(s):1319 - 1327
    Cited by:  Papers (89)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB)

    We discuss a family of estimators for the entropy rate of a stationary ergodic process and prove their pointwise and mean consistency under a Doeblin-type mixing condition. The estimators are Cesaro averages of longest match-lengths, and their consistency follows from a generalized ergodic theorem due to Maker (1940). We provide examples of their performance on English text, and we generalize our ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Te “art of trellis decoding” is computationally hard-for large fields

    Publication Year: 1998, Page(s):1211 - 1214
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (136 KB)

    The problem of minimizing the trellis complexity of a code by coordinate permutation is studied. Three measures of trellis complexity are considered: the total number of states, the total number of edges, and the maximum state complexity of the trellis. The problem is proven NP-hard for all three measures, provided the field over which the code is specified is not fixed. We leave open the problem ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improved Serre bound for elementary Abelian extensions of Fq(x) and the generalized Hamming weights of duals of BCH codes

    Publication Year: 1998, Page(s):1291 - 1293
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (136 KB)

    An improvement on the Serre bound for the number of rational places is obtained. Using our result we improve the bounds on the generalized Hamming weights of the duals of the BCH codes estimated by Stichtenoth and Voss (1994). Our new bound is tight in the binary case of the generalized Hamming weight of BCH (2) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zero-error capacity for models with memory and the enlightened dictator channel

    Publication Year: 1998, Page(s):1250 - 1252
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (120 KB)

    We present a general class of zero-error capacity problems with memory covering known cases such as coding for error correction and many new cases. This class can be incorporated into a model of channels with memory, which thus are shown to give a unification of a multitude of seemingly very different coding problems. We analyze a seemingly basic channel in this class View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the hinge-finding algorithm for hingeing hyperplanes

    Publication Year: 1998, Page(s):1310 - 1319
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    This correspondence concerns the estimation algorithm for hinging hyperplane (HH) models, a piecewise-linear model for approximating functions of several variables, suggested in Breiman (1993). The estimation algorithm is analyzed and it is shown that it is a special case of a Newton algorithm applied to a sum of squared error criterion. This insight is then used to suggest possible improvements o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on authentication codes from algebraic geometry

    Publication Year: 1998, Page(s):1342 - 1345
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    In this note we show that one can ameliorate existing lower bounds for parameters of authentication codes using algebraic-geometry codes View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum entropy and maximum likelihood in spectral estimation

    Publication Year: 1998, Page(s):1332 - 1336
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    The power spectral measure, an informative feature of a stationary time-discrete stochastic process, describes the relative strength of uncorrelated frequency components that compose the process. In spectral estimation one wants to describe the spectral measures of processes having a prescribed initial block of autocorrelation coefficients. In the continuum of possibilities, two types are frequent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On estimation for a binary-symmetric channel

    Publication Year: 1998, Page(s):1260 - 1272
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (516 KB)

    We consider a binary-symmetric channel where the input, modeled as an infinite sequence of bits, is distorted by Bernoulli noise. In a paper by Simons (1991), a consistent estimator of the distortion, i.e., of the probability that a single bit is changed, is described under the basic assumption that the complexity of the input is finite. Here, we deal with two shortcomings. (1) The Simons' estimat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical secrecy and multibit commitments

    Publication Year: 1998, Page(s):1143 - 1151
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    We present and compare definitions of “statistically hiding” protocols, and we propose a novel statistically hiding commitment scheme. Informally, a protocol statistically hides a secret if a computationally unlimited adversary who conducts the protocol with the owner of the secret learns almost nothing about it. One definition is based on the L1-norm distance between probab... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some distributional properties of the continuous wavelet transform of random processes

    Publication Year: 1998, Page(s):1111 - 1124
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    Without finite moment conditions, some properties of random processes, such as stationarity and self-similarity, are characterized via corresponding properties of their wavelet transform. Anyone of these distributional properties of the wavelet transform characterizes the corresponding property of the increments of the random process, of order equal to the order of regularity of the analyzing wave... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A reliability output Viterbi algorithm with applications to hybrid ARQ

    Publication Year: 1998, Page(s):1214 - 1216
    Cited by:  Papers (13)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    We present an algorithm that permits a receiver to calculate the probability of packet error in parallel with the Viterbi decoding process. This packet reliability value may be used to request retransmissions in a type-I hybrid ARQ scheme. It is shown that this scheme can be used to guarantee any required bound on the packet error probability. In addition, this scheme can be used in conjunction wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Operational capacity and pseudoclassicality of a quantum channel

    Publication Year: 1998, Page(s):1071 - 1086
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB)

    We explore some basic properties of coding theory of a general quantum communication channel and its operational capacity, including: 1) adaptive measurement with feedback code; 2) reconsideration of single-letterized capacity formula; and 3) pseudoclassicality of a channel 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