Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"optimal coloring"”.

  1. Constant composition deletion correcting codes

    … codes and show that they are asymptotically optimal and form an optimal coloring. There is a natural distance on compositions that provides a lower bound on deletion distance. Unrestricted deletion correcting codes can be constructed from the union of constant composition codes as long as the …

    uiuc Repository record for Constant composition deletion correcting codes (opens in a new tab)

  2. Improved implementation of some coloring algorithms for the determination of large and sparse Jacobian matrices

    lethbridge