Alfred Wassermann

According to our database1, Alfred Wassermann authored at least 47 papers between 1995 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On strongly walk regular graphs, triple sum sets and their codes.
Des. Codes Cryptogr., February, 2023

Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161).
Dagstuhl Reports, 2023

On the minimum number of minimal codewords.
Adv. Math. Commun., 2023

2022
On the classification of unitals on 28 points of low rank.
Appl. Algebra Eng. Commun. Comput., 2022

2021
Majority Logic Decoding With Subspace Designs.
IEEE Trans. Inf. Theory, 2021

Search for Combinatorial Objects Using Lattice Algorithms - Revisited.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021

2020
The Lengths of Projective Triply-Even Binary Codes.
IEEE Trans. Inf. Theory, 2020

2019
The classification of Steiner triple systems on 27 points with 3-rank 24.
Des. Codes Cryptogr., 2019

Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6.
Des. Codes Cryptogr., 2019

One-step Majority-logic Decoding with Subspace Designs.
CoRR, 2019

A subspace code of size 333 in the setting of a binary q-analog of the Fano plane.
Adv. Math. Commun., 2019

2018
Disjoint <i>q</i>-Steiner systems in dimension 13.
Electron. Notes Discret. Math., 2018

New Lower Bounds for Binary Constant-Dimension Subspace Codes.
Exp. Math., 2018

A new series of large sets of subspace designs over the binary field.
Des. Codes Cryptogr., 2018

The order of the automorphism group of a binary q -analog of the Fano plane is at most two.
Des. Codes Cryptogr., 2018

Preface to the special issue on network coding and designs.
Des. Codes Cryptogr., 2018

2017
On Classifying Steiner Triple Systems by Their 3-Rank.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2017

2016
New Upper Bounds on Binary Linear Codes and a Z<sub>4</sub> -Code With a Better-Than-Linear Gray Image.
IEEE Trans. Inf. Theory, 2016

The automorphism group of an extremal [120, 60, 24] code does not contain elements of order 29.
Des. Codes Cryptogr., 2016

Tables of subspace codes.
CoRR, 2016

Editorial.
Adv. Math. Commun., 2016

Algebraic structures of MRD codes.
Adv. Math. Commun., 2016

2014
Large sets of t-designs over finite fields.
J. Comb. Theory, Ser. A, 2014

2013
Towards the classification of self-dual bent functions in eight variables.
Des. Codes Cryptogr., 2013

2012
Minimum Weights and Weight Enumerators of BBZ<sub>4</sub>-Linear Quadratic Residue Codes.
IEEE Trans. Inf. Theory, 2012

2011
On the minimum diameter of plane integral point sets.
Ars Comb., 2011

2010
New binary singly even self-dual codes.
IEEE Trans. Inf. Theory, 2010

Construction of Codes for Network Coding
CoRR, 2010

Automatic Calculation of Plane Loci Using Gröbner Bases and Integration into a Dynamic Geometry System.
Proceedings of the Automated Deduction in Geometry - 8th International Workshop, 2010

2009
Construction of binary and ternary self-orthogonal linear codes.
Discret. Appl. Math., 2009

2008
Simple 8-(31, 12, 3080), 8-(40, 12, 16200) and 8-(40, 12, 16520) designs from PSL(3, 5) and PSL(4, 3).
Discret. Math., 2008

Binary self-dual codes with automorphisms of order 23.
Des. Codes Cryptogr., 2008

On the minimum Lee distance of quadratic residue codes over ℤ44.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2006
Construction of self-orthogonal linear codes.
Electron. Notes Discret. Math., 2006

2005
On the weight enumerators of duadic and quadratic residue codes.
IEEE Trans. Inf. Theory, 2005

On two doubly even self-dual binary codes of length 160 and minimum weight 24.
IEEE Trans. Inf. Theory, 2005

Optimal linear codes from matrix groups.
IEEE Trans. Inf. Theory, 2005

New Results on Codes with Covering Radius 1 and Minimum Distance 2.
Des. Codes Cryptogr., 2005

2002
A New Lower Bound for the Football Pool Problem for Six Matches.
J. Comb. Theory, Ser. A, 2002

Attacking the Market Split Problem with Lattice Point Enumeration.
J. Comb. Optim., 2002

1999
New t-designs and large sets of t-designs.
Discret. Math., 1999

Graphical t-designs via polynomial Kramer-Mesner matrices.
Discret. Math., 1999

A Steiner 5-Design on 36 Points.
Des. Codes Cryptogr., 1999

Simple 8-(40, 11, 1440) Designs.
Discret. Appl. Math., 1999

1998
Simple 8-Designs with Small Parameters.
Des. Codes Cryptogr., 1998

1996
{0, 1}-Solutions of Integer Linear Equation Systems.
Proceedings of the Parallel Virtual Machine, 1996

1995
The Discovery of Simple 7-Designs with Automorphism Group PTL (2, 32).
Proceedings of the Applied Algebra, 1995


  Loading...