We first describe linear error-correcting codes, and show how many of their most important properties are determined by their associated matroids . We also introduce the simplicial complex of the independent sets of a matroid. We then proceed to study flags of linear codes, and recall the definition of demi-matroids, and how such demi-matroids associated to flags can describe important properties ...

There exists a local classification of finite-dimensional Lie algebras of vector fields in two complex dimensions. We lift the Lie algebras from this classification to three complex dimensions.

The main notion behind the study of matroids is linear dependence. In this thesis, we give a survey of the concepts and properties of linear error-correcting codes over finite fields being dependent only on the matroids derived from these codes. In particular, the weight distributions of linear codes, and their extensions, over bigger fields are only dependent on the N-graded Betti numbers of these ...

The use of elliptic curves in cryptography was suggested independently by Neal Koblitz and Victor Miller in 1985. Being a relatively new field, there is still a lot of ongoing research on the subject, but elliptic curve cryptography, or ECC for short, has already been implemented in real-life applications. Its strength was proved in 2003 when the U.S. National Security Agency adopted ECC for protecting ...