相关论文: On Bounded-Weight Error-Correcting Codes
The theory of error-correcting codes is concerned with constructing codes that optimize simultaneously transmission rate and relative minimum distance. These conflicting requirements determine an asymptotic bound, which is a continuous…
The doubly shortened perfect codes of length 13 are classified utilizing the classification of perfect codes in [P.R.J. \"Osterg{\aa}rd and O. Pottonen, The perfect binary one-error-correcting codes of length 15: Part I - Classification,…
There exists a large literature of construction of convolutional codes with maximal or near maximal free distance. Much less is known about constructions of convolutional codes having optimal or near optimal column distances. In this paper,…
This text contains some notes on the Griesmer bound. In particular, we give a geometric proof of the Griesmer bound for the generalized weights and show that a Solomon--Stiffler type construction attains it if the minimum distance is…
Quantum error correction is a critical component for scaling up quantum computing. Given a quantum code, an optimal decoder maps the measured code violations to the most likely error that occurred, but its cost scales exponentially with the…
The problem of finding quantum error-correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are…
We consider a neural network (NN) that may experience memory faults and computational errors. In this paper, we propose a novel real-number-based error correction code (ECC) capable of detecting and correcting both memory errors and…
We compare the performance of short-length linear binary codes on the binary erasure channel and the binary-input Gaussian channel. We use a universal decoder that can decode any linear binary block code: Gaussian-elimination based…
Locally repairable codes (LRCs) have received significant recent attention as a method of designing data storage systems robust to server failure. Optimal LRCs offer the ideal trade-off between minimum distance and locality, a measure of…
Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy…
We present a method of concatenated quantum error correction in which improved classical processing is used with existing quantum codes and fault-tolerant circuits to more reliably correct errors. Rather than correcting each level of a…
Recently, linear codes constructed by defining sets have attracted a lot of study, and many optimal linear codes with a few weights have been produced. The objective of this paper is to present a class of binary linear codes with three…
Topological quantum error correction codes are currently among the most promising candidates for efficiently dealing with the decoherence effects inherently present in quantum devices. Numerically, their theoretical error threshold can be…
The rank modulation scheme has been proposed for efficient writing and storing data in non-volatile memory storage. Error-correction in the rank modulation scheme is done by considering permutation codes. In this paper we consider codes in…
We revisit the linear programming bounds for the size vs. distance trade-off for binary codes, focusing on the bounds for the almost-balanced case, when all pairwise distances are between $d$ and $n-d$, where $d$ is the code distance and…
In this paper, based on the nonbinary graph state, we present a systematic way of constructing good non-binary quantum codes, both additive and nonadditive, for systems with integer dimensions. With the help of computer search, which…
Based on a sufficient condition proposed by Hollmann and Xiang for constructing triple-error-correcting codes, the minimum distance of a binary cyclic code $\mathcal{C}_{1,3,13}$ with three zeros $\alpha$, $\alpha^3$, and $\alpha^{13}$ of…
In this work we investigate codes in $\mathbb{Z}_{2^m}^n$ that can correct errors that occur in just one coordinate of the codeword, with a magnitude of up to a given parameter $t$. We will show upper bounds on these cross codes, derive…
We identify optimal quantum error correction codes for situations that do not admit perfect correction. We provide analytic n-qubit results for standard cases with correlated errors on multiple qubits and demonstrate significant…
In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…