IEEE Transactions on Information Theory

Volume 34 Issue 4 • July 1988

Filter Results

Displaying Results 1 - 25 of 34
  • Correction to 'A heuristic algorithm for the construction of a code with limited word length'

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

    In the above-named work (see ibid., vol.IT-33, p.438-43, May 1987), a method was presented for the construction of a variable length code with maximum word-length constraint. The algorithm is partially based on the algorithm of A.H. Murakami et al. (1984), and is extended with heuristic choices for the bifurcations. C.H. Lu (1988) explains why step (1) taken by Murakami, which is used in De Lameil... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two new binary codes with minimum distance three

    Publication Year: 1988
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (92 KB)

    The author obtains a binary code of length 18 which has 164×26=10496 codewords. The minimum distance of this code is three. Therefore, A(18,3)⩾10496. Shortening, the author obtains find a binary code of length 17 and minimum distance 3 which has 5248 codewords, showing that A(17,3)⩾5248 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A transform theory for a class of group-invariant codes

    Publication Year: 1988, Page(s):725 - 775
    Cited by:  Papers (22)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2236 KB)

    A binary cyclic code of length of n can be defined by a set of parity-check equations that is invariant under the additive cyclic group generated by A:i→i+1 modulo n. A class of quasicyclic codes that have parity-check equations invariant under the group generated by a subgroup of A and a subgroup of the multiplicative group M: View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal contention among three senders

    Publication Year: 1988, Page(s):851 - 857
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (576 KB)

    The tests allowed in conflict resolution problems have usually three types of outcomes, according to whether the test contains zero, one, or at least two senders. The question of locating three elements in a given interval of the real line with the least number of such tests is studied. A nested detection algorithm is provided which is then proven to be optimal. For this purpose, extensive use is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cycle representatives of quasi-irreducible two-dimensional cyclic codes

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

    The author presents a method of finding the cycle representatives of any quasi-irreducible (QIR) 2-D cyclic code by extending A.P. Kurdjukov's (Probl. Peredach. Inform., vol.12, no.4, p.107-8, 1976) result on quasi-irreducible (i.e. nonsquare-free) 10D cyclic codes. The algorithm is not strictly deterministic in the sense that it is necessary to obtain a set of representative arrays for the code b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the existence of positive-definite maximum-likelihood estimates of structured covariance matrices

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

    It is shown that a sufficient condition for the likelihood function of a zero-mean Gaussian random vector with covariance R from some class of covariances R to be unbounded above over the set of positive-definite matrices in R is that some singular Ro exists in R whose range space contains the data. The results obtained imply that, for the sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source encoding using syntactic information source models

    Publication Year: 1988, Page(s):843 - 850
    Cited by:  Papers (21)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    The use of syntactic information source models for the source encoding (data compression) of messages is described. Syntactic models formulated using context-free grammars augmented with derivation step probabilities are considered. Using an arithmetic coder as the low-level encoding unit, it is shown how practical encoding systems can be constructed from such models. Application of the techniques... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of discrete-time predictors of continuous-time stationary processes

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

    The asymptotic performance of linear predictors of continuous-time stationary processes is studied from observations at n sampling instants on a fixed observation interval. Both optimal and simpler choices of predictor coefficients are considered, using uniform sampling as well as nonuniform sampling tailored to the statistics of the process under prediction. The focus is on stationary pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cyclic unequal error protection codes constructed from cyclic codes of composite length

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

    The unequal error correction capabilities of binary cyclic codes of composite length are investigated. Under certain conditions, direct sums of concatenated codes have unequal error correction capabilities. By a modified Hartmann and Tzeng (1973) algorithm, it is shown that a binary cyclic code of composite length is equivalent to the direct sum of concatenated codes. With this, some binary cyclic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multidimensional modulation and coding for band-limited digital channels

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

    A class of multidimensional signals, based on generalized group alphabets, is introduced and its basic properties are derived. The combination of generalized group alphabets and coding is also examined: two coding schemes are considered-G. Ungerboeck's scheme (1982) for combination with convolutional codes, and V.V. Ginzburg's (1984) scheme for combination with block codes. It is concluded that th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On decoding rules to minimize the probability of information bit errors

    Publication Year: 1988, Page(s):880 - 881
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    Decoding rules to minimize the probability of information bit errors in binary linear block codes are investigated. A novel decoding rule is proposed and compared to a recently proposed rule (see M. Elia and G. Prati, 1985) and to the standard rule, with respect to both the information bit error rate and the information word error rate. It is concluded that the proposed rule not only can be implem... View full abstract»

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

    Publication Year: 1988, Page(s):786 - 792
    Cited by:  Papers (36)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    A class of block coset codes with disparity and run-length constraints are studied. They are particularly well suited for high-speed optical fiber links and similar channels, where DC-free pulse formats, channel error control, and low-complexity encoder-decoder implementations are required. The codes are derived by partitioning linear block codes. The encoder and decoder structures are the same as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error bounds for the nonlinear filtering of signals with small diffusion coefficients

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

    New upper and lower bounds for the nonlinear filtering problem are presented. The lower bounds are especially useful in the region of small diffusion coefficients where previously known bounds are inefficient. The upper and lower bounds are shown to be tight. An example demonstrating the tightness of the bounds is presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A rate-distortion problem for a communication system with a secondary decoder to be hindered

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

    A rate-distortion problem is considered for a communication system (f, φ1) with a secondary decoder φ2 to be hindered which uses a different distortion measure from the primary system. The least achievable distortion of the secondary decoder is evaluated for the most secure primary system. Source coding for sources with additional outputs to be kept secret f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence analysis of adaptive linear estimation for dependent stationary processes

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

    The convergence properties of an adaptive linear mean-square estimator that uses a modified LMS algorithm are established for generally dependent processes. Bounds on the mean-square error of the estimates of the filter coefficients and on the excess error of the estimate of the signal are derived for input processes which are either strong mixing or asymptotically uncorrelated. It is shown that t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A direct proof of the weight retaining property of polynomials over a finite field

    Publication Year: 1988, Page(s):875 - 877
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    A result of J.L. Massey et al. (see ibid., vol.IT-19, no.1, p.101-110, 1973) concerning weights of polynomials over GF(p r) is generalized from p=2 to general prime p . This generalization makes it possible to directly establish several theorems about polynomial weights in a way that no longer relies on results from coding theory View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structure, optimization, and realization of FFSK trellis codes

    Publication Year: 1988, Page(s):730 - 751
    Cited by:  Papers (35)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1800 KB)

    The structure of combinations of (l,k) binary trellis encoders and fast frequency-shift keying (FFSK) modulation is studied. A novel method for the optimization of these combinations is proposed. It is concluded that, regardless of the particular realization, the best combinations can always be obtained by using a so-called matched convolutional code. Optimum FFSK codes of rates ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new look at coding for APD-based direct-detection optical channels

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

    Coding for avalanche photodiode (APD)-based direct-detection optical channels is investigated using a simple channel model that clearly points out the difference between the signal-dependent optical noise channel model and additive white Gaussian noise channel model. Coding and modulation are viewed as a single entity and the coding/modulation gain (CMG) is used to analyze and construct good codes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic analysis for the recursive median filter process

    Publication Year: 1988, Page(s):669 - 679
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    Vector probability measure functions (density function) for recursively median filtered signals are found when the underlying input binary sequences are either independent identically distributed (i.i.d.) or Markov chains. The results are parametric in the window size of the filter and in the probability distribution of the input sequence. Using statistical threshold decomposition, the same result... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Composition of Reed-Solomon codes and geometric designs

    Publication Year: 1988, Page(s):810 - 816
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    It is shown that good linear (n,k,d) codes over a finite field GF(q) can be constructed by concatenating the generator matrices of Reed-Solomon codes. For the case of k=3, it is shown that many of the codes obtained using projective-geometry techniques can readily be obtained by the proposed algebraic approach View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lossless coding for sources of floating-point and fixed-precision numbers

    Publication Year: 1988, Page(s):882 - 888
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (480 KB)

    A procedure for constructing binary models for sources of floating-point and fixed-precision numbers is given and used together with the minimum description length principle to find optimal models. These models are used to design noiseless source codes which take into consideration the practical tradeoff between minimizing memory cost and expected code length. As an example, the authors show the i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speedier decoding of cyclic codes using chord properties

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

    Finite-field transform quantities, appearing in typical cyclic code decoders, obey conjugacy-based relationships commonly called chord properties. It is demonstrated that these relationships may be used to significantly expedite error estimation by the decoder. The resulting speed-up factor is proportional to the degree of the extension field in which the code design is specified. BCH codes and st... View full abstract»

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

    Publication Year: 1988, Page(s):877 - 880
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    The authors introduce the concept of superimposed codes in Euclidean n-space Rn. An asymptotic existence bound is derived for such codes; the proof uses the idea of random coding. In particular, the asymptotic properties of long codes are studied. It is shown that the derived existence bound differs only by a factor of four from a nonexistence bound obtained by a simpl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the bit error probability of a linear cyclic code over GF(2l) and its extended code

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

    An upper bound on the bit-error probability (BEP) of a linear cyclic code over GF(2l) with hard-decision (HD) maximum-likelihood (ML) decoding on memoryless symmetric channels is derived. Performance results are presented for Reed-Solomon codes on GF(32), GF(64), and GF(128). Also, a union upper bound on the BEP of a linear cyclic code with either hard- or soft-decision ML decoding is d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence and performance analysis of the normalized LMS algorithm with uncorrelated Gaussian data

    Publication Year: 1988, Page(s):680 - 691
    Cited by:  Papers (102)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    It is demonstrated that the normalized least mean square (NLMS) algorithm can be viewed as a modification of the widely used LMS algorithm. The NLMS is shown to have an important advantage over the LMS, which is that its convergence is independent of environmental changes. In addition, the authors present a comprehensive study of the first and second-order behavior in the NLMS algorithm. They show... 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