Pasar al contenido principal

CONSTRUCCIONES Y PROPIEDADES ALGEBRAICAS PARA CODIGOS DE RED

PID2019-108668GB-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2019
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD DE ALICANTE

Resultados relacionados

Resultados totales (Incluyendo duplicados): 19
Encontrada(s) 1 página(s)

RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

State Realizations of 2-Periodic Convolutional Codes: a switching system approach

  • Fornasini, Ettore
  • Napp, Diego
  • Pereira, Ricardo
  • Pinto, Raquel
  • Rocha, Paula
  • Napp, Diego|||/items/9288f118-72b7-499a-b755-6c1aa078899c
In this work we investigate the realization problem of periodic convolutional codes. As convolutional codes are discrete linear systems over a finite field we use systems theory techniques to address our problem. In particular, we aim at deriving and studying state-space realizations of 2-periodic convolutional codes. Although one cannot expect, in general, to obtain a periodic state-space realization of a periodic convolutional code by means of the individual realizations of each of the associated time-invariant codes, we show that one can implement the periodic system switching periodically the output in each state system. Comments on the minimality of this realization are given.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Minimal State-Space Representation of Convolutional Product Codes

  • Climent, Joan-Josep
  • Napp, Diego
  • Pinto, Raquel
  • Requena Arévalo, Verónica
  • Climent, Joan-Josep|||/items/e5ad2c13-73d7-48cd-a8a0-c74efa487a1c
  • Napp, Diego|||/items/9288f118-72b7-499a-b755-6c1aa078899c
  • Requena Arévalo, Verónica|||/items/a06b702c-0c9b-4738-9391-7238d7ffc3ba
In this paper, we study product convolutional codes described by state-space representations. In particular, we investigate how to derive state-space representations of the product code from the horizontal and vertical convolutional codes. We present a systematic procedure to build such representation with minimal dimension, i.e., reachable and observable.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A matrix based list decoding algorithm for linear codes over integer residue rings

  • Napp, Diego
  • Pinto, Raquel
  • Saçıkara, Elif
  • Toste, Marisa
  • Napp, Diego|||/items/9288f118-72b7-499a-b755-6c1aa078899c
In this paper we address the problem of list decoding of linear codes over an integer residue ring Zq, where qis a power of a prime p. The proposed procedure exploits a particular matrix representation of the linear code over Zpr, called the standard form, and the p-adic expansion of the to-be-decoded vector. In particular, we focus on the erasure channel in which the location of the errors is known. This problem then boils down to solving a system of linear equations with coefficients in Zpr. From the parity-check matrix representations of the code we recursively select certain equations that a codeword must satisfy and have coefficients only in the field pr−1Zpr. This yields a step by step procedure obtaining a list of the closest codewords to a given received vector with some of its coordinates erased. We show that such an algorithm actually computes all possible erased coordinates, that is, the provided list is minimal.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Weighted Reed–Solomon convolutional codes

  • Alfarano, Gianira N.
  • Napp, Diego
  • Neri, Alessandro
  • Requena Arévalo, Verónica
  • Napp, Diego|||/items/9288f118-72b7-499a-b755-6c1aa078899c
  • Requena Arévalo, Verónica|||/items/a06b702c-0c9b-4738-9391-7238d7ffc3ba
In this paper we present a concrete algebraic construction of a novel class of convolutional codes. These codes are built upon generalized Vandermonde matrices and therefore can be seen as a natural extension of Reed–Solomon block codes to the context of convolutional codes. For this reason we call them weighted Reed–Solomon (WRS) convolutional codes. We show that under some constraints on the defining parameters these codes are Maximum Distance Profile (MDP), which means that they have the maximal possible growth in their column distance profile. We study the size of the field needed to obtain WRS convolutional codes which are MDP and compare it with the existing general constructions of MDP convolutional codes in the literature, showing that in many cases WRS convolutional codes require significantly smaller fields.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

On the construction of MRD convolutional codes

  • Napp, Diego
  • Pinto, Raquel
  • Santana, Filipa
  • Vela, Carlos
  • Napp, Diego|||/items/9288f118-72b7-499a-b755-6c1aa078899c
