Engineering topics

Helgert, H. J.

Publications and source records attributed to Helgert, H. J..

5 records

NASA NTRS1977

The proposed coding standard at GSFC

As part of the continuing effort to introduce standardization of spacecraft and ground equipment in satellite systems, NASA's Goddard Space Flight Center and other NASA facilities have supported the development of a set of standards for the use of error control coding in telemetry subsystems. These standards are intended to ensure compatibility between spacecraft and ground encoding equipment, while allowing sufficient flexibility to meet all anticipated mission requirements. The standards which have been developed to date cover the application of block codes in error detection and error correction modes, as well as short and long constraint length convolutional codes decoded via the Viterbi and sequential decoding algorithms, respectively. Included are detailed specifications of the codes, and their implementation. Current effort is directed toward the development of standards covering channels with burst noise characteristics, channels with feedback, and code concatenation.

Morakis, J. C.↗

NASA NTRS1975

Short constraint length rate 1/2 'quick-look' codes

Quick-look nonsystematic convolutional codes have the property that the information sequence may be recovered from the encoded sequence in straightforward fashion and with a minimum of error amplification. In this concise paper we investigate their relevant characteristics for constraint lengths less than eight and rate 1/2 and obtain a number of interesting and practically useful results. In particular, for the best of these codes, we derive their free distance and error amplification, their decoded bit error probability when used over the binary symmetric channel in conjunction with Viterbi decoding, and show how they can be employed to measure the channel bit error rate.

Helgert, H. J.↗

NASA NTRS1975

Binary primitive alternant codes

In this note we investigate the properties of two classes of binary primitive alternant codes that are generalizations of the primitive BCH codes. For these codes we establish certain equivalence and invariance relations and obtain values of d and d*, the minimum distances of the prime and dual codes.

Helgert, H. J.↗

NASA NTRS1974

Alternant codes

A class of codes defined by the parity check matrix of a linear code of minimum distance at least t + 1 is examined and the number of parity check symbols is discussed. Determinants of this type are known as alternants (Muir and Metzler, 1930); codes corresponding to such a matrix are termed alternant codes. The parity check matrix is obtained by restricting some of its elements to subfields of GF(q to the m-th power). Minimum distance and redundancy bounds are established for these codes, and some interesting equivalence and invariance properties are derived.

Helgert, H. J.↗

NASA NTRS1973

On the performance of block codes

It is important to define and evaluate measures which incorporate most, if not all, of the quantities affecting the overall system reliability. For the simple types of block codes normally employed in space communication systems, the complexity of the encoder and decoder is of little consequence, since the use of integrated circuit technology allows the construction of the basic components in an inexpensive fashion. The complexity is essentially independent of the particular code-decoder used. The processing speed is generally a function of the type of logic used and the technology in the construction of the integrated circuits.

Helgert, H. J.↗