155 research outputs found

    Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring

    Full text link
    Reed-Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials, called skew Reed-Solomon codes, has already been introduced in the literature. In this work, we introduce a linearized version of such codes, called linearized Reed-Solomon codes. We prove that they have maximum sum-rank distance. Such distance is of interest in multishot network coding or in singleshot multi-network coding. To prove our result, we introduce new metrics defined by skew polynomials, which we call skew metrics, we prove that skew Reed-Solomon codes have maximum skew distance, and then we translate this scenario to linearized Reed-Solomon codes and the sum-rank metric. The theories of Reed-Solomon codes and Gabidulin codes are particular cases of our theory, and the sum-rank metric extends both the Hamming and rank metrics. We develop our theory over any division ring (commutative or non-commutative field). We also consider non-zero derivations, which give new maximum rank distance codes over infinite fields not considered before

    Weight-preserving isomorphisms between spaces of continuous functions: The scalar case

    Get PDF
    Let F be a finite field (or discrete) and let A andBB be vector spaces of F-valued continuous functions defined on locally compact spaces X and Y , respectively. We look at the representation of linear bijections H:A⟶B by continuous functions h:Y⟶X as weighted composition operators. In order to do it, we extend the notion of Hamming metric to infinite spaces. Our main result establishes that under some mild conditions, every Hamming isometry can be represented as a weighted composition operator. Connections to coding theory are also highlighted.The rst and third listed authors acknowledge partial support by the Generalitat Valenciana, grant code: PROMETEO/2014/062; and by Universitat Jaume I, grant P1·1B2012-05

    Construction of signal sets from quotient rings of the quaternion orders associated with arithmetic fuchsian groups

    Get PDF
    This paper aims to construct signal sets from quotient rings of the quaternion over a real number field associated with the arithmetic Fuchsian group Γ 4g , where g is the genus of the associated surface. These Fuchsian groups consist of the edge-pairing isometries of the regular hyperbolic polygons (fundamental region) P 4g , which tessellate the hyperbolic plane D 2 . The corresponding tessellations are the self-dual tessellations {4g, 4g}. Knowing the generators of the quaternion orders which realize the edge-pairings of the polygons, the signal points of the signal sets derived from the quotient rings of the quaternion orders are determined. It is shown by examples the relevance of adequately selecting the ideal in the maximal order to construct the signal sets satisfying the property of geometrical uniformity. The labeling of such signals is realized by using the mapping by set partitioning concept to solve the corresponding Diophantine equations (extreme quadratic forms). Trellis coded modulation and multilevel codes whose signal sets are derived from quotient rings of quaternion orders are considered possible applications8196050196061CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO - CNPQFUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULO - FAPESP305656/2015-52013/25977-
    corecore