Jürgen Bierbrauer

According to our database1, Jürgen Bierbrauer authored at least 57 papers between 1985 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Optimal Additive Quaternary Codes of Low Dimension.
IEEE Trans. Inf. Theory, 2021

2020
Additive Quaternary Codes Related to Exceptional Linear Quaternary Codes.
IEEE Trans. Inf. Theory, 2020

2018
A family of semifields in odd characteristic.
Des. Codes Cryptogr., 2018

2017
A combinatorial construction of an M<sub>12</sub>-invariant code.
Electron. Notes Discret. Math., 2017

The Pace code, the Mathieu group M<sub>12</sub> and the small Witt design S(5, 6, 12).
Discret. Math., 2017

2016
Projective polynomials, a projection construction and a family of semifields.
Des. Codes Cryptogr., 2016

2015
The nonexistence of an additive quaternary [15, 5, 9]-code.
Finite Fields Their Appl., 2015

2014
The structure of quaternary quantum caps.
Des. Codes Cryptogr., 2014

2013
All the Stabilizer Codes of Distance 3.
IEEE Trans. Inf. Theory, 2013

A Bound on Permutation Codes.
Electron. J. Comb., 2013

2011
The Nonexistence of a [[13, 5, 4]]-Quantum Stabilizer Code.
IEEE Trans. Inf. Theory, 2011

Commutative semifields from projection mappings.
Des. Codes Cryptogr., 2011

2010
A geometric non-existence proof of an extremal additive code.
J. Comb. Theory, Ser. A, 2010

New semifields, PN and APN functions.
Des. Codes Cryptogr., 2010

2009
Short Additive Quaternary Codes.
IEEE Trans. Inf. Theory, 2009

A family of crooked functions.
Des. Codes Cryptogr., 2009

The non-existence of a [[13,5,4]] quantum stabilizer code
CoRR, 2009

New Commutative Semifields and Their Nuclei.
Proceedings of the Applied Algebra, 2009

2008
Constructing Good Covering Codes for Applications in Steganography.
Trans. Data Hiding Multim. Secur., 2008

Crooked binomials.
Des. Codes Cryptogr., 2008

2007
Nordstrom-Robinson code and A<sub>7</sub>-geometry.
Finite Fields Their Appl., 2007

A direct approach to linear programming bounds for codes and tms-nets.
Des. Codes Cryptogr., 2007

Cyclic Additive and Quantum Stabilizer Codes.
Proceedings of the Arithmetic of Finite Fields, First International Workshop, 2007

2006
The smallest size of a complete cap in PG(3, 7).
Discret. Math., 2006

2005
A family of highly symmetric codes.
IEEE Trans. Inf. Theory, 2005

A Family of Binary (<i>t</i>, <i>m</i>, <i>s</i>)-Nets of Strength 5.
Des. Codes Cryptogr., 2005

Introduction to coding theory.
Discrete mathematics and its applications, Chapman & Hall, ISBN: 978-1-58488-421-7, 2005

2004
Caps of order 3q<sup>2</sup> in affine 4-space in characteristic 2.
Finite Fields Their Appl., 2004

2003
The Largest Cap in <i>AG</i>(4, 4) and Its Uniqueness.
Des. Codes Cryptogr., 2003

Projective Planes, Coverings and a Network Problem.
Des. Codes Cryptogr., 2003

2002
The Theory of Cyclic Codes and a Generalization to Additive Codes.
Des. Codes Cryptogr., 2002

2001
Caps on Classical Varieties and their Projections.
Eur. J. Comb., 2001

An infinite family of 7-designs.
Discret. Math., 2001

Large Caps in Small Spaces.
Des. Codes Cryptogr., 2001

2000
New linear codes over 𝔽<sub>9</sub>.
Australas. J Comb., 2000

Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications.
Proceedings of the Advances in Cryptology, 2000

1999
Some codes related to BCH-codes of low dimension.
Discret. Math., 1999

41 is the Largest Size of a Cap in PG(4, 4).
Des. Codes Cryptogr., 1999

Weakly biased arrays, almost independent arrays and error-correcting codes.
Proceedings of the Codes and Association Schemes, 1999

1998
Inverting Construction Y<sub>1</sub>.
IEEE Trans. Inf. Theory, 1998

1997
Lengthening and the Gilbert-Varshamov bound.
IEEE Trans. Inf. Theory, 1997

New code parameters from Reed-Solomon subfield codes.
IEEE Trans. Inf. Theory, 1997

Universal Hashing and Geometric Codes.
Des. Codes Cryptogr., 1997

1996
Orthogonal Arrays, Resilient Functions, Error-Correcting Codes, and Linear Programming Bounds.
SIAM J. Discret. Math., 1996

Some t-Homogeneous Sets of Permutations.
Des. Codes Cryptogr., 1996

1995
A new family of 4-designs.
Graphs Comb., 1995

A family of 4-designs with block size 9.
Discret. Math., 1995

A<sup>2</sup> Codes from Universal Hash Classes.
Proceedings of the Advances in Cryptology, 1995

1994
A family of perpendicular arrays achieving perfect 4-fold secrecy.
Discret. Math., 1994

Bounds for Resilient Functions and Orthogonal Arrays.
Proceedings of the Advances in Cryptology, 1994

1993
On Families of Hash Functions via Geometric Codes and Concatenation.
Proceedings of the Advances in Cryptology, 1993

1992
Designs with block-size 6 in projective planes of characteristic 2.
Graphs Comb., 1992

1991
Weighted arcs, the finite radon transform and a Ramsey problem.
Graphs Comb., 1991

Halving PGL(2, 2<sup>f</sup>), f odd: A Series of Cryptocodes.
Des. Codes Cryptogr., 1991

Some Highly Symmetric Authentication Perpendicular Arrays.
Des. Codes Cryptogr., 1991

1986
Ramsey Numbers for the Path with Three Edges.
Eur. J. Comb., 1986

1985
On generalized Ramsey numbers for trees.
Comb., 1985


  Loading...