Larry H. Thiel

Learn More
The largest minimum weight of a self-dual doubly-even binary (n, k, d) code is d = 4bn/24c+ 4. Of such codes with length divisible by 24, the Golay Code is the only (24, 12, 8) code, the Extended Quadratic Residue Code is the only known (48, 24, 12) code, and there is no known (72, 36, 16) code. One may partition the search for a (48, 24, 12) self-dual(More)
The BLASTP program is a search tool for databases of protein sequences that is widely used by biologists as a first step in investigating new genome sequences. BLASTP finds high-scoring local alignments ( ) without gaps between a query sequence and sequences in the database. The score of an alignment is the sum of the scores of individual alignments between(More)
Performing an exhaustive backtrack search of combinatorial objects is always a dicey business. One can spend years of CPU time without finding anything. There is always the embarrassing question: "is the program correct?" The situation is even worse when the combinatorial object being searched for has a large symmetry group. For efficiency purposes, it is(More)
Exact and approximate algorithms for detecting lines in a two-dimensional image space are discussed. For the case of uniformly distributed noise within an image space, transform methods and different notions of probability measures governing the parameters of the transforms are described. It is shown that different quantization schemes of the transformed(More)
The weight enumerator of the binary error-correcting code generated by the rows of the incidence matrix of a projective plane of order 10 is completely determined once the numbers of code words of weight 12, 15, and 16 are known. The search for such a projective plane starting from code words of weight 16 can be divided into six cases. In his 1974 Ph.D(More)