English
Related papers

Related papers: On the Locality of Codeword Symbols in Non-Linear …

200 papers

Non-locality stands nowadays not only as one of the cornerstones of quantum theory, but also plays a crucial role in quantum information processing. Several experimental investigations of nonlocality have been carried out over the years. In…

In this paper, for any fixed positive integers $t$ and $q>2$, we construct $q$-ary codes correcting a burst of at most $t$ deletions with redundancy $\log n+8\log\log n+o(\log\log n)+\gamma_{q,t}$ bits and near-linear encoding/decoding…

Information Theory · Computer Science 2024-05-02 Wentu Song , Kui Cai , Tony Q. S. Quek

In general, array codes consist of $m\times n$ arrays and in many cases, the arrays satisfy parity constraints along lines of different slopes (generally with a toroidal topology). Such codes are useful for RAID type of architectures, since…

Information Theory · Computer Science 2019-07-25 Mario Blaum , Steven R. Hetzler

A linear block code with dimension $k$, length $n$, and minimum distance $d$ is called a locally repairable code (LRC) with locality $r$ if it can retrieve any coded symbol by at most $r$ other coded symbols. LRCs have been recently…

Information Theory · Computer Science 2017-01-25 Mostafa Shahabinejad , Majid Khabbazian , Masoud Ardakani

Information sources used for communication purposes usually are assumed to be i.i.d. type, especially as far as entanglement or nonlocality properties are concerned. Here we proposed simple scheme for detection of nonlocality of non i.i.d.…

Quantum Physics · Physics 2009-02-13 Marcin Pawlowski , Karol Horodecki , Pawel Horodecki , Ryszard Horodecki

We experimentally show that nonlocality can be produced from single-particle contextuality by using two-particle correlations which do not violate any Bell inequality by themselves. This demonstrates that nonlocality can come from an {\em a…

In this work we present a class of locally recoverable codes, i.e. codes where an erasure at a position $P$ of a codeword may be recovered from the knowledge of the entries in the positions of a recovery set $R_P$. The codes in the class…

Information Theory · Computer Science 2021-07-29 Cícero Carvalho , Victor G. L. Neumann

We analyze in details a conditional measurement scheme based on linear optical components, feed-forward loop and homodyne detection. The scheme may be used to achieve two different tasks. On the one hand it allows the extraction of…

Quantum Physics · Physics 2007-07-04 Stefano Olivares , Matteo G. A. Paris

The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that…

Information Theory · Computer Science 2014-10-08 Zihui Liu , Jens Zumbrägel , Marcus Greferath , Xin-Wen Wu

In this paper we give constructions for infinite sequences of finite non-linear locally recoverable codes $\mathcal C\subseteq \prod\limits^N_{i=1}\mathbb F_{q_i}$ over a product of finite fields arising from basis expansions in algebraic…

Information Theory · Computer Science 2023-04-19 Andrea Ferraguti , Dorian Goldfeld , Giacomo Micheli

Depending on the way one measures, quantum nonlocality might manifest more visibly. Using basis transformations and interactions on a particle pair, Hardy logically argued that any local hidden variable theory leads to a paradox. Extended…

Quantum Physics · Physics 2023-04-18 Duc Minh Tran , Van-Duy Nguyen , Le Bin Ho , Hung Q. Nguyen

In this paper we investigate the role of local information in the decoding of the repetition and surface error correction codes for the protection of quantum states. Our key result is an improvement in resource efficiency when local…

Quantum Physics · Physics 2020-06-30 Michael Hanks , William J. Munro , Kae Nemoto

The amount of nonlocality in quantum theory is limited compared to that allowed in generalized no-signaling theory [Found. Phys. 24, 379 (1994)]. This feature, for example, gets manifested in the amount of Bell inequality violation as well…

Quantum Physics · Physics 2014-03-31 Subhadipa Das , Manik Banik , Md. Rajjak Gazi , Ashutosh Rai , Samir Kunkri

In this paper, we first generalize the class of linear codes by Ding and Ding (IEEE TIT, 61(11), pp. 5835-5842, 2015). Then we mainly study the augmented codes of this generalized class of linear codes. For one thing, we use Gaussian sums…

Information Theory · Computer Science 2024-04-30 Ziling Heng , Keqing Cao

Localized Structures often behave as quasi-particles and they may form molecules characterized by well-defined bond distances. In this paper we show that pointwise nonlocality may lead to a new kind of molecule where bonds are not rigid.…

Pattern Formation and Solitons · Physics 2017-07-26 J. Javaloyes , M. Marconi , M. Giudici

In this paper, we introduce code distances, a new family of invariants for linear codes. We establish some properties and prove bounds on the code distances, and show that they are not invariants of the matroid (for a linear block code) or…

Information Theory · Computer Science 2025-09-23 Eduardo Camps-Moreno , Elisa Gorla , Hiram H. López

We present a novel iterative decoding algorithm for Reed-Muller (RM) codes, which takes advantage of a graph representation of the code. Vertices of the considered graph correspond to codewords, with two vertices being connected by an edge…

Information Theory · Computer Science 2022-07-20 Mikhail Kamenev

Locality is a property of logics, based on Hanf's and Gaifman's theorems, and that was shown to be very useful in the context of finite model theory. In this paper I present a homotopic variation for locality, namely a Quillen model…

Category Theory · Mathematics 2020-05-20 Hendrick Maia

Linear n-local networks are compatible with quantum repeaters based entanglement distribution protocols. Different sources of imperfections such as error in entanglement generation, communication over noisy quantum channels and…

Quantum Physics · Physics 2023-03-23 Kaushiki Mukherjee , Indranil Chakrabarty , Ganesh Mylavarapu

In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinations of resource lambda-terms, from a calculus similar to Boudol's…

Logic in Computer Science · Computer Science 2010-01-20 Thomas Ehrhard
‹ Prev 1 4 5 6 7 8 10 Next ›