By Topic

Information Theory, IEEE Transactions on

Issue 6 • Date November 1987

Filter Results

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

    Publication Year: 1987 , Page(s): 757 - 758
    Save to Project icon | Request Permissions | PDF file iconPDF (280 KB)  
    Freely Available from IEEE
  • Codes on the Klein quartic, ideals, and decoding (Corresp.)

    Publication Year: 1987 , Page(s): 923 - 925
    Cited by:  Papers (14)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (520 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 dimension 10 with minimal distance 9 , and a code of length 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 (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (832 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 a 0 into a 1 , but once a 1 is written it cannot be changed back into a 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 mean square error of reduced-order estimators for nonlinear processes (Corresp.)

    Publication Year: 1987 , Page(s): 942 - 943
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (280 KB)  

    A lower bound on the mean square error of any reduced-order estimator for a given nonlinear process, in continuous or discrete time, is derived. The bound can be calculated from any pair of lower and upper bounds on the optimal error covariance. 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
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (664 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 of N dimensions and for a s... 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)
    Save to Project icon | Request Permissions | 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.
  • Capacity of the mismatched Gaussian channel

    Publication Year: 1987 , Page(s): 802 - 812
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | 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.
  • A lower bound on the redundancy of D -ary Huffman codes (Corresp.)

    Publication Year: 1987 , Page(s): 910 - 911
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (352 KB)  

    A necessary and sufficient condition for the most likely letter of any discrete source to be coded by a single symbol with a D -ary Huffman code, 2 \leq D < \infty , is derived. As a consequence, a lower bound on the redundancy of a D -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.
  • The source coding theorem via Sanov's theorem (Corresp.)

    Publication Year: 1987 , Page(s): 907 - 909
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | 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.
  • On the distribution of positive-definite Gaussian quadratic forms

    Publication Year: 1987 , Page(s): 895 - 906
    Cited by:  Papers (10)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1504 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.
  • Gray code weighting system (Corresp.)

    Publication Year: 1987 , Page(s): 930 - 931
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | 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.
  • Combinatorial structure and capacity of the permuting relay channel

    Publication Year: 1987 , Page(s): 813 - 826
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1472 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.
  • A list-type reduced-constraint generalization of the Viterbi algorithm

    Publication Year: 1987 , Page(s): 866 - 876
    Cited by:  Papers (67)  |  Patents (21)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1680 KB)  

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

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hypothesis testing with multiterminal data compression

    Publication Year: 1987 , Page(s): 759 - 772
    Cited by:  Papers (26)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1784 KB)  

    The multiterminal hypothesis testing H: XY against \overline{H}: \overline{X}\overline{Y} is considered where X^{n} (\overline{X}^{n}) and Y^{n} (\overline{Y}^{n}) are separately encoded at rates R_{1} and... 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 (32)
    Save to Project icon | Request Permissions | 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.
  • Multiple-burst error-correcting cyclic product codes (Corresp.)

    Publication Year: 1987 , Page(s): 919 - 923
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (944 KB)  

    Let C be the cyclic product code of p single parity check codes of relatively prime lengths n_{1}, n_{2},\cdots , n_{p} (n_{1} < n_{2} < \cdots < n_{p}) . It is proven that C can correct 2^{P-2}+2^{p-3}-1 burst... 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 (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (944 KB)  

    Codes that are concatenations of group codes are considered. It is shown that when G and H are finite groups and the inner and outer codes are G- and H- codes, respectively, then under certain conditions the concatenated code is a 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 (4)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (736 KB)  

    A method is presented for determining the maximum entropy spectrum S(\omega ) of a process under the constraint that its autocorrelation R(m) is known for every m in a set D of nonconsecutive integers. The method involves a simple steepest ascent ... 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 (11)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (448 KB)  

    The extended Nordstrom-Robinson code is an optimum nonlinear double-error-correcting code of length 16 with considerable practical importance. This code is also useful as a rate 1/2 vector quantizer for random waveforms such as speech linear-predictive-coding (LPC) residual. A fast decoding algorithm is described for max... 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 (30)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (2088 KB)  

    Let X_{1},X_{2},\cdots be independent identically distributed random variables taking values in a finite set X and consider the conditional joint distribution of the first m elements of the sample X_{1},\cdots , X_{n} on the condition that X_{1}=x_{...
							<a href= 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 (77)
    Save to Project icon | Request Permissions | 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.
  • The design of joint source and channel trellis waveform coders

    Publication Year: 1987 , Page(s): 855 - 865
    Cited by:  Papers (106)  |  Patents (2)
    Save to Project icon | Request Permissions | 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.
  • Optimal quantizer design for noisy channels: An approach to combined source - channel coding

    Publication Year: 1987 , Page(s): 827 - 838
    Cited by:  Papers (160)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (1744 KB)  

    We present an analysis of the zero-memory quantization of memoryless sources when the quantizer output is to be encoded and transmitted across a noisy channel. Necessary conditions for the joint optimization of the quantizer and the encoder/decoder pair are presented, and an iterative algorithm for obtaining a locally optimum system is developed. The performance of this locally optimal system, obt... 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 (11)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (440 KB)  

    Let n(k,d) be the smallest integer n such that a binary linear code of length n , dimension k , and minimum distance at least d exists. New results are given that improve the best previously known bounds on 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 (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (672 KB)  

    A method is developed for calculating the probability density function p(y) of the output of an RC filter 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 f... 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