Convolutional coding techniques for data protection Quarterly progress report, 16 May - 15 Aug. 1969

General inverses for linear sequential circuits and continuous dynamical system

Convolutional coding techniques for data protection

Results of research on the use of convolutional codes in data communications are presented. Convolutional coding fundamentals are discussed along with modulation and coding interaction. Concatenated coding systems and data compression with convolutional codes are described

Convolutional coding techniques for data protection Final report, 16 Sep. 1967 - 15 Sep. 1968

Algorithms for convolutional codes and development of linear sequential machine

Convolutional coding techniques for data protection Quarterly progress report, 16 Nov. 1968 - 15 Feb. 1969

Convolutional coding techniques for data protectio

Convolutional coding techniques for data protection Final report, 16 Sep. 1968 - 15 Sep. 1969

Convolutional coding techniques for data protectio

Comparison of rate one-half, equivalent constraint length 24, binary convolutional codes for use with sequential decoding on the deep-space channel

Virtually all previously-suggested rate 1/2 binary convolutional codes with KE = 24 are compared. Their distance properties are given; and their performance, both in computation and in error probability, with sequential decoding on the deep-space channel is determined by simulation. Recommendations are made both for the choice of a specific KE = 24 code as well as for codes to be included in future coding standards for the deep-space channel. A new result given in this report is a method for determining the statistical significance of error probability data when the error probability is so small that it is not feasible to perform enough decoding simulations to obtain more than a very small number of decoding errors

Capacity, cutoff rate, and coding for a direct-detection optical channel

It is shown that Pierce's pulse position modulation scheme with 2 to the L pulse positions used on a self-noise-limited direct detection optical communication channel results in a 2 to the L-ary erasure channel that is equivalent to the parallel combination of L completely correlated binary erasure channels. The capacity of the full channel is the sum of the capacities of the component channels, but the cutoff rate of the full channel is shown to be much smaller than the sum of the cutoff rates. An interpretation of the cutoff rate is given that suggests a complexity advantage in coding separately on the component channels. It is shown that if short-constraint-length convolutional codes with Viterbi decoders are used on the component channels, then the performance and complexity compare favorably with the Reed-Solomon coding system proposed by McEliece for the full channel. The reasons for this unexpectedly fine performance by the convolutional code system are explored in detail, as are various facets of the channel structure

Euler Obstruction and Defects of Functions on Singular Varieties

Several authors have proved Lefschetz type formulae for the local Euler obstruction. In particular, a result of this type is proved in [BLS].The formula proved in that paper turns out to be equivalent to saying that the local Euler obstruction, as a constructible function, satisfies the local Euler condition (in bivariant theory) with respect to general linear forms. The purpose of this work is to understand what prevents the local Euler obstruction of satisfying the local Euler condition with respect to functions which are singular at the considered point. This is measured by an invariant (or ``defect'') of such functions that we define below. We give an interpretation of this defect in terms of vanishing cycles, which allows us to calculate it algebraically. When the function has an isolated singularity, our invariant can be defined geometrically, via obstruction theory. We notice that this invariant unifies the usual concepts of {\it the Milnor number} of a function and of the {\it local Euler obstruction} of an analytic set.Comment: 18 page