Some new constructions of optimal linear codes and alphabet-optimal $(r,δ)$-locally repairable codes

In distributed storage systems, locally repairable codes (LRCs) are designed to reduce disk I/O and repair costs by enabling recovery of each code symbol from a small number of other symbols. To handle multiple node failures, $(r,\delta)$-LRCs are introduced to enable local recovery in the event of up to $\delta-1$ failed nodes. Constructing optimal $(r,\delta)$-LRCs has been a significant research topic over the past decade. In \cite{Luo2022}, Luo \emph{et al.} proposed a construction of linear codes by using unions of some projective subspaces within a projective space. Several new classes of Griesmer codes and distance-optimal codes were constructed, and some of them were proved to be alphabet-optimal $2$-LRCs. In this paper, we first modify the method of constructing linear codes in \cite{Luo2022} by considering a more general situation of intersecting projective subspaces. This modification enables us to construct good codes with more flexible parameters. Additionally, we present the conditions for the constructed linear codes to qualify as Griesmer codes or achieve distance optimality. Next, we explore the locality of linear codes constructed by eliminating elements from a complete projective space. The novelty of our work lies in establishing the locality as $(2,p-2)$, $(2,p-1)$, or $(2,p)$-locality, in contrast to the previous literature that only considered $2$-locality. Moreover, by combining analysis of code parameters and the C-M like bound for $(r,\delta)$-LRCs, we construct some alphabet-optimal $(2,\delta)$-LRCs which may be either Griesmer codes or not Griesmer codes. Finally, we investigate the availability and alphabet-optimality of $(r,\delta)$-LRCs constructed from our modified framework.