UNIVERSITY OF IDAHODEPARTMENT OF MATHEMATICS
|
|---|
| This talk revolves around
viewing any projective subspace arrangement (i.e., a
union of linear subspaces) as a generalized star
configuration. One of the main advantages of this
perspective is that we can design linear codes with
prescribed codewords of minimum weight. If time permits, I
will discuss another application of this type of
interpolation and we can answer some questions regarding
the number of equations needed to define a subspace
arrangement.
|