The problem of building optimal block codes, such as MDS codes, over small fields has been an active area of research that led to several interesting conjectures. In the context of convolutional codes, optimal constructions, such as MDS or MDP, are very rare and all require very large finite fields. In this work, we focus on the problem of constructing optimal convolutional codes with respect to the rank distance, i.e. we study the construction of Maximum Rank Distance (MRD) convolutional codes. Considering convolutional codes within a very general framework, we present concrete novel classes of MRD convolutional codes for a large set of given parameters.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Noncatastrophic convolutional codes over a finite ring

  • Napp, Diego
  • Pinto, Raquel
  • Rocha, Conceição
  • Napp, Diego|||/items/9288f118-72b7-499a-b755-6c1aa078899c
Noncatastrophic encoders are an important class of polynomial generator matrices of convolutional codes. When these polynomials have coefficients in a finite field, these encoders have been characterized as polynomial left prime matrices. In this paper, we study the notion of noncatastrophicity in the context of convolutional codes when the polynomial matrices have entries in the finite ring Zpr. In particular, we study the notion of zero left prime in order to fully characterize noncatastrophic encoders over the finite ring Zpr. The second part of the paper is devoted to investigate free and column distance of convolutional codes that are free finitely generated Zpr-modules. We introduce the notion of b-degree and provide new bounds on the free distances and column distance. We show that this class of convolutional codes is optimal with respect to the column distance and to the free distance if and only if its projection on Zp is.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Cyclic orbit flag codes

  • Alonso-González, Clementa
  • Navarro-Pérez, Miguel Ángel
  • Alonso-González, Clementa|||/items/9f8d95fb-d51b-4dd5-ab0d-20e1cc7602c2
  • Navarro-Pérez, Miguel Ángel|||/items/738e10d2-d959-4eda-98c0-aa9840a54ddc
In network coding, a flag code is a set of sequences of nested subspaces of Fnq, being Fq the finite field with q elements. Flag codes defined as orbits of a cyclic subgroup of the general linear group acting on flags of Fnq are called cyclic orbit flag codes. Inspired by the ideas in Gluesing-Luerssen et al. (Adv Math Commun 9(2):177–197, 2015), we determine the cardinality of a cyclic orbit flag code and provide bounds for its distance with the help of the largest subfield over which all the subspaces of a flag are vector spaces (the best friend of the flag). Special attention is paid to two specific families of cyclic orbit flag codes attaining the extreme possible values of the distance: Galois cyclic orbit flag codes and optimum distance cyclic orbit flag codes. We study in detail both classes of codes and analyze the parameters of the respective subcodes that still have a cyclic orbital structure.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

State representations of convolutional codes over a finite ring

  • Napp, Diego
  • Pinto, Raquel
  • Rocha, Conceição
  • Napp, Diego|||/items/9288f118-72b7-499a-b755-6c1aa078899c
In this paper we study finite support convolutional codes over Zpr by means of an input-state-output representation. We show that the set of finite weight input-state-output trajectories associated to this type of representations has the structure of a Zpr-submodule of Znpr and therefore is a (finite support) convolutional code. Fundamental system-theoretical properties such as observability, reachability or minimality, are investigated in this context.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Flag Codes: Distance Vectors and Cardinality Bounds

  • Alonso-González, Clementa
  • Navarro-Pérez, Miguel Ángel
  • Soler-Escrivà, Xaro
  • Alonso-González, Clementa|||/items/9f8d95fb-d51b-4dd5-ab0d-20e1cc7602c2
  • Navarro-Pérez, Miguel Ángel|||/items/738e10d2-d959-4eda-98c0-aa9840a54ddc
  • Soler-Escrivà, Xaro|||/items/18f99aed-92a7-4900-93bf-9f1791104428
Given Fq the finite field with q elements and an integer n > 2, a flag is a sequence of nested subspaces of Fnq and a flag code is a nonempty set of flags. In this context, the distance between flags is the sum of the corresponding subspace distances. Hence, a given flag distance value might be obtained by many different combinations. To capture such a variability, in the paper at hand, we introduce the notion of distance vector as an algebraic object intrinsically associated to a flag code that encloses much more information than the distance parameter itself. Our study of the flag distance by using this new tool allows us to provide a fine description of the structure of flag codes as well as to derive bounds for their maximum possible size once the minimum distance and dimensions are fixed.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Consistent Flag Codes

  • Alonso-González, Clementa
  • Navarro-Pérez, Miguel Ángel
  • Alonso-González, Clementa|||/items/9f8d95fb-d51b-4dd5-ab0d-20e1cc7602c2
  • Navarro-Pérez, Miguel Ángel|||/items/738e10d2-d959-4eda-98c0-aa9840a54ddc
