By Topic

IEEE Transactions on Information Theory

Issue 6 • November 1987

Filter Results

Displaying Results 1 - 25 of 27
  • In Memorium: Yasuo Sugiyama

    Publication Year: 1987, Page(s):757 - 758
    Request permission for commercial reuse | PDF file iconPDF (280 KB)
    Freely Available from IEEE
  • Hypothesis testing with multiterminal data compression

    Publication Year: 1987, Page(s):759 - 772
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1769 KB)

    The multiterminal hypothesis testingH: XYagainstH̄: X̄Ȳis considered whereX^{n} (X̄^{n})andY^{n} (Ȳ^{n})are separately encoded at ratesR_{1}andR_{2}, respectively. The problem is to determine the minimumbeta_{n}of the second kind of error probability, under the condition that the first kind of e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conditional limit theorems under Markov conditioning

    Publication Year: 1987, Page(s):788 - 801
    Cited by:  Papers (53)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2074 KB)

    LetX_{1},X_{2},cdotsbe independent identically distributed random variables taking values in a finite setXand consider the conditional joint distribution of the first m elements of the sampleX_{1},cdots , X_{n}on the condition thatX_{1}=x_{1}and the sliding block sample average of a functionh(cdot , cdot)defined onX^{2}exceeds a thr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combinatorial structure and capacity of the permuting relay channel

    Publication Year: 1987, Page(s):813 - 826
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1463 KB)

    Blackwell's trap-door channel is an interesting example of a finite state channel. Its deterministic version, that is, the permuting channel, has been studied by Ahlswede and Kaspi ina multiterminal information-theoretic framework. They determined the capacities of permuting jammer channels and relay channels for some special cases. The capacity problem for permuting relay channels is completely s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concatenated group codes and their exponents

    Publication Year: 1987, Page(s):849 - 854
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (929 KB)

    Codes that are concatenations of group codes are considered. It is shown that whenGandHare finite groups and the inner and outer codes areG-andH-codes, respectively, then under certain conditions the concatenated code is aG times Hcode. A necessary and sufficient condition is given for aG times Hcode to have a structure as a concate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A list-type reduced-constraint generalization of the Viterbi algorithm

    Publication Year: 1987, Page(s):866 - 876
    Cited by:  Papers (89)  |  Patents (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1667 KB)

    The Viterbi algorithm (VA), an optimum decoding rule for aQ-ary trellis code of constraint lengthK, operates by taking the best survivor from each ofQ^{K-1}lists of candidates at each decoding step. A generalized VA (GVA) is proposed that makes comparisons on the basis of a label of lengthL(Lleq K). It selects, incorporating the notion of list decoding, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Locating the maximum of a simple random sequence by sequential search

    Publication Year: 1987, Page(s):877 - 881
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (419 KB)

    Consider a stationary Gaussian process withEX_{i}X_{j}=a^{|i-j|}where0 < a < 1,nd let0 < r < 1. It is shown that to locate the maximum ofX_{l}, X_{2}, cdots, X_{N}for largeNwith probabilityr, roughly-rN log a/loglog Nobservations at sequentially determined locations are both sufficient and necessary. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A differential equation related to a random telegraph wave problem--Computer calculation of series solution

    Publication Year: 1987, Page(s):882 - 888
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (663 KB)

    A method is developed for calculating the probability density functionp(y)of the output of anRCfilter when the input is a particular kind of random telegraph wave. The method makes use of a computer to determine the numerical values of the coefficients in two series solutions, one of which contains a logarithm, of a fourth-order linear differential equation. The constants of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectral estimation from nonconsecutive data

    Publication Year: 1987, Page(s):889 - 894
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    A method is presented for determining the maximum entropy spectrumS(omega)of a process under the constraint that its autocorrelationR(m)is known for everymin a setDof nonconsecutive integers. The method involves a simple steepest ascent technique that is based entirely on Levinson's algorithm. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the distribution of positive-definite Gaussian quadratic forms

    Publication Year: 1987, Page(s):895 - 906
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1494 KB)

    Quadratic signal processing is used in detection and estimation of random signals. To describe the performance of quadratic signal processing, the probability distribution of the output of the processor is needed. Only positive-definite Gaussian quadratic forms are considered. The quadratic form is diagonalized in terms of independent Gaussian variables and its mean, moment-generating function, an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A lower bound on the redundancy ofD-ary Huffman codes (Corresp.)

    Publication Year: 1987, Page(s):910 - 911
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (338 KB)

    A necessary and sufficient condition for the most likely letter of any discrete source to be coded by a single symbol with aD-ary Huffman code,2 leq D < infty, is derived. As a consequence, a lower bound on the redundancy of aD-ary Huffman code is established. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On combined symbol-and-bit error-control [4,2] codes over{0,1}^8to be used in the

    Publication Year: 1987, Page(s):911 - 917
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1235 KB)

    The construction, properties, and decoding of four nonequivalent[4,2]codes over the alphabet{0,1}^{8}are described. These codes are able to correct the following error patterns:1)error patterns containing one nonzero byte,2)error patterns containing up to three nonzero bits, and3)error patterns containing one byte erasure and at most one nonze... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New bounds on binary linear codes of dimension eight (Corresp.)

    Publication Year: 1987, Page(s):917 - 919
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (430 KB)

    Letn(k,d)be the smallest integernsuch that a binary linear code of lengthn, dimensionk, and minimum distance at leastdexists. New results are given that improve the best previously known bounds onn(8,d). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple-burst error-correcting cyclic product codes (Corresp.)

    Publication Year: 1987, Page(s):919 - 923
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (929 KB)

    LetCbe the cyclic product code ofpsingle parity check codes of relatively prime lengthsn_{1}, n_{2},cdots , n_{p} (n_{1} < n_{2} < cdots < n_{p}). It is proven thatCcan correct2^{P-2}+2^{p-3}-1bursts of lengthn_{1}, andlfloor(max{p+1, min{2^{p-s}+s-1,2^{p-s}+2^{p-s-1}}}-1)/2rfloorbursts of length... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Codes on the Klein quartic, ideals, and decoding (Corresp.)

    Publication Year: 1987, Page(s):923 - 925
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (507 KB)

    A sequence of codes with particular symmetries and with large rates compared to their minimal distances is constructed over the field GF(2^{3}). In the sequence there is, for instance, a code of length 21 and dimension10with minimal distance9, and a code of length21and dimension16with minimal distance3. The codes are constructed fro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast ML decoding algorithm for the Nordstrom - Robinson code (Corresp.)

    Publication Year: 1987, Page(s):931 - 933
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    The extended Nordstrom-Robinson code is an optimum nonlinear double-error-correcting code of length16with considerable practical importance. This code is also useful as a rate1/2vector quantizer for random waveforms such as speech linear-predictive-coding (LPC) residual. A fast decoding algorithm is described for maximum likelihood decoding (or nearest neighbor search in the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On testing for immutability of codes (Corresp.)

    Publication Year: 1987, Page(s):934 - 938
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (823 KB)

    Immutable codes have the property that information recorded with them on write-once memories such as digital optical discs cannot be changed. Write-once memory permits changing a0into a1, but once a1is written it cannot be changed back into a0. Most commonly used codes do not have the property of immutability. After a very general definition of immutabil... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some probabilistic properties of the line-of-sight angle error to a remote object (Corresp.)

    Publication Year: 1987, Page(s):938 - 942
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (651 KB)

    Closed-form expressions are derived for the distribution and the expectation of the error of the line-of-sight angle to a remote object when the rectangular position coordinates are independent identically distributed normal variates. Generalized results also are provided both for the cumulative distribution function for a hyperspace ofNdimensions and for a spherically symmetric probabi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The design of joint source and channel trellis waveform coders

    Publication Year: 1987, Page(s):855 - 865
    Cited by:  Papers (122)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1816 KB)

    The generalized Lloyd algorithm is applied to the design of joint source and channel trellis waveform coders to encode discrete-time continuous-amplitude stationary and ergodic sources operating over discrete memoryless noisy channels. Experimental results are provided for independent and autoregressive Gaussian sources, binary symmetric channels, and absolute error and squared error distortion me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The source coding theorem via Sanov's theorem (Corresp.)

    Publication Year: 1987, Page(s):907 - 909
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    A proof of Shannon's source coding theorem is given using results from large deviation theory. In particular Sanov's theorem on convergence rates for empirical distributions is invoked to obtain the key large deviation result. This result is used directly to prove the source coding theorem for discrete memoryless sources. It is then shown how this theorem can be extended to ergodic Polish space va... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gray code weighting system (Corresp.)

    Publication Year: 1987, Page(s):930 - 931
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB)

    Contrary to what has been believed, it is found that weights can be associated with different bit positions of the standard binary reflected Gray code. Therefore, two algorithms are devised for direct Gray-to-decimal and decimal-to-Gray conversions. These algorithms are much simpler than old algorithms which involve conversions to and from binary code and exclusive-OR operations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved error probability evaluation methods for direct detection optical communication systems

    Publication Year: 1987, Page(s):839 - 848
    Cited by:  Papers (42)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1384 KB)

    The problem of average error probability evaluation for direct detection binary optical communications in the presence of avalanche gain, intersymbol interference, and colored additive Gaussian noise is considered. Tight new upper and lower bounds, together with a modified Gaussian quadrature rule based on approximate moments, are derived and evaluated. The bounds are found to be much tighter than... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Encoding of correlated observations

    Publication Year: 1987, Page(s):773 - 787
    Cited by:  Papers (107)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2304 KB)

    An important class of engineering problems involves sensing an environment and making estimates based on the phenomena sensed. In the traditional model of this problem, the sensors' observations are available to the estimator without alteration. There is .growing interest in {em distributed} sensing systems in which several observations are communicated to the estimator over channels of limited ca... View full abstract»

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

    Publication Year: 1987, Page(s):802 - 812
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1776 KB)

    Information capacity is determined for the additive Gaussian channel when the constraint is given in terms of a covariance different from that of the channel noise. These results, combined with previous results on capacity when the constraint covariance is the same as the noise covariance, provide a complete and general solution for the information capacity of the Gaussian channel without feedback... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimax universal noiseless coding for unifilar and Markov sources (Corresp.)

    Publication Year: 1987, Page(s):925 - 930
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1016 KB)

    Constructive upper bounds are presented for minimax universal noiseless coding of unifilar sources without any ergodicity assumptionS. These bounds are obtained by quantizing the estimated probability distribution of source letters with respect to the relative entropy. They apply both to fixed-length to variable-length (FV) and variable-length to fixed-length (VF) codes. Unifilar sources are a gen... 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