ABSTRACT
No abstract available.
Recommendations
On non-existence of perfect and nearly perfect sequences
We study the complex p-ary perfect and nearly perfect sequences where p is an odd prime and show that the existence of such sequences is equivalent to the existence of certain kinds of difference sets. Using results from difference sets, there are no p-...
Doyen-Wilson theorem for perfect hexagon triple systems
The graph consisting of the three 3-cycles (or triples) (a,b,c), (c,d,e), and (e,f,a), where a,b,c,d,e and f are distinct is called a hexagon triple. The 3-cycle (a,c,e) is called an inside 3-cycle; and the 3-cycles (a,b,c), (c,d,e), and (e,f,a) are ...
Transitive nonpropelinear perfect codes
A code is called transitive if its automorphism group (the isometry group) of the code acts transitively on its codewords. If there is a subgroup of the automorphism group acting regularly on the code, the code is called propelinear. Using Magma ...
Comments