In this paper we study flag codes on Fnq, being Fq the finite field with q elements. Special attention is given to the connection between the parameters and properties of a flag code and the ones of a family of constant dimension codes naturally associated to it (the projected codes). More precisely, we focus on consistent flag codes, that is, flag codes whose distance and size are completely determined by their projected codes. We explore some aspects of this family of codes and present examples of them by generalizing the concepts of equidistant and sunflower subspace code to the flag codes setting. Finally, we present a decoding algorithm for consistent flag codes that fully exploits the consistency condition.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

On binary linear codes and binary pseudo-random sequences

  • Cardell, Sara D.
  • Climent, Joan-Josep
  • Requena Arévalo, Verónica
  • Climent, Joan-Josep|||/items/e5ad2c13-73d7-48cd-a8a0-c74efa487a1c
  • Requena Arévalo, Verónica|||/items/a06b702c-0c9b-4738-9391-7238d7ffc3ba
In this paper, we study the relation between the linear subspace of the pseudo-noise (PN)-sequences generated by a primitive polynomial and the simplex code. This family of sequences can be also seen as an Maximum Distance Separable (MDS) F2-linear code over Fr2. Furthermore, we see how to compute the family of generalized sequences produced by a primitive polynomial by means of a first-order Reed–Muller code.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Optimum distance flag codes from spreads via perfect matchings in graphs

  • Alonso-González, Clementa
  • Navarro-Pérez, Miguel Ángel
  • Soler-Escrivà, Xaro
  • Alonso-González, Clementa|||/items/9f8d95fb-d51b-4dd5-ab0d-20e1cc7602c2
  • Navarro-Pérez, Miguel Ángel|||/items/738e10d2-d959-4eda-98c0-aa9840a54ddc
  • Soler-Escrivà, Xaro|||/items/18f99aed-92a7-4900-93bf-9f1791104428
In this paper, we study flag codes on the vector space Fnq, being q a prime power and Fq the finite field of q elements. More precisely, we focus on flag codes that attain the maximum possible distance (optimum distance flag codes) and can be obtained from a spread of Fnq. We characterize the set of admissible type vectors for this family of flag codes and also provide a construction of them based on well-known results about perfect matchings in graphs. This construction attains both the maximum distance for its type vector and the largest possible cardinality for that distance.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

List decoding of convolutional codes over integer residue rings

  • Lieb, Julia
  • Napp, Diego
  • Pinto, Raquel
  • Napp, Diego|||/items/9288f118-72b7-499a-b755-6c1aa078899c
A convolutional code Cover Zpr[D] is a Zpr[D]-submodule of Znpr[D] where Zpr[D] stands for the ring of polynomials with coefficients in Zpr. In this paper, we study the list decoding problem of these codes when the transmission is performed over an erasure channel, that is, we study how much information one can recover from a codeword w ∈ C when some of its coefficients have been erased. We do that using the p-adic expansion of wand particular representations of the parity-check polynomial matrix of the code. From these matrix polynomial representations we recursively select certain equations that w must satisfy and have only coefficients in the field pr−1Zpr. We exploit the natural block Toeplitz structure of the sliding parity-check matrix to derive a step by step methodology to obtain a list of possible codewords for a given corrupted codeword w, that is, a list with the closest codewords to w.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Flag codes of maximum distance and constructions using Singer groups

  • Navarro-Pérez, Miguel Ángel
  • Soler-Escrivà, Xaro
  • Navarro-Pérez, Miguel Ángel|||/items/738e10d2-d959-4eda-98c0-aa9840a54ddc
  • Soler-Escrivà, Xaro|||/items/18f99aed-92a7-4900-93bf-9f1791104428
In this paper we study flag codes of maximum distance. We characterize these codes in terms of, at most, two relevant constant dimension codes naturally associated to them. We do this first for general flag codes and then particularize to those arising as orbits under the action of arbitrary subgroups of the general linear group. We provide two different systematic orbital constructions of flag codes attaining both maximum distance and size. To this end, we use the action of Singer groups and take advantage of the good relation between these groups and Desarguesian spreads, as well as the fact that they act transitively on lines and hyperplanes.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

