Several methods for classifying self-orthogonal codes up to equivalence are presented. These methods are used to classify self-orthogonal codes with largest possible minimum distance over the fields F3 and F4 for lengths n ≤ 29 and small dimensions (up to 6). Some properties of the classified codes are also presented. In particular, an extensive collection of quantum error-correcting codes is o...

We define a regularized theta lift for orthogonal groups over totally real fields generalizing work of Borcherds. The lift takes harmonic ‘Whittaker forms’ to automorphic Green functions and weakly holomorphic Whittaker forms to meromorphic modular forms on orthogonal groups with zeros and poles supported on special divisors.

This paper discusses a transform for successive pictures of an image sequence which strictly maintains orthogonality while permitting 2-hypothesis motion compensation between pairs of pictures. We extend previous work on an orthogonal transform for image sequences which uses only 1-hypothesis motion compensation between pairs of pictures. This work is motivated by the well known fact that the m...

Orthogonal and quasi-orthogonal matrices have a long history of use in digital image processing, digital and wireless communications, cryptography and many other areas of computer science and coding theory. The practical benefits of using orthogonal matrices come from the fact that the computation of inverse matrices is avoided, by simply using the transpose of the orthogonal matrix. In this pa...