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...
Ming-Hsuan Kang, Mao-Sheng Xiong, Yun-Hsuan Hsieh et al.· 0 citations
We derive linear programming (LP) bounds on the minimum distance of binary and ternary linear complementary dual (LCD) codes by imposing arithmetic constraints on their weight enumerators. Special values of the weight enumerator give finitely many Gauss phases, each of which yields linear equations in the ordinary weig...
Let $q$ be odd. The trace conic in $\mathbb{F}_{q^3}$ determines a Singer difference set in $\mathbb{F}_{q^3}^\times / \mathbb{F}_q^\times$ and a natural square-class lift to $\mathbb{F}_{q^3}^\times / \mathbb{F}_q^{\times 2}$. We study the odd multiplicative Fourier coefficients of this lift and prove that they are bo...
A polynomial-size linear programming bound for locally recoverable codes with locality parameters $(r,\delta)$, without assuming linearity is given, which has polynomially many variables and its optimum dominates the ordinary Delsarte bound.
For $q\in\set{2,3}$, we show that a $k$-dimensional linear code over the finite field $\F_q$ of order $q$ is linear complementary dual (LCD) exactly when one root-of-unity value of its weight enumerator has magnitude $q^{k/2}$. We convert the phase of this value, together with the parity type in the binary case, into e...
For generalized dihedral groups, for even prime powers $\ell$, the sharp baseline $\operatorname{sep}_\ell=d+1$ and construct connected zig-zag windows, while the order-$14$ Heawood torus satisfies $\operatorname{sep}_4=2$ and $\operatorname{csep}_4=4$.
Ming-Hsuan Kang, Yun-Hsuan Hsieh· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
