Alfred Wassermann

Learn More
In this correspondence, we compute the weight enumerators of various quadratic residue codes over F/sub 2/ and F/sub 3/, together with certain codes of related families like the duadic and the quadratic double circulant codes. We use a parallel algorithm to find the number of codewords of a given (not too high) weight, from which we deduce by usual(More)
This paper is a very lightly edited version of an article originally written in 1989 but never fully completed. We had planned a final section to make use of the ability to change at will between the Birman-Wenzl algebra, as given by generators and relations, and the geometric framework of the tangles, so as to look in more detail at the representation(More)
© Université Bordeaux 1, 1996, tous droits réservés. L’accès aux archives de la revue « Journal de Théorie des Nombres de Bordeaux » (http://jtnb.cedram.org/) implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale.(More)
Based on ideas of Kötter and Kschischang [6] we use constant dimension subspaces as codewords in a network. We show a connection to the theory of q-analogues of a combinatorial designs, which has been studied in [1] as a purely combinatorial object. For the construction of network codes we successfully modified methods (construction with prescribed(More)
MICHAEL KIERMAIER, ALFRED WASSERMANN michael.kiermaier, alfred.wassermann@uni-bayreuth.de Mathematical Department, University of Bayreuth, D-95440 Bayreuth, GERMANY Abstract. In this paper we investigate codes over finite commutative rings R, whose generator matrices are built from α-circulant matrices. For a non-trivial ideal I < R we give a method to lift(More)
New linear codes (sometimes optimal) over the finite field with q elements are constructed. In order to do this, an equivalence between the existence of a linear code with a prescribed minimum distance and the existence of a solution of a certain system of Diophantine linear equations is used. To reduce the size of the system of equations, the search for(More)
Let Fq denote a finite field with q elements and let V = (Fq)m,n be the Fq-vector space of matrices over Fq of type (m,n). On V we define the so-called rank metric distance by d(A,B) = rank(A−B) for A,B ∈ V . Clearly, the distance d is a translation invariant metric on V . A subset C ⊆ V endowed with the metric d is called a rank metric code with minimum(More)