
Juergen Bierbrauer 
My book: Introduction to Coding Theory appeared in 2004 Publisher: Chapman & Hall/CRC 
A family of highly symmetric codes (coauthors S. Marcugini, F. Pambianco)
(a slightly extended version of what appeared in the IEEE IT Transactions, October 2005) A family of 2weight codes related to
BCHcodes , (coauthor Yves Edel).
New code parameters from Reed Solomon
subfield codes , (coauthor Yves Edel).
Extending and lengthening BCHcodes ,
(coauthor Yves Edel).
Lengthening and the GilbertVarshamov bound
, (coauthor Yves Edel).
Some codes related to BCHcodes of low
dimension , (coauthor Yves Edel).
Inverting construction Y1 , (coauthor
Yves Edel).
Parameters for binary codes , (coauthor
Yves Edel).
Parameters for ternary codes , (coauthor
Yves Edel).
Parameters for quaternary codes ,
(coauthor Yves Edel).
The structure of some good codes ,
A geometric nonexistence proof of an extremal additive code
(coauthors S.Marcugini, F.Pambianco)
Geometric Constructions of Quantum Codes (coauthors D.Bartoli, S.Marcugini, F.Pambianco)
The spectrum of stabilizer quantum codes of distance 3
The geometry of quantum codes (coauthors G. Faina, M. Giulietti, S. Marcugini,
F. Pambianco)
Short additive quaternary codes
(coauthors E. Edel, G. Faina, S. Marcugini, F. Pambianco)
Additive quaternary codes of
small length
(coauthors G. Faina, S. Marcugini, F. Pambianco)
Cyclic additive and quantum stabilizer codes
Quantum twisted codes (coauthor
Yves Edel).
Direct constructions of additive
codes
The theory of cyclic codes and
a generalization to additive codes
Constructing good covering codes
for applications in Steganography (coauthor Jessica Fridrich)
Universal hashing and geometric codes
Authentication via algebraicgeometric
codes
Dense sphere packings from new codes,
(coauthor Yves Edel).
Construction of orthogonal arrays
Theory of perpendicular arrays
(coauthor Yves Edel).
Crooked binomials (coauthor
Gohar Kyureghyan).
New semifields, PN and APN functions
New commutative semifields and their nuclei
.
Constructive asymptotic lower bounds on
linear codes and weakly biased arrays (coauthor Holger Schellwat).
Efficient constructions of $\epsilon
$biased arrays, $\epsilon $dependent arrays and authentication codes
(coauthor Holger Schellwat).
Weakly biased arrays, weakly dependent
arrays and errorcorrecting codes (coauthor Holger Schellwat).
Almost independent and weakly biased
arrays: efficient constructions and cryptologic applications (coauthor
Holger Schellwat).
A family of caps in projective $4$space
in odd characteristic (coauthor Yves Edel).
Recursive constructions for large caps
(coauthor Yves Edel).
$41$ is the largest size of a cap in
$PG(4,4)$(coauthor Yves Edel).
The maximal size of a $3$arc in $PG(2,8).$
Large caps in small spaces (coauthor
Yves Edel).
Caps on classical varieties and their
projections (coauthors Antonello Cossidente and Yves Edel).
The largest cap in $AG(4,4)$ and its
uniqueness (coauthor Yves Edel).
Caps of order $3q^2$ in affine
$4$space in characteristic $2$ (coauthor Yves Edel).
The sporadic $A_7$geometry and the NordstromRobinson
code
Construction of digital nets from BCHcodes
, (coauthor Yves Edel).
Families of ternary (t,m,s)nets related
to BCHcodes , (coauthor Yves Edel).
Good nets in other characteristics
Codingtheoretic constructions for
$(t,m,s)$nets
and ordered orthogonal arrays (coauthors Yves Edel and W. Ch. Schmid)
A family of binary $(t,m,s)$nets
of strength $5,$ (coauthor Yves Edel)
An asymptotic GilbertVarshamov bound for tmsnets
(coauthor Wolfgang Schmid)
Families of nets of low and medium strength
(coauthor Yves Edel)
A little $(t,m,s)$bibliography
A direct approach to linear programming
bounds
Bounds on affine caps (coauthor
Yves Edel).
Bounds on orthogonal arrays and resilient
functions
A note on the duality of linear programming
bounds for orthogonal arrays and codes (coauthors K.Gopalakrishnan,
D.R.Stinson).
Orthogonal Arrays, Resilient Functions, Error Correcting
Codes and Linear Programming Bounds (coauthors K.Gopalakrishnan,
D.R.Stinson).
An infinite family of $7$designs
Projective planes, coverings and a network
problem (coauthors S. Marcugini and F. Pambianco)
Some friends of Alltop's designs
A family of 4designs with blocksize 9
MA3210: Introduction to Combinatorics
MA 4211: Information Theory/ Data
Compression
MA 462: Introduction to Group Theory
Group Theory and Applications
(lecture 2005)
Introduction to Group Theory and Applications (lecture 2000)
Here is the link to MinT, the Salzburg
database for net parameters
And here a link to A.E.Brouwer's data base of bounds for linear codes.