Bounds on edit metric codes with combinatorial DNA constraints

The design of a large and reliable DNA codeword library is a key problem in DNA based computing. DNA codes, namely sets of fixed length edit metric codewords over the alphabet {A, C, G, T}, satisfy certain combinatorial constraints with respect to biological and chemical restrictions of DNA strands. The primary constraints that we consider are the reverse--complement constraint and the fixed GC--content constraint, as well as the basic edit distance constraint between codewords. We focus on exploring the theory underlying DNA codes and discuss several approaches to searching for optimal DNA codes. We use Conway's lexicode algorithm and an exhaustive search algorithm to produce provably optimal DNA codes for codes with small parameter values. And a genetic algorithm is proposed to search for some sub--optimal DNA codes with relatively large parameter values, where we can consider their sizes as reasonable lower bounds of DNA codes. Furthermore, we provide tables of bounds on sizes of DNA codes with length from 1 to 9 and minimum distance from 1 to 9.

Generator Matrix Based Search for Extremal Self-Dual Binary Error-Correcting Codes

Self-dual doubly even linear binary error-correcting codes, often referred to as Type II codes, are codes closely related to many combinatorial structures such as 5-designs. Extremal codes are codes that have the largest possible minimum distance for a given length and dimension. The existence of an extremal (72,36,16) Type II code is still open. Previous results show that the automorphism group of a putative code C with the aforementioned properties has order 5 or dividing 24. In this work, we present a method and the results of an exhaustive search showing that such a code C cannot admit an automorphism group Z6. In addition, we present so far unpublished construction of the extended Golay code by P. Becker. We generalize the notion and provide example of another Type II code that can be obtained in this fashion. Consequently, we relate Becker's construction to the construction of binary Type II codes from codes over GF(2^r) via the Gray map.

Construction of I-Deletion-Correcting Ternary Codes

Finding large deletion correcting codes is an important issue in coding theory. Many researchers have studied this topic over the years. Varshamov and Tenegolts constructed the Varshamov-Tenengolts codes (VT codes) and Levenshtein showed the Varshamov-Tenengolts codes are perfect binary one-deletion correcting codes in 1992. Tenegolts constructed T codes to handle the non-binary cases. However the T codes are neither optimal nor perfect, which means some progress can be established. Latterly, Bours showed that perfect deletion-correcting codes have a close relationship with design theory. By this approach, Wang and Yin constructed perfect 5-deletion correcting codes of length 7 for large alphabet size. For our research, we focus on how to extend or combinatorially construct large codes with longer length, few deletions and small but non-binary alphabet especially ternary. After a brief study, we discovered some properties of T codes and produced some large codes by 3 different ways of extending some existing good codes.

Photograph - Unidentified Male in Uniform

A photograph of a male in uniform standing in front of a horse. In background are tents and trees.

Uniforms by Alkit - Military Uniform Catalogue

A catalogue by Alkit with uniform descriptions and purchasing information for Military men and women.

Photograph - Samuel DeVeaux Woodruff in Uniform

A photograph of Samuel DeVeaux Woodruff (1894-1918) in uniform in a garden with a dog. In 1916, he was a Lieutenant in the 176th unit of the Queen’s Battalion. Samuel was engaged to Gladyse Wanita Palling, but they never married. He was killed in action on the July 13, 1918 as a member of the 116th Battalion of the Canadian Infantry (Central Ontario Regiment).

Photograph - Samuel DeVeaux Woodruff in Uniform with others

A photograph of Samuel Deveaux Woodruff in uniform, standing in a garden with three women and a man.

Photograph - Samuel DeVeaux Woodruff in Uniform with his Mother

Black and white framed photograph of Samuel D. Woodruff in uniform and his mother Georgina at the Niagara Falls Railroad Station. The reverse of the photograph reads "Sam D. Woodruff with Mother, Georgina at Niagara Falls Railroad Station 1916".