相关论文: Decoding of scroll codes

Quantum error correction is indispensable to achieving reliable quantum computation. When quantum information is encoded redundantly, a larger Hilbert space is constructed using multiple physical qubits, and the computation is performed…

We construct and analyze an explicit basis for the homology of the boolean complex of a Coxeter system. This gives combinatorial meaning to the spheres in the wedge sum describing the homotopy type of the complex. We assign a set of…

Degeneration of modules is usually defined geometrically, but due to results of Zwara and Riedtmann we can also define it in terms of exact sequences. This definition also works over fields that are not algebraically closed. Let $k$ be a…

Working over imperfect fields, we give a comprehensive classification of genus-one curves that are regular but not geometrically regular, extending the known case of geometrically reduced curves. The description is given intrinsically, in…

In this article, we present a new construction of codes from algebraic curves. Given a curve over a non-prime finite field, the obtained codes are defined over a subfield. We call them Cartier Codes since their construction involves the…

Vector bundles and double vector bundles, or $2$-fold vector bundles, arise naturally for instance as base spaces for algebraic structures such as Lie algebroids, Courant algebroids and double Lie algebroids. It is known that all these…

We obtain a new coding and decoding method using the generalized Pell $(p,i)$ -numbers. The relations among the code matrix elements, error detection and correction have been established for this coding theory. We give two new blocking…

We give a general method to construct MDS one-dimensional convolutional codes. Our method generalizes previous constructions of H. Gluesing-Luerssen and B. Langfeld. Moreover we give a classification of one-dimensional Convolutional Goppa…

We show that on a generic curve, a bundle obtained by successive extensions is stable. We compute the dimension of the set of such extensions. We use degeneration methods specializing the curve to a chain of elliptic components

A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…

We present an algorithm for error correction in topological codes that exploits modern machine learning techniques. Our decoder is constructed from a stochastic neural network called a Boltzmann machine, of the type extensively used in deep…

In this work, we introduce convolutional codes for network-error correction in the context of coherent network coding. We give a construction of convolutional codes that correct a given set of error patterns, as long as consecutive errors…

Flag codes that are orbits of a cyclic subgroup of the general linear group acting on flags of a vector space over a finite field, are called cyclic orbit flag codes. In this paper we present a new contribution to the study of such codes…

Every encoding has priori information if the encoding represents any semantic information of the unverse or object. Encoding means mapping from the unverse to the string or strings of digits. The semantic here is used in the model-theoretic…

The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder. We approach this conjecture by investigating classes of label decoders defined…

The degree sequence of a graph is a numerical method to characterize the properties of graphs. Generalized forms of degree sequences exist for complete graphs and complete graphs. Nikolopolus et al. characterized the number of spanning…

We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…

Constrained sequence codes have been widely used in modern communication and data storage systems. Sequences encoded with constrained sequence codes satisfy constraints imposed by the physical channel, hence enabling efficient and reliable…

Vectors fields defined on surfaces constitute relevant and useful representations but are rarely used. One reason might be that comparing vector fields across two surfaces of the same genus is not trivial: it requires to transport the…

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…