2016/07/08 by Ştefan Tohǎneanu, Tohaneanu, Stefan
Computer Science · Engineering · #14N20 (Primary) 65D05 #16N40 (Secondary) #Algebraic Geometry (math.AG) #Coding theory and cryptography #Commutative Algebra (math.AC) #FOS: Mathematics #Polynomial and algebraic computation #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1607.02210
openalex publication_date 2016/07/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In these notes we show that any projective subspace arrangement can be realized as a generalized star configuration variety. This type of interpolation result may be useful in designing linear codes with prescribed codewords of minimum weight, as well as in answering a couple of questions asked by the author in previous work, about the number of equations needed to define a generalized star configuration.