Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Omar Alrabiah:

TR21-119 | 13th August 2021
Omar Alrabiah, Venkatesan Guruswami

Visible Rank and Codes with Locality

Revisions: 1

We propose a framework to study the effect of local recovery requirements of codeword symbols on the dimension of linear codes, based on a combinatorial proxy that we call "visible rank." The locality constraints of a linear code are stipulated by a matrix $H$ of $\star$'s and $0$'s (which we ... more >>>

TR19-005 | 16th January 2019
Omar Alrabiah, Venkatesan Guruswami

An Exponential Lower Bound on the Sub-Packetization of MSR Codes

An $(n,k,\ell)$-vector MDS code is a $\mathbb{F}$-linear subspace of $(\mathbb{F}^\ell)^n$ (for some field $\mathbb{F}$) of dimension $k\ell$, such that any $k$ (vector) symbols of the codeword suffice to determine the remaining $r=n-k$ (vector) symbols. The length $\ell$ of each codeword symbol is called the sub-packetization of the code. Such a ... more >>>

ISSN 1433-8092 | Imprint