English
Related papers

Related papers: Fractional decoding of algebraic geometry codes ov…

200 papers

Power decoding is a partial decoding paradigm for arbitrary algebraic geometry codes for decoding beyond half the minimum distance, which usually returns the unique closest codeword, but in rare cases fails to return anything. The original…

Algebraic Geometry · Mathematics 2021-05-20 Sven Puchinger , Johan Rosenkilde , Grigory Solomatov

Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead. Recent advances have shown that by jointly decoding logical qubits in algorithms composed of transversal gates, the number…

Surface codes are quantum error correcting codes normally defined on 2D arrays of qubits. In this paper, we introduce a surface code design based on the fact that the severity of bit flip and phase flip errors in the physical quantum…

Series of maximum distance quantum error-correcting codes are developed and analysed. For a given rate and given error-correction capability, quantum error-correcting codes with these specifications are constructed. The codes are explicit…

Information Theory · Computer Science 2020-04-14 Ted Hurley , Donny Hurley , Barry Hurley

We introduce a new class of circuits for constructing efficiently decodable error-correction codes, based on a recently discovered contractible tensor network. We perform an in-depth study of a particular example that can be thought of as…

Quantum Physics · Physics 2013-12-18 Andrew J. Ferris , David Poulin

In the framework quotient algebra partition, a general methodology is introduced to construct fault tolerant encodes for an arbitrary action in an error-correcting code.

Quantum Physics · Physics 2019-12-06 Zheng-Yao Su , Ming-Chung Tsai

We give a recursive decoding algorithm for projective Reed-Muller codes making use of a decoder for affine Reed-Muller codes. We determine the number of errors that can be corrected in this way, which is the current highest for decoders of…

Information Theory · Computer Science 2026-02-27 Rodrigo San-José

The development of algorithmic fractal dimensions in this century has had many fruitful interactions with geometric measure theory, especially fractal geometry in Euclidean spaces. We survey these developments, with emphasis on connections…

Computational Complexity · Computer Science 2020-07-29 Jack H. Lutz , Elvira Mayordomo

Efficient and accurate decoding of quantum error-correcting codes is essential for fault-tolerant quantum computation, however, it is challenging due to the degeneracy of errors, the complex code topology, and the large space for logical…

Quantum Physics · Physics 2025-03-28 Hanyan Cao , Feng Pan , Dongyang Feng , Yijia Wang , Pan Zhang

Quantum error correction, which utilizes logical qubits that are encoded as redundant multiple physical qubits to find and correct errors in physical qubits, is indispensable for practical quantum computing. Surface code is considered to be…

Machine Learning · Computer Science 2025-09-15 Hoshitaro Ohnishi , Hideo Mukai

In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family…

Information Theory · Computer Science 2012-06-08 Elisa Gorla , Felice Manganiello , Joachim Rosenthal

We describe the theory of quantum convolutional error correcting codes. These codes are aimed at protecting a flow of quantum information over long distance communication. They are largely inspired by their classical analogs which are used…

Quantum Physics · Physics 2007-05-23 H. Ollivier , J. -P. Tillich

Fractional calculus is a generalization of classical theories of integration and differentiation to arbitrary order (i.e., real or complex numbers). In the last two decades, this new mathematical modeling approach has been widely used to…

Logic in Computer Science · Computer Science 2016-08-10 Umair Siddique , Osman Hasan , Sofiène Tahar

This paper addresses the gradient coding and coded matrix multiplication problems in distributed optimization and coded computing. We present a numerically stable binary coding method which overcomes the drawbacks of the \textit{Fractional…

Information Theory · Computer Science 2025-01-14 Neophytos Charalambides , Hessam Mahdavifar , Alfred O. Hero

We suggest a technique for constructing lower (existence) bounds for the fault-tolerant threshold to scalable quantum computation applicable to degenerate quantum codes with sublinear distance scaling. We give explicit analytic expressions…

Quantum Physics · Physics 2015-08-05 Ilya Dumer , Alexey A. Kovalev , Leonid P. Pryadko

We consider a two-dimensional quantum memory of qubits on a torus which encode the extended Fibonaccistring-net code, and devise strategies for error correction when those qubits are subjected to depolarizing noise.Building on the concept…

Quantum Physics · Physics 2021-04-12 Alexis Schotte , Guanyu Zhu , Lander Burgelman , Frank Verstraete

Frame permutation quantization (FPQ) is a new vector quantization technique using finite frames. In FPQ, a vector is encoded using a permutation source code to quantize its frame expansion. This means that the encoding is a partial ordering…

Information Theory · Computer Science 2015-03-24 Ha Q. Nguyen , Vivek K Goyal , Lav R. Varshney

When data is stored, compressed, or communicated through a media such as cable or air, sources of noise and other parameters such as EMI, crosstalk, and distance can considerably affect the reliability of these data. Error detection and…

Information Theory · Computer Science 2016-11-18 Naima Kaabouch , Aparna Dhirde , Saleh Faruque

There are many resources useful for processing images, most of them freely available and quite friendly to use. In spite of this abundance of tools, a study of the processing methods is still worthy of efforts. Here, we want to discuss the…

Computer Vision and Pattern Recognition · Computer Science 2015-04-08 Amelia Carolina Sparavigna

Polar codes based on $2\times2$ non-binary kernels are discussed in this work. The kernel over $\text{GF}(q)$ is selected by maximizing the polarization effect and using Monte-Carlo simulation. Belief propagation (BP) and successive…

Information Theory · Computer Science 2018-12-04 Peihong Yuan , Fabian Steiner