214 search results - page 4 / 43 » Perfect and Almost Perfect Sequences |
122
click to vote
DCC
1999
IEEE
15 years 3 months ago
1999
IEEE
We consider the space of ternary words of length n and fixed weight w with the usual Hamming distance. A sequence of perfect single error correcting codes in this space is construc...
114
click to vote
ENDM
2008
15 years 3 months ago
2008
This paper studies non-crossing geometric perfect matchings. Two such perfect matchings are compatible if they have the same vertex set and their union is also non-crossing. Our f...
110
Voted
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
The standard algorithm for alignment of DNA sequences using dynamic programming has been implemented on the Cray MTA-2 (Multithreaded Architecture-2) at ENRI (Electronic Navigatio...
CORR
2010
Springer
15 years 3 months ago
2010
Springer
One peculiarity with deletion-correcting codes is that perfect t-deletion-correcting codes of the same length over the same alphabet can have different numbers of codewords, becaus...
132
Voted
EJC
2006
15 years 3 months ago
2006
A perfect matching in a k-uniform hypergraph on n vertices, n divisible by k, is a set of n/k disjoint edges. In this paper we give a sufficient condition for the existence of a p...