A repair of the Faure–Loidreau (FL) public-key code-based cryptosystem is proposed. The FL cryptosystem is based on the hardness of list decoding Gabidulin codes which are special rank-metric codes. We prove that the structural attack on the system by Gaborit et al. is equivalent to decoding an interleaved Gabidulin code. Since all known polynomial-time decoders for these codes fail for a large...

We propose a new class of error-correcting dynamic codes in two and three dimensions that has no explicit connection to any parent subsystem code. The two-dimensional code, which we call the CSS Floquet is geometrically similar honeycomb code by Hastings Haah, also dynamically embeds an instantaneous toric However, unlike it possesses structure its gauge checks do not form Nevertheless, show ou...

Over any discrete memoryless channel, we build codes such that: for one, their block error probabilities and code rates scale like random codes'; two, encoding decoding complexities polar codes'. Quantitatively, constants $\pi,\rho>0$ that $\pi+2\rho<1$, construct a sequence of correction with length $N$ approaching infinity, probability $\exp(-N^\pi)$, rate $N^{-\rho}$ less than the Shannon ca...

Motivated by large-scale multimedia applications we propose to learn mappings from high-dimensional data to binary codes that preserve semantic similarity. Binary codes are well suited to large-scale applications as they are storage efficient and permit exact sub-linear kNN search. The framework is applicable to broad families of mappings, and uses a flexible form of triplet ranking loss. We ov...