Related papers: Consistent Flag Codes
We examine an error-correcting coding framework in which each coded symbol is constrained to be a function of a fixed subset of the message symbols. With an eye toward distributed storage applications, we seek to design systematic codes…
Cyclic codes are among the most important families of codes in coding theory for both theoretical and practical reasons. Despite their prominence and intensive research on cyclic codes for over a half century, there are still open problems…
We investigate when a maximum distance separable ($MDS$) code over $F_q$ is also completely regular ($CR$). For lengths $n=q+1$ and $n=q+2$ we provide a complete classification of the $MDS$ codes that are $CR$ or at least uniformly packed…
In this paper we consider stabilizer codes over local Frobenius rings. First, we study the relative minimum distances of a stabilizer code and its reduction onto the residue field. We show that for various scenarios, a free stabilizer code…
Let $F_q$ be a finite field. A flag of $F_q$-linear codes $C_0\subsetneq C_1\subsetneq\dots\subsetneq C_s$ is said to satisfy the isometry-dual property if there exists a vector $x\in(F_q^*)^n$ such that $C_i=x\cdot C_{s-i}^\perp$, where…
In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the…
We introduce new yet easily accessible codes for elements of $GL_r(A)$ with $A$ the adelic ring of a (dimension one) function field over a finite field. They are linear codes, and coincide with classical algebraic geometry codes when $r=1$.…
In this paper, the concept of quasi-finitely separating map and quasiapproximate identity are introduced. Based on these concepts, QFS-spaces and quasicontinuous maps are defined. Properties and characterizations of QFS-spaces are explored.…
Maximum distance profile codes are characterized by the property that two trajectories which start at the same state and proceed to a different state will have the maximum possible distance from each other relative to any other…
The interrelation between the cyclic structure of an ideal, i.e., a cyclic code over Galois field $GF(q)$, $q>2$, and its classes of proportional elements is considered. This relation is used in order to define the code's weight structure.…
We show an interesting PBD-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A consequence of this PBD-closure result is that the size of optimal constant-composition codes…
Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random linear network coding. What the maximal cardinality of any constant-dimension code with finite dimension and minimum…
Sum-rank metric codes are a natural extension of both linear block codes and rank-metric codes. They have several applications in information theory, including multishot network coding and distributed storage systems. The aim of this…
Quantum simulation of fermionic systems is a leading application of quantum computers. One promising approach is to represent fermions with qubits via fermion-to-qubit mappings. In this work, we present high-distance fermion-to-qubit…
The classical family of $[n,k]_q$ Reed-Solomon codes over a field $\F_q$ consist of the evaluations of polynomials $f \in \F_q[X]$ of degree $< k$ at $n$ distinct field elements. In this work, we consider a closely related family of codes,…
{A cyclic subspace code is a union of the orbits of subspaces contained in it. In a recent paper, Gluesing-Luerssen et al. (Des. Codes Cryptogr. 89, 447-470, 2021) showed that the study of the distance distribution of a single orbit cyclic…
MDS codes are elegant constructions in coding theory and have mode important applications in cryptography, network coding, distributed data storage, communication systems et. In this study, a method is given which MDS codes are lifted to a…
In this paper we study domains in flag manifolds which are bounded in an affine chart and whose projective automorphism group acts co-compactly. In contrast to the many examples in real projective space, we will show that no examples exist…
Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes…
A multifold $1$-perfect code ($1$-perfect code for list decoding) in any graph is a set $C$ of vertices such that every vertex of the graph is at distance not more than $1$ from exactly $\mu$ elements of $C$. In $q$-ary Hamming graphs,…