By Topic

IEEE Transactions on Information Theory

Issue 4 • Date July 1997

Filter Results

Displaying Results 1 - 25 of 39
  • Contributors

    Publication Year: 1997, Page(s):1382 - 1385
    Request permission for commercial reuse | PDF file iconPDF (32 KB)
    Freely Available from IEEE
  • Ergodicity and fourth-order spectral moments

    Publication Year: 1997, Page(s):1273 - 1276
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (172 KB)

    Relationships between ergodicity and structures of fourth-order spectral moments are investigated. In particular it is shown that second-order ergodicity of a random process is directly related to the distribution of these moments on the normal manifolds of the frequency domain. This result is illustrated by various examples View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of the biased square-law sequential detector with signal present

    Publication Year: 1997, Page(s):1268 - 1272
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    A new method is proposed to analyze the performance of a biased square-law sequential detector when a signal is present. Starting from Albert's (1954) integral equations, the method evaluates the detection probability and the moments of the sample number very efficiently and accurately, using polynomial interpolations. Numerical examples show that the new method is much more efficient and/or accur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contribution to Munuera's problem on the main conjecture of geometric hyperelliptic MDS codes

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

    In coding theory, it is of great interest to know the maximal length of MDS codes. In fact, the main conjecture says that the length of MDS codes over Fq is less than or equal to q+1 (except for some special cases). Munuera (see ibid., vol.38, p.1573-7, 1992) proposed a new way to attack the main conjecture on MDS codes for geometric codes. In particular, he proved the conjecture for co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A generalized state-splitting algorithm

    Publication Year: 1997, Page(s):1326 - 1338
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    We describe a generalization of the state-splitting algorithm (also known as the Adler-Coppersmith-Hassner (1983) algorithm) for constructing encoders which encode arbitrary data into constrained systems of sequences. In the generalized algorithm, we replace approximate eigenvectors with approximate eigenmatrices to yield a framework for designing encoders with smaller sliding-block windows and th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Almost sure convergence analysis of mixed time averages and kth-order cyclic statistics

    Publication Year: 1997, Page(s):1265 - 1268
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    The strong law of large numbers for general processes is established under certain conditions and the convergence rate of time averages is given. These results are used to obtain the convergence rates and the almost sure convergence properties of mixed time averages and kth-order cyclic statistics View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The depth distribution-a new characterization for linear codes

    Publication Year: 1997, Page(s):1361 - 1363
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (148 KB)

    We apply the well-known operator of sequences, the derivative D, on codewords of linear codes. The depth of a codeword c is the smallest integer i such that Dic (the derivative applied i consecutive times) is zero. We show that the depth distribution of the nonzero codewords of an [n, k] linear code consists of exactly k nonzero values, and its generator matrix can be constructed from a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructions for difference triangle sets

    Publication Year: 1997, Page(s):1346 - 1349
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    Difference triangle sets are useful in many practical problems of information transmission. This article studies combinatorial and computational constructions for difference triangle sets having small scopes. Our algorithms have been used to produce difference triangle sets whose scopes are the best currently known View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved bounds for ternary linear codes of dimension 7

    Publication Year: 1997, Page(s):1377 - 1381
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    New codes of dimension 7 are presented which give improved bounds on the maximum possible minimum distance of ternary linear codes. These codes belong to the class of quasi-cyclic codes, and have been constructed using a stochastic optimization algorithm, tabu search. Thirty-two codes are given which improve or establish the current bounds for ternary codes. In addition, a table of upper and lower... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bidirectional sequential decoding

    Publication Year: 1997, Page(s):1319 - 1326
    Cited by:  Papers (18)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    The main drawback of sequential decoding is the variability of its decoding effort which could cause decoding erasures. We propose and analyze an efficient bidirectional sequential decoding (BSD) technique to alleviate this drawback. In the proposed BSD, two decoders are used; one is called a forward decoder (FD), and is used to search the tree from the forward direction; while the other is called... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Worst case additive noise for binary-input channels and zero-threshold detection under constraints of power and divergence

    Publication Year: 1997, Page(s):1256 - 1264
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    Additive-noise channels with binary inputs and zero-threshold detection are considered. We study worst case noise under the criterion of maximum error probability with constraints on both power and divergence with respect to a given symmetric nominal noise distribution. Particular attention is focused on the cases of a) Gaussian nominal distributions and b) asymptotic increase in worst case error ... View full abstract»

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

    Publication Year: 1997, Page(s):1122 - 1133
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    Adaptive partitioning of a multidimensional feature space plays a fundamental role in the design of data-compression schemes. Most partition-based design methods operate in an iterative fashion, seeking to reduce distortion at each stage of their operation by implementing a linear split of a selected cell. The operation and eventual outcome of such methods is easily described in terms of binary tr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Upper bounds on trellis complexity of lattices

    Publication Year: 1997, Page(s):1294 - 1300
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    Unlike block codes, n-dimensional lattices can have minimal trellis diagrams with an arbitrarily large number of states, branches, and paths. In particular, we show by a counterexample that there is no f(n), a function of n, such that all rational lattices of dimension n have a trellis with less than f(n) states. Nevertheless, using a theorem due to Hermite, we prove that every integral lattice &L... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Elliptic curve cryptosystems using curves of smooth order over the ring Zn

    Publication Year: 1997, Page(s):1231 - 1237
    Cited by:  Papers (6)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    We present a new cryptosystem based on elliptic curves over the ring Zn, where n=pq, in which the message is held in the exponent and not the group element. The security of this system is based on the difficulty of factoring n. A digital signature scheme and ID-based key exchange system are also given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Arithmetic crosscorrelations of feedback with carry shift register sequences

    Publication Year: 1997, Page(s):1342 - 1345
    Cited by:  Papers (31)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (188 KB)

    An arithmetic version of the crosscorrelation of two sequences is defined, generalizing Mandelbaum's (1967) arithmetic autocorrelations. Large families of sequences are constructed with ideal (vanishing) arithmetic crosscorrelations. These sequences are decimations of the 2-adic expansions of rational numbers p/q such that 2 is a primitive root module q View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The multicovering radii of codes

    Publication Year: 1997, Page(s):1372 - 1377
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB)

    The covering radius of a code is the least r such that the set of balls of radius r around codewords covers the entire ambient space. We introduce a generalization of the notion of covering radius. The m-covering radius of a code is the least radius such that the set of balls of that radius covers all m-tuples of elements in the ambient space. We investigate basic properties of m-covering radii. W... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust and efficient recovery of a signal passed through a filter and then contaminated by non-Gaussian noise

    Publication Year: 1997, Page(s):1184 - 1191
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB)

    Consider a channel where a continuous periodic input signal is passed through a linear filter and then is contaminated by an additive noise. The problem is to recover this signal when we observe n repeated realizations of the output signal. Adaptive efficient procedures, that are asymptotically minimax over all possible procedures, are known for channels with Gaussian noise and no filter (the case... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding

    Publication Year: 1997, Page(s):1314 - 1319
    Cited by:  Papers (20)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    A new soft-decision maximum-likelihood decoding algorithm is proposed, which generates a set of candidate codewords using hard-decision bounded-distance decoding. By improving the generating method of input vectors for the bounded-distance decoding due to Kaneko et al. (see ibid., vol.40, no.3, p.320-27, 1994), the decoding time complexity is reduced without degradation of the performance. The spa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correlated sources help transmission over an arbitrarily varying channel

    Publication Year: 1997, Page(s):1254 - 1255
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (100 KB)

    It is well known that the deterministic code capacity (for the average error probability criterion) of an arbitrarily varying channel (AVC) either equals its random code capacity or zero. Here it is shown that if two components of a correlated source are additionally available to the sender and receiver, respectively, the capacity always equals its random code capacity View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • About distances of discrete distributions satisfying the data processing theorem of information theory

    Publication Year: 1997, Page(s):1288 - 1293
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    The distances of discrete probability distributions are considered. Necessary and sufficient conditions for validity of the data processing theorem of information theory are established. These conditions are applied to the Burbea-Rao (1982) divergences and Bregman (1967) distances View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Translates of linear codes over Z4

    Publication Year: 1997, Page(s):1218 - 1230
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    We give a method to compute the complete weight distribution of translates of linear codes over Z4. The method follows known ideas that have already been used successfully by others for Hamming weight distributions. For the particular case of quaternary Preparata codes, we obtain that the number of distinct complete weights for the dual Preparata codes and the number of distinct complet... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterization of the Bayes estimator and the MDL estimator for exponential families

    Publication Year: 1997, Page(s):1165 - 1174
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    We analyze the relationship between a minimum description length (MDL) estimator (posterior mode) and a Bayes estimator for exponential families. We show the following results concerning these estimators: (a) both the Bayes estimator with Jeffreys (1961) prior and the MDL estimator with the uniform prior with respect to the expectation parameter are nearly equivalent to a bias-corrected maximum-li... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general minimax result for relative entropy

    Publication Year: 1997, Page(s):1276 - 1280
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    Suppose nature picks a probability measure Pθ on a complete separable metric space X at random from a measurable set P Θ={Pθ:θ∈Θ}. Then, without knowing θ, a statistician picks a measure Q on S. Finally, the statistician suffers a loss D(P0||Q), the relative entropy between Pθ and Q. We show that the minimax... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Surfaces and the weight distribution of a family of codes

    Publication Year: 1997, Page(s):1354 - 1360
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB)

    We derive the weight distribution of the binary trace codes with words (Tr(axq+1+bx3+cx))x∈F*(q2) where a, b, c∈F(q2) and Tr is the trace map from F(q2) to F2. The weights of these words determine the exponential sums which were considered earlier by Moreno and Kumar (1994) and Lahtonen (1995). Results from the theory of q... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Second-order noiseless source coding theorems

    Publication Year: 1997, Page(s):1339 - 1341
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    Shannon's celebrated source coding theorem can be viewed as a “one-sided law of large numbers”. We formulate second-order noiseless source coding theorems for the deviation of the codeword lengths from the entropy. For a class of sources that includes Markov chains we prove a “one-sided central limit theorem” and a law of the iterated logarithm 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