![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Alfred Wassermann
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j37]Romar dela Cruz, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
On the minimum number of minimal codewords. Adv. Math. Commun. 17(2): 333-341 (2023) - [j36]Michael Kiermaier
, Sascha Kurz, Patrick Solé, Michael Stoll, Alfred Wassermann:
On strongly walk regular graphs, triple sum sets and their codes. Des. Codes Cryptogr. 91(2): 645-675 (2023) - [i8]Lucia Moura, Anamari Nakic, Patric R. J. Östergård, Alfred Wassermann, Charlene Weiß:
Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161). Dagstuhl Reports 13(4): 40-57 (2023) - 2022
- [j35]Vladimir D. Tonchev, Alfred Wassermann:
On the classification of unitals on 28 points of low rank. Appl. Algebra Eng. Commun. Comput. 33(6): 903-913 (2022) - 2021
- [j34]Romar dela Cruz
, Alfred Wassermann
:
Majority Logic Decoding With Subspace Designs. IEEE Trans. Inf. Theory 67(1): 179-186 (2021) - [c7]Alfred Wassermann
:
Search for Combinatorial Objects Using Lattice Algorithms - Revisited. IWOCA 2021: 20-33 - 2020
- [j33]Thomas Honold, Michael Kiermaier
, Sascha Kurz
, Alfred Wassermann
:
The Lengths of Projective Triply-Even Binary Codes. IEEE Trans. Inf. Theory 66(5): 2713-2716 (2020)
2010 – 2019
- 2019
- [j32]Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
A subspace code of size 333 in the setting of a binary q-analog of the Fano plane. Adv. Math. Commun. 13(3): 457-475 (2019) - [j31]Daniel Heinlein
, Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6. Des. Codes Cryptogr. 87(2-3): 375-391 (2019) - [j30]Dieter Jungnickel
, Spyros S. Magliveras, Vladimir D. Tonchev
, Alfred Wassermann:
The classification of Steiner triple systems on 27 points with 3-rank 24. Des. Codes Cryptogr. 87(4): 831-839 (2019) - [i7]Alfred Wassermann:
One-step Majority-logic Decoding with Subspace Designs. CoRR abs/1907.03344 (2019) - 2018
- [j29]Simon R. Blackburn, Marcus Greferath, Camilla Hollanti, Mario-Osvin Pavcevic, Joachim Rosenthal
, Leo Storme
, Ángeles Vázquez-Castro, Alfred Wassermann:
Preface to the special issue on network coding and designs. Des. Codes Cryptogr. 86(2): 237-238 (2018) - [j28]Michael Kiermaier, Sascha Kurz, Alfred Wassermann
:
The order of the automorphism group of a binary q -analog of the Fano plane is at most two. Des. Codes Cryptogr. 86(2): 239-250 (2018) - [j27]Michael Kiermaier, Reinhard Laue, Alfred Wassermann:
A new series of large sets of subspace designs over the binary field. Des. Codes Cryptogr. 86(2): 251-268 (2018) - [j26]Michael Braun, Patric R. J. Östergård, Alfred Wassermann:
New Lower Bounds for Binary Constant-Dimension Subspace Codes. Exp. Math. 27(2): 179-183 (2018) - [j25]Michael Braun, Alfred Wassermann:
Disjoint q-Steiner systems in dimension 13. Electron. Notes Discret. Math. 65: 23-29 (2018) - [i6]Thomas Honold, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
The lengths of projective triply-even binary codes. CoRR abs/1812.05957 (2018) - 2017
- [c6]Dieter Jungnickel, Spyros S. Magliveras, Vladimir D. Tonchev
, Alfred Wassermann:
On Classifying Steiner Triple Systems by Their 3-Rank. MACIS 2017: 295-305 - [i5]Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
A subspace code of size 333 in the setting of a binary q-analog of the Fano plane. CoRR abs/1708.06224 (2017) - 2016
- [j24]Javier de la Cruz, Michael Kiermaier, Alfred Wassermann, Wolfgang Willems:
Algebraic structures of MRD codes. Adv. Math. Commun. 10(3): 499-510 (2016) - [j23]Adalbert Kerber, Michael Kiermaier, Reinhard Laue, Mario-Osvin Pavcevic, Alfred Wassermann:
Editorial. Adv. Math. Commun. 10(3): i-ii (2016) - [j22]Javier de la Cruz, Michael Kiermaier, Alfred Wassermann:
The automorphism group of an extremal [120, 60, 24] code does not contain elements of order 29. Des. Codes Cryptogr. 78(3): 693-702 (2016) - [j21]Michael Kiermaier, Alfred Wassermann
, Johannes Zwanzger:
New Upper Bounds on Binary Linear Codes and a Z4 -Code With a Better-Than-Linear Gray Image. IEEE Trans. Inf. Theory 62(12): 6768-6771 (2016) - [i4]Daniel Heinlein, Michael Kiermaier, Sascha Kurz, Alfred Wassermann:
Tables of subspace codes. CoRR abs/1601.02864 (2016) - 2015
- [i3]Javier de la Cruz, Michael Kiermaier, Alfred Wassermann, Wolfgang Willems:
Algebraic structures of MRD Codes. CoRR abs/1502.02711 (2015) - [i2]Michael Kiermaier, Alfred Wassermann, Johannes Zwanzger:
New upper bounds on binary linear codes and a ℤ4-code with a better-than-linear Gray image. CoRR abs/1503.03394 (2015) - 2014
- [j20]Michael Braun, Axel Kohnert, Patric R. J. Östergård, Alfred Wassermann:
Large sets of t-designs over finite fields. J. Comb. Theory A 124: 195-202 (2014) - 2013
- [j19]Thomas Feulner, Lin Sok, Patrick Solé, Alfred Wassermann:
Towards the classification of self-dual bent functions in eight variables. Des. Codes Cryptogr. 68(1-3): 395-406 (2013) - 2012
- [j18]Michael Kiermaier, Alfred Wassermann:
Minimum Weights and Weight Enumerators of BBZ4-Linear Quadratic Residue Codes. IEEE Trans. Inf. Theory 58(7): 4870-4883 (2012) - 2011
- [j17]Sascha Kurz, Alfred Wassermann:
On the minimum diameter of plane integral point sets. Ars Comb. 101: 265-287 (2011) - 2010
- [j16]Masaaki Harada, Michael Kiermaier, Alfred Wassermann, Radinka Yorgova:
New binary singly even self-dual codes. IEEE Trans. Inf. Theory 56(4): 1612-1617 (2010) - [c5]Michael Gerhäuser, Alfred Wassermann:
Automatic Calculation of Plane Loci Using Gröbner Bases and Integration into a Dynamic Geometry System. Automated Deduction in Geometry 2010: 68-77 - [i1]Andreas-Stephan Elsenhans, Axel Kohnert, Alfred Wassermann:
Construction of Codes for Network Coding. CoRR abs/1005.2839 (2010)
2000 – 2009
- 2009
- [j15]Axel Kohnert, Alfred Wassermann:
Construction of binary and ternary self-orthogonal linear codes. Discret. Appl. Math. 157(9): 2118-2123 (2009) - 2008
- [j14]Radinka Yorgova, Alfred Wassermann:
Binary self-dual codes with automorphisms of order 23. Des. Codes Cryptogr. 48(2): 155-164 (2008) - [j13]Reinhard Laue, Alfred Wassermann:
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. 308(2-3): 166-174 (2008) - [c4]Michael Kiermaier, Alfred Wassermann:
On the minimum Lee distance of quadratic residue codes over ℤ44. ISIT 2008: 2617-2619 - 2006
- [j12]Alfred Wassermann, Axel Kohnert:
Construction of self-orthogonal linear codes. Electron. Notes Discret. Math. 27: 105 (2006) - 2005
- [j11]Patric R. J. Östergård, Jörn Quistorff, Alfred Wassermann:
New Results on Codes with Covering Radius 1 and Minimum Distance 2. Des. Codes Cryptogr. 35(2): 241-250 (2005) - [j10]Philippe Gaborit, Carmen-Simona Nedeloaia, Alfred Wassermann:
On the weight enumerators of duadic and quadratic residue codes. IEEE Trans. Inf. Theory 51(1): 402-407 (2005) - [j9]Marten van Dijk
, Sebastian Egner, Marcus Greferath, Alfred Wassermann:
On two doubly even self-dual binary codes of length 160 and minimum weight 24. IEEE Trans. Inf. Theory 51(1): 408-411 (2005) - [j8]Michael Braun, Axel Kohnert, Alfred Wassermann:
Optimal linear codes from matrix groups. IEEE Trans. Inf. Theory 51(12): 4247-4251 (2005) - 2004
- [c3]Philippe Gaborit, Carmen-Simona Nedeloaia, Alfred Wassermann:
Weight enumerators of duadic and quadratic residue codes. ISIT 2004: 485 - 2002
- [j7]Alfred Wassermann:
Attacking the Market Split Problem with Lattice Point Enumeration. J. Comb. Optim. 6(1): 5-16 (2002) - [j6]Patric R. J. Östergård, Alfred Wassermann:
A New Lower Bound for the Football Pool Problem for Six Matches. J. Comb. Theory A 99(1): 175-179 (2002)
1990 – 1999
- 1999
- [j5]Anton Betten
, Reinhard Laue, Alfred Wassermann:
Simple 8-(40, 11, 1440) Designs. Discret. Appl. Math. 95(1-3): 109-114 (1999) - [j4]Anton Betten
, Reinhard Laue, Alfred Wassermann:
A Steiner 5-Design on 36 Points. Des. Codes Cryptogr. 17(1-3): 181-186 (1999) - [j3]Anton Betten, Mikhail H. Klin, Reinhard Laue, Alfred Wassermann:
Graphical t-designs via polynomial Kramer-Mesner matrices. Discret. Math. 197-198: 83-109 (1999) - [j2]Anton Betten, Reinhard Laue, Alfred Wassermann:
New t-designs and large sets of t-designs. Discret. Math. 197-198: 111-121 (1999) - 1998
- [j1]Anton Betten, Adalbert Kerber, Reinhard Laue, Alfred Wassermann:
Simple 8-Designs with Small Parameters. Des. Codes Cryptogr. 15(1): 5-27 (1998) - 1996
- [c2]Anton Betten, Alfred Wassermann:
{0, 1}-Solutions of Integer Linear Equation Systems. PVM 1996: 311-314 - 1995
- [c1]Anton Betten, Adalbert Kerber, Axel Kohnert, Reinhard Laue, Alfred Wassermann:
The Discovery of Simple 7-Designs with Automorphism Group PTL (2, 32). AAECC 1995: 131-145
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint