This zip archive contains improved constant weight codes constructed in the paper:
Some constant weight codes from primitive permutation groups
by Derek Smith and Roberto Montemanni (in preparation)
DNA codes satisfying the Hamming distance and reverse-complement constraints
An improved permutation code with n=13, packing radius 3 and 247104 codewords
This file contains codeword files and files of orbit representatives for the permutation codes constructed in the paper “Codes with Specified Packing Radius” by Derek H. Smith and Roberto Montemanni.
This archive contains codeword files and orbit representatives files for the
permutation codes found in the paper:
A new table of permutation codes.
by D.H. Smith and R.Montemanni.
Coding theory has several applications in Genetics and Bioengineering. This thesis concentrates on a specific application from Computational Biology. This concerns the construction of new DNA codes which satisfy certain combinatorial constraints, using an alphabet of four symbols.
This is a larger permutation code for (12,5) constructed by Smith and Montemanni.
Contains a larger permutation code for (12,4) constructed by Smith and Montemanni
The files of codewords in this file give DNA codes n-d-GC-|C| with |C| codewords of
length n, satisfying a Hamming distance constraint with minimum distance d, a reverse-complement constraint and a constant GC-content constraint.
The files of codewords in this folder give DNA codes n-d-GC-|C| with |C| codewords of
length n, satisfying a Hamming distance constraint with minimum distance d and a
constant GC-content constraint.