Po-Wei Lai

Multi-View Block Distance Distributions and Linear Programming Bounds for Locally Recoverable Codes with Availability

We develop a multi-view linear-programming framework for locally recoverable codes with arbitrary fixed availability $a$. For any retained order $1 \le s \le a$, the selected helper sets, the recovered coordinate, and their complement form an $(s+2)$-part partition. Recording the Hamming distance on all blocks preserve...