Related papers: Perfect single error-correcting codes in the Johns…
We study perfect $2$-coloring of the Johnson graphs $J(n,3)$ associated with the third largest eigenvalue and symmetric quotient matrix, which exists only when $n \in \{6, 10\}$. We survey the known constructions in the case $n=6$, give a…
Linear programming bounds provide an elegant method to prove optimality and uniqueness of an (n,N,t) spherical code. However, this method does not apply to the parameters (4,10,1/6). We use semidefinite programming bounds instead to show…
We introduce a convergent iterative algorithm for finding the optimal coding and decoding operations for an arbitrary noisy quantum channel. This algorithm does not require any error syndrome to be corrected completely, and hence also finds…
The Fibonacci cube of dimension n, denoted as $\Gamma$ n , is the subgraph of the n-cube 5 Q n induced by vertices with no consecutive 1's. Ashrafi and his co-authors proved the non-existence of perfect codes in $\Gamma$ n for n $\ge$ 4. As…
A promising approach to overcome decoherence in quantum computing schemes is to perform active quantum error correction using topology. Topological subsystem codes incorporate both the benefits of topological and subsystem codes, allowing…
We address the open problem of establishing the rate region for exact-repair regenerating codes for given parameters (n,k,d). Tian determined the rate region for a (4,3,3) code and found that it lies strictly within the functional-repair…
We design a non-commutative version of the Peterson-Gorenstein-Zierler decoding algorithm for a class of codes that we call skew RS codes. These codes are left ideals of a quotient of a skew polynomial ring, which endow them of a sort of…
We initiate study of the Terwilliger algebra and related semidefinite programming techniques for the conjugacy scheme of the symmetric group Sym$(n)$. In particular, we compute orbits of ordered pairs on Sym$(n)$ acted upon by conjugation…
Extended $1$-perfect codes in the Hamming scheme $H(n,q)$ can be equivalently defined as codes that turn to $1$-perfect codes after puncturing in any coordinate, as completely regular codes with certain intersection array, as uniformly…
If $N={q^k}{n^2}$ is an odd perfect number given in Eulerian form, then the Descartes-Frenicle-Sorli conjecture predicts that $k=1$. Brown has recently announced a proof for the inequality $q < n$, and a partial proof that $q^k < n$ holds…
The maximum operational range of continuous variable quantum key distribution protocols has shown to be improved by employing high-efficiency forward error correction codes. Typically, the secret key rate model for such protocols is…
A family of perfect matchings of $K_{2n}$ is $t$-$intersecting$ if any two members share $t$ or more edges. We prove for any $t \in \mathbb{N}$ that every $t$-intersecting family of perfect matchings has size no greater than $(2(n-t) -…
Locally repairable codes (LRCs) are error correcting codes used in distributed data storage. Besides a global level, they enable errors to be corrected locally, reducing the need for communication between storage nodes. There is a close…
Quantum error correcting codes have a distance parameter, conveying the minimum number of single spin errors that could cause error correction to fail. However, the success thresholds of finite per-qubit error rate that have been proven for…
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries about the object, even if the data structure has been…
Non-overlapping codes have been studied for almost 60 years. In such a code, no proper, non-empty prefix of any codeword is a suffix of any codeword. In this paper, we study codes in which overlaps of certain specified sizes are forbidden.…
Cyclic codes are an important subclass of linear codes with wide applications in communication systems and data storage systems. In 2013, Ding and Helleseth presented nine open problems on optimal ternary cyclic codes $\mathcal{C}_{(1,e)}$.…
Quantum error correcting codes protect quantum information, allowing for large quantum computations provided that physical error rates are sufficiently low. We combine post-selection with surface code error correction through the use of a…
The existence of quantum error correcting codes is one of the most counterintuitive and potentially technologically important discoveries of quantum information theory. However, standard error correction refers to abstract quantum…
Let L be a Desarguesian 2-spread in the Grassmann graph $J_q(n,2)$. We prove that the collection of the 4-subspaces, which do not contain subspaces from L is a completely regular code in $J_q(n,4)$. Similarly, we construct a completely…