Search arXiv⌕ Search

arXiv · 2609.39230

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

Abstract

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 preserves both compatibility among the selected repair alternatives and their coupling with the remaining coordinates. The resulting joint distribution satisfies centered counting identities, product-Krawtchouk positivity, and collision inequalities from the local-distance condition; for fixed $s$, these constraints give a polynomial-size relaxation for arbitrary, possibly nonlinear, codes over any finite field. Retaining one view recovers the three-block model of our companion paper. We develop the first genuinely multi-view case, $s=2$, in detail and specialize the exact computations to availability $a=2$. The resulting four-block LP projects to both the one-view three-block model and a globally conditioned two-view relaxation, making explicit the information lost by each coarsening. Exact rational primal-dual certificates together with checked constructions prove $M_{\max}(2,8,4,2,2,2)=8$, $M_{\max}(3,7,3,2,2,2)=27$, and $M_{\max}(4,7,3,2,2,2)=64$; in all three cases the four-block bound is strictly stronger than both coarsenings.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ming-Hsuan Kang, Maosheng Xiong, Yu Hsuan Hsieh, Po-Wei Lai. 2026-09-30. Multi-View Block Distance Distributions and Linear Programming Bounds for Locally Recoverable Codes with Availability. https://arxiv.org/abs/2609.39230

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A Two-Term Ziv-Zakai Bound for Multitarget DoA Estimation in MIMO Radar

Multitarget direction of arrival (DoA) estimation is challenging when fluctuating targets are closely spaced: local Cramér--Rao bounds (CRBs) miss global errors, while direct vector Ziv--Zakai bound (ZZB) evaluation is computationally demanding. For colocated multiple-input multiple-output (MIMO) radar with Swerling-II fluctuations and an ordered angular prior, we derive a rigorous two-term Bayesian mean squared error lower bound. A finite separation contribution addresses nonlocal discrimination, while a correction based on the prior averaged Fisher information matrix (FIM) retains target coupling and virtual array geometry. We show that the prior averaged pointwise CRB diverges under unrestricted target spacing when the FIM is nonsingular almost everywhere, although the proposed bound remains finite. Once the averaged FIM is obtained, evaluation avoids displacement optimization and multidimensional binary error integration. The bound supports analysis of snapshot diversity, target spacing, and transmit and receive allocation. Numerical comparison with the vector ZZB shows close agreement at low SNR but greater conservatism at high SNR, quantifying the tradeoff in tightness.

cs.IT↗

Graphical Analysis of Lifted Product Code Constructions

Lifted product codes are an important family of quantum low-density parity-check (QLDPC) codes, as they were the first QLDPC code family shown to be asymptotically good. Understanding the structure of their parity-check matrices $H_{\mathsf{X}}$ and $H_{\mathsf{Z}}$, as well as the associated Tanner graphs, is essential for analyzing their decoding behavior and error-floor performance. In this work, we show that the Tanner graphs of $H_{\mathsf{X}}$ and $H_{\mathsf{Z}}$ are indeed isomorphic, and investigate their graph-theoretical structure. We establish conditions ensuring the connectivity of these graphs and provide bounds on their minimal absorbing sets, providing new insight into the combinatorial structures influencing decoding performance.

cs.IT↗

The Gaussian Multiuser Channel Capacity Region

This work characterizes a Gaussian multiuser-channel capacity-region using receiver-subset message atoms, Gaussian single-user equivalents, and successive decoding. A memoryless multiuser-channel model specifies both the channel conditional distribution and the independent-use input distribution. For all linear Gaussian channels, independent Gaussian user signaling and receiver-local worst-case-noise/MMSE-GDFE transformations provide a single-user-equivalent basis for the complete capacity-region construction. Each user distributes its input autocorrelation among a finite set of receiver-subset atoms, whose rate sums satisfy the applicable receiver constraints. Minimum-energy and weighted-rate-sum designs optimize these allocations, while fixed-allocation linear programs determine feasible atomic rates and synchronized time-shared successive-decoding implementations. The resulting framework includes Gaussian multiple-access, broadcast, and interference channels, with numerical examples illustrating their rate regions and receiver designs.

cs.IT↗