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

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. 1967 - 15 Sep. 1968

Algorithms for convolutional codes and development of linear sequential machine

A recommended R equals 1/2, K equals 32, Quick-Look-In convolutional code for NASA use

A new R = 1/2 K = 32 quick-look-in code is described and compared to the R = 1/2 K = 32 Massey-Costello code now used in some NASA systems. The new code, has the optimum distance profile property. This new code is shown, by comparison of Fano sequential decoding performance on a simulated Gaussian noise channel, to be computationally superior to the Massey-Costello code. The new code is also shown to be superior to the Massey-Costello code according to several analytical code criteria

Another extension of the disc algebra

We identify the complex plane C with the open unit disc D={z:|z|<1} by the homeomorphism z --> z/(1+|z|). This leads to a compactification $\bar{C}$ of C, homeomorphic to the closed unit disc. The Euclidean metric on the closed unit disc induces a metric d on $\bar{C}$. We identify all uniform limits of polynomials on $\bar{D}$ with respect to the metric d. The class of the above limits is an extension of the disc algebra and it is denoted by $\bar{A}(D)$. We study properties of the elements of $\bar{A}(D)$ and topological properties of the class $\bar{A}(D)$ endowed with its natural topology. The class $\bar{A}(D)$ is different and, from the geometric point of view, richer than the class $\tilde{A}(D)$ introduced in Nestoridis (2010), Arxiv:1009.5364, on the basis of the chordal metric.Comment: 14 page

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 Quarterly progress report, 16 Feb. - 15 May 1969

Convolutional coding techniques for data protectio

Deflection resistance indicator

Instrument for nondestructively measuring compression resistance of spray foam used as thermal insulation was developed. Cylindrical indicator has probe with coil spring to provide force and indicating dial. Probe is manually pressed against area to be tested until complete foot area contacts foam surfaces