By Topic

IEEE Transactions on Information Theory

Issue 3 • Date May 1979

Filter Results

Displaying Results 1 - 17 of 17
  • Review of 'The Theory of Information and Coding: A Mathematical Framework for Communication' (McEliece, R. J.; 1977)

    Publication Year: 1979, Page(s):367 - 368
    Request permission for commercial reuse | PDF file iconPDF (345 KB)
    Freely Available from IEEE
  • Direct Sequence Spread Spectrum Signaling (Ph.D. Thesis abstr.)

    Publication Year: 1979, Page(s): 369
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (62 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A decision procedure for the unique decipherability of multivalued encodings (Corresp.)

    Publication Year: 1979, Page(s):356 - 360
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    It is shown that there exists an algorithm to determine whether or not a given multivalued variable-length encoding, that is, a variable-length code system in which more than one codeword may correspond to one source symbol, is uniquely decipherable. The proof is given in two steps. The problem is first reduced to a simpler one, that of determining the inclusion relation between two rather simple ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quadratic multiplexing--A new method for secure communication (Corresp.)

    Publication Year: 1979, Page(s):354 - 356
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    A secure discrete-time multiplexing technique is presented which uses a pseudorandom process with a fundamental cycle length N . The method can handle D \ll N signal sequences of length M \ll N . If all the signals have the same bandwidth, the multiplexed signal will have that bandwid... View full abstract»

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

    Publication Year: 1979, Page(s):332 - 345
    Cited by:  Papers (56)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2128 KB)

    Any symbol in a redundant code can be recovered when it belongs to certain erasure patterns. Several alternative expressions of a given symbol, to be referred to as its replicas, can therefore be computed in terms of other ones. Decoding is interpreted as decoding upon a received symbol, given itself and a number of such replicas, expressed in terms of other received symbols. For linear View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • No primitive binary t -error-correcting BCH code with t > 2 is quasi-perfect (Corresp.)

    Publication Year: 1979, Page(s):361 - 362
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (320 KB)

    Gorenstein, Peterson, and Zierler have conjectured that no t -error-correcting BCH code of length 2^{m} - 1 with t > 2 is quasi-perfect. This conjecture is proved. The covering radius of a code is defined as the smallest integer \rho such that th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-dual codes over GF(3) and GF(4) of length not exceeding 16

    Publication Year: 1979, Page(s):312 - 322
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1392 KB)

    All self-dual codes over GF(3) and GF(4) of length 16 are found. The self-dual codes of shorter length are described in a concise and systematic notation. A number of new techniques ("promotion" and "demotion," "tag olng? and "subtraction") are given for constructing codes. Finally, several new extremal self-dual codes are given which have length greater than 16. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Source coding with cross observations at the encoders (Corresp.)

    Publication Year: 1979, Page(s):360 - 361
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB)

    A source coding problem is considered which generalizes the Slepian-Wolf-Cover theorem on noiseless coding of correlated sources so as to include the case of arbitrary cross observations at the encoders. The achievable rate region is established by using Cover's result. Also a co-polymatroidal property of the relevant polytope is pointed out. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symbol synchronization in convolutionally coded systems (Corresp.)

    Publication Year: 1979, Page(s):362 - 365
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    Alternate symbol inversion is sometimes applied to the output of convolutional encoders to guarantee sufficient richness of symbol transition for the receiver symbol synchronizer. A bound is given for the length of the transition-free symbol stream in such systems, and those convolutional codes are characterized in which arbitrarily long transition free runs occur. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the distribution of computation for sequential decoding using the stack algorithm

    Publication Year: 1979, Page(s):323 - 331
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1200 KB)

    An analytical procedure is presented for generating the computational distribution for the Zigangirov-Jelinek stack algorithm. Multitype branching processes are employed to develop a procedure for estimating sequential decoding computation, without the need for simulation, but with sufficient accuracy to be a valid design tool. At information rates about the cutoff rate View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A note on optimal quantization (Corresp.)

    Publication Year: 1979, Page(s):365 - 366
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    For a general class of optimal quantizers the variance of the output is less than that of the input. Also the mean value is preserved by the quantizing operation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stationary coding of processes

    Publication Year: 1979, Page(s):283 - 291
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1448 KB)

    In 1969, Ornstein showed that two independent, identically distributed (i.i.d.) processes with the same entropy are isomorphic, that is, there is a stationary, invertible code from one onto the other. These results have led to a number of characterizations of the class of processes which are stationary codings of i.i.d, processes. Many of these ideas are now finding a use in information theory. So... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Block coding for discrete stationary d -continuous noisy channels

    Publication Year: 1979, Page(s):292 - 306
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2344 KB)

    A new class of discrete stationary noisy channels with memory and anticipation termed d-continuous channels is introduced and is shown to include all stationary discrete channels for which coding theorems exist. Roughly speaking, in a \bar{d} -continuous channel the effect of the "past" and "future" inputs on n successive outputs dies out asymptotically with ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust sequential detection of signals in noise

    Publication Year: 1979, Page(s):346 - 353
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1008 KB)

    A problem in the sequential detection of weak signals in additive noise is solved under the assumption that the unknown noise density function is a member of some known class of symmetric densities. Two general approaches to the design of receivers which are asymptotically most robust in a minimax sense are established. A comparison between the two methods is provided for the special case when the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A coding theorem for the discrete memoryless broadcast channel

    Publication Year: 1979, Page(s):306 - 311
    Cited by:  Papers (295)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    A coding theorem for the discrete memoryless broadcast channel is proved for the case where no common message is to he transmitted. The theorem is a generalization of the results of Cover and van der Meulen on this problem. The result is tight for broadcast channels having one deterministic component View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An analog scrambling scheme which does not expand bandwidth, Part I: Discrete time

    Publication Year: 1979, Page(s):261 - 274
    Cited by:  Papers (14)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1552 KB)

    The problem of scrambling a discrete-time analog sequence for the purpose of privacy encoding is studied. A large family of linear orthogonal invertible scrambling transformations is described that result in a negligible expansion of bandwidth and can therefore serve as building blocks in a secure communication system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New fidelity criteria for discrete-time source encoding

    Publication Year: 1979, Page(s):275 - 282
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1240 KB)

    A probabilistic approach to the source encoding problem requires the specification of a fidelity criterion which measures the degradation of the source output produced by the encoding transformation. Historically, the fidelity criteria generated by difference-type distortion measures have received by far the widest acceptance, due in part to their analytical tractability. Two new fidelity criteria... 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