Engineering topics
Publications and source records attributed to Baumert, L. D..
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.
In a previous paper Pierce considered the problem of optical communication from a novel viewpoint, and concluded that performance will likely be limited by issues of coding complexity rather than by thermal noise. This paper reviews the model proposed by Pierce and presents some results on the analysis and design of codes for this application.
The performance of certain block codes on a Gaussian channel is evaluated. The BCH codes are markedly superior to convolutional codes currently used for deep space missions. The algorithm is used to derive results, which provides a basis for a simple, almost optimum procedure for decoding these codes.
The design of an optimal merged keycode data base information retrieval system is detailed. A probability distribution of n-bit binary words that minimized false drops was developed for the case where the set of desired records was a subset of tagged records.
Using a general decoding technique of Solomon we evaluate the performance of certain block codes on a Gaussian channel. Quadratic residue codes of lengths 48 and 80 as well as BCH codes of length 128 and rates 1/2 and 1/3 are considered. All four of these codes perform quite favorably with respect to the constraint-length 7 rate 1/2 convolutional code presently used on NASA's Mariner-class spacecraft.
Techniques of combinational algebra and computer simulation are combined to determine the number of weight 22 codewords in the (128,64) BCH code which is being studied for use on future deep-space missions.
A general technique, called decoding with multipliers, is presented that can be used to decode any linear code. The technique is applied to the (48,24) quadratic residue code and yields the first known practical decoding algorithm for this powerful code.
A technique proposed by Chase (1972) is used to evaluate the performance of several fairly long binary block codes on a wideband additive Gaussian channel. Considerations leading to the use of Chase's technique are discussed. Chase's concepts are first applied to the most powerful practical class of binary codes, the BCH codes with Berlekamp's (1972) decoding algorithm. Chase's algorithm is then described along with proposed selection of candidate codes. Results are presented of applying Chase's algorithm to four binary codes: (23, 12) Golay code, (32, 16) second-order Reed-Muller code, (63, 36) 5-error correcting BCH code, and (95, 39) 9-error correcting shortened BCH code. It is concluded that there are many block codes of length not exceeding 100 with extremely attractive maximum likelihood decoding performance on a Gaussian channel. BCH codes decoded via Berlekamp's binary decoding algorithm and Chase's idea are close to being practical competitors to short-constraint length convolutional codes with Viterbi decoding.
Difference set D of k distinct residues, extending Hall search with negative results, discussing multipliers, polynomial congruence, etc
Cyclotomic numbers of order 18 with applications to difference sets
Five-variable extreme copositive quadratic forms, presenting previously unknown forms for application to inequality theory and block design analysis
Extreme points of copositive quadratic forms constituting closed convex cone in Euclidean space
Truth tables used to determine feedback logic in direct and indirect logic sequence generators
Uniform binary codes with special correlation including transorthogonality and simplex code, Hadamard matrices and difference sets uniform binary codes with special correlation including transorthogonality and simplex code, Hadamard matrices and difference sets
Construction of three types of pseudonoise /PN/ SEQUENCES /two-level autocorrelation sequences/ which give rise to simplex codes
Tabulated data provides phase shifting of sequences information for facilitating design of synchronous digital machines