On Generalized Galois Cyclic Orbit Flag Codes

  • Alonso-González, Clementa
  • Navarro-Pérez, Miguel Ángel
  • Alonso-González, Clementa|||/items/9f8d95fb-d51b-4dd5-ab0d-20e1cc7602c2
  • Navarro-Pérez, Miguel Ángel|||/items/738e10d2-d959-4eda-98c0-aa9840a54ddc
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, by focusing this time on the generating flag. More precisely, we examine those ones whose generating flag has at least one subfield among its subspaces. In this situation, two important families arise: the already known Galois flag codes, in case we have just fields, or the generalized Galois flag codes in other case. We investigate the parameters and properties of the latter ones and explore the relationship with their underlying Galois flag code.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Weight-2 input sequences of 1/n convolutional codes from linear systems point of view

  • Herranz, Victoria
  • Napp, Diego
  • Perea, Carmen
  • Napp, Diego|||/items/9288f118-72b7-499a-b755-6c1aa078899c
Convolutional codes form an important class of codes that have memory. One natural way to study these codes is by means of input state output representations. In this paper we study the minimum (Hamming) weight among codewords produced by input sequences of weight two. In this paper, we consider rate 1/n and use the linear system setting called (A,B,C,D) input-state-space representations of convolutional codes for our analysis. Previous results on this area were recently derived assuming that the matrix A, in the input-state-output representation, is nonsingular. This work completes this thread of research by treating the nontrivial case in which A is singular. Codewords generated by weight-2 inputs are relevant to determine the effective free distance of Turbo codes.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

State-Space Realizations of Periodic Convolutional Codes

  • Fornasini, Ettore
  • Napp, Diego
  • Pereira, Ricardo
  • Pinto, Raquel
  • Rocha, Paula
  • Napp, Diego|||/items/9288f118-72b7-499a-b755-6c1aa078899c
Convolutional codes are discrete linear systems over a finite field and can be defined as F[d]-modules, where F[d] is the ring of polynomials with coefficient in a finite field F. In this paper we study the algebraic properties of periodic convolutional codes of period 2 and their representation by means of input-state-output representations. We show that they can be described as F[d2]-modules and present explicit representation of the set of equivalent encoders. We investigate their state-space representation and present two different but equivalent types of state-space realizations for these codes. These novel representations can be implemented by realizing two linear time-invariant systems separately and switching the input (or the output) that is entering (or leaving) the system. We investigate their minimality and provide necessary and also sufficient conditions in terms of the reachability and observability properties of the two linear systems involved. The ideas presented here can be easily generalized for codes with period larger than 2.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

An orbital construction of optimum distance flag codes

  • Alonso-González, Clementa
  • Navarro-Pérez, Miguel Ángel
  • Soler-Escrivà, Xaro
  • Alonso-González, Clementa|||/items/9f8d95fb-d51b-4dd5-ab0d-20e1cc7602c2
  • Navarro-Pérez, Miguel Ángel|||/items/738e10d2-d959-4eda-98c0-aa9840a54ddc
  • Soler-Escrivà, Xaro|||/items/18f99aed-92a7-4900-93bf-9f1791104428
Flag codes are multishot network codes consisting of sequences of nested subspaces (flags) of a vector space Fnq, where q is a prime power and Fq, the finite field of size q. In this paper we study the construction on F2kq of full flag codes having maximum distance (optimum distance full flag codes) that can be endowed with an orbital structure provided by the action of a subgroup of the general linear group. More precisely, starting from a subspace code of dimension k and maximum distance with a given orbital description, we provide sufficient conditions to get an optimum distance full flag code on F2kq having an orbital structure directly induced by the previous one. In particular, we exhibit a specific orbital construction with the best possible size from an orbital construction of a planar spread on F2kq that strongly depends on the characteristic of the field.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A new rank metric for convolutional codes

  • Almeida, Paulo
  • Napp, Diego
  • Napp, Diego|||/items/9288f118-72b7-499a-b755-6c1aa078899c
Let F[D] be the polynomial ring with entries in a finite field F. Convolutional codes are submodules of F[D]n that can be described by left prime polynomial matrices. In the last decade there has been a great interest in convolutional codes equipped with a rank metric, called sum rank metric, due to their wide range of applications in reliable linear network coding. However, this metric suits only for delay free networks. In this work we continue this thread of research and introduce a new metric that overcomes this restriction and therefore is suitable to handle more general networks. We study this metric and provide characterizations of the distance properties in terms of the polynomial matrix representations of the convolutional code. Convolutional codes that are optimal with respect to this new metric are investigated and concrete constructions are presented. These codes are the analogs of Maximum Distance Profile convolutional codes in the context of network coding. Moreover, we show that they can be built upon a class of superregular matrices, with entries in an extension field, that preserve their superregularity properties even after multiplication with some matrices with entries in the ground field.