#### Filter Results:

- Full text PDF available (30)

#### Publication Year

1995

2017

- This year (1)
- Last 5 years (12)
- Last 10 years (23)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Philippe Gaborit, Carmen-Simona Nedeloaia, Alfred Wassermann
- IEEE Transactions on Information Theory
- 2005

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)

- Ralf Gugisch, Adalbert Kerber, +4 authors Alfred Wassermann
- 2012

MOLGEN 5.x combines the efficiency of the molecular generator MOLGEN 3.5 and the flexibility of MOLGEN 4.x . To achieve this, the software was reimplemented based on a totally new concept. The most visible new features are fuzzy molecular formula input and explicit use of atom state patterns. We describe the version MOLGEN 5.0 of this new series.

- Radinka Yorgova, Alfred Wassermann
- Des. Codes Cryptography
- 2008

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)

- Patric R. J. Östergård, Alfred Wassermann
- J. Comb. Theory, Ser. A
- 2002

© 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)

- Michael Braun, Axel Kohnert, Alfred Wassermann
- IEEE Transactions on Information Theory
- 2005

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)

- Anton Betten, Adalbert Kerber, Reinhard Laue, Alfred Wassermann
- Des. Codes Cryptography
- 1998

We describe a computer search for simple designs with prescribed automor-phism groups yielding designs with parameter sets 7-In several of these cases we are able to determine the exact number of isomorphism types of designs with that prescribed automorphism group. c

- Javier de la Cruz, Michael Kiermaier, Alfred Wassermann, Wolfgang Willems
- Adv. in Math. of Comm.
- 2016

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)