Pasar al contenido principal

PROPIEDADES ALGEBRAICAS DE CODIGOS DE SUBESPACIOY CODIGOS CUANTICOSPROPIEDADES ALGEBRAICAS DE CODIGOS DE SUBESPACIOY CODIGOS CUANTICOS

PID2022-142159OB-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2022
Plan Estatal 2021-2023 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): 13
Encontrada(s) 1 página(s)

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

Equivalence for flag codes

  • 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
Given a finite field Fq and a positive integer n, a flagis a sequence of nested Fq-subspaces of a vector space Fnq and a flag code is a nonempty collection of flags. The projected codes of a flag code are the constant dimension codes containing all the subspaces of prescribed dimensions that form the flags in the flag code. In this paper we address the notion of equivalence for flag codes and explore in which situations such an equivalence can be reduced to the equivalence of the corresponding projected codes. In addition, this study leads to new results concerning the automorphism group of certain families of flag codes, some of them also introduced in this paper.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

On the existence of non-catastrophic p-encoders of (2, 1) convolutional codes over Zp2

  • Napp, Diego
  • Pinto, Raquel
  • Rocha, Conceição
  • Napp, Diego|||/items/9288f118-72b7-499a-b755-6c1aa078899c
In this work, we analyze the problem of catastrophicity of encoders of convolutional codes over the Laurent series with coefficients in Zpr, Zpr((d)). Kuijper and Pinto proved in [M. Kuijper and R. Pinto, On minimality of convolutional ring encoders, IEEE Trans. Autom. Control55(11) (2009) 4890–4897] that, contrary to what happens for codes over F((d)), where F is a field, when dealing with Zpr((d)) there are convolutional codes that do not admit non-catastrophic encoders. Nevertheless it was conjectured that any catastrophic convolutional code admits another type of non-catastrophic encoder called p-encoder. In this paper we solve this conjecture for a class of (2,1) convolutional codes over Zp2 and show that, in fact, these codes always admit a non-catastrophic p-encoder. We also describe a constructive procedure that allows us to obtain a non-catastrophic p-encoder.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A new algebraic approach to binary sequences and Boolean functions

  • Cardell, Sara D.
  • Fúster Sabater, Amparo
  • Requena Arévalo, Verónica
  • Beltrá, Miguel
  • Requena Arévalo, Verónica|||/items/a06b702c-0c9b-4738-9391-7238d7ffc3ba
  • Beltrá, Miguel|||/items/ddb05652-1531-4c02-b7bf-dcfa43c15e82
Boolean functions and binary sequences are fundamental tools in cryptography. In this work, we introduce a new bijection between the set of Boolean functions and the set of binary sequences whose period is a power of two. This correspondence enables the study of properties of Boolean functions through binary sequences and vice versa. Building on this connection, we propose a novel algebraic description, derived from the algebraic normal form of Boolean functions, which we call the reverse-ANF. Then, we explore how this formulation relates both to existing representations of Boolean functions and to binary sequences. Moreover, several cryptographic properties are examined through this new approach. Finally, we analyse generalized self-shrunken sequences from the perspective of Boolean functions, highlighting several properties that emerge under these different frameworks.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Superregular Matrices over Finite Fields

  • Almeida, Paulo
  • Beltrá, Miguel
  • Napp, Diego
  • Beltrá, Miguel|||/items/ddb05652-1531-4c02-b7bf-dcfa43c15e82
  • Napp, Diego|||/items/9288f118-72b7-499a-b755-6c1aa078899c
A trivially zero minor of a matrix is a minor having all its terms in the Leibniz formula equal to zero. A matrix is superregular if all of its minors that are not trivially zero are nonzero. In the area of Coding Theory, superregular matrices over finite fields are connected with codes with optimum error correcting capabilities. There are two types of superregular matrices that yield two different types of codes. One has in all of its entries a nonzero element, and these are called full superregular matrices. The second interesting class of superregular matrices is formed by lower triangular Toeplitz matrices. In contrast to full superregular matrices, all general constructions of these matrices require very large field sizes. In this work, we investigate the construction of lower triangular Toeplitz superregular matrices over small finite prime fields. Instead of computing all possible minors, we study the structure of finite fields in order to reduce the possible nonzero minors. This allows us to restrict the huge number of possibilities that one needs to check and come up with novel constructions of superregular matrices over relatively small fields. Finally, we present concrete examples of lower triangular Toeplitz superregular matrices of sizes up to 10.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A new invariant for 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 the network coding framework, given a prime power q and the vector space Fnq, a constant type flag code is a set of nested sequences of Fq-subspaces (flags) with the same increasing sequence of dimensions (the type of the flag). If a flag code arises as the orbit under the action of a cyclic subgroup of the general linear group over a flag, we say that it is a cyclic orbit flag code. Among the parameters of such a family of codes, we have its best friend, that is the largest field over which all the subspaces in the generating flag are vector spaces. This object permits to compute the cardinality of the code and estimate its minimum distance. However, as it occurs with other absolute parameters of a flag code, the information given by the best friend is not complete in many cases due to the fact that it can be obtained in different ways. In this work, we present a new invariant, the best friend vector, that captures the specific way the best friend can be unfolded. Furthermore, throughout the paper we analyse the strong underlying interaction between this invariant and other parameters such as the cardinality, the flag distance, or the type vector, and how it conditions them. Finally, we investigate the realizability of a prescribed best friend vector in a vector space.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

An algorithm to compute a minimal input-state-output representation of a convolutional code

  • Climent, Joan-Josep
  • Napp, Diego
  • 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
Convolutional codes can be viewed as linear systems over a finite field, and therefore can be described by state representations. In this work we focus on the so called input-state-output (ISO) representations which are different from driving variable state representations commonly found in the literature. Although many fundamental properties have been thoroughly studied within this framework in the last two decades, the crucial notion of minimality has been less investigated. In this paper, we present a novel and relatively simple constructive algorithm to build a minimal input-state-output representation for a convolutional code from any of its generator matrices.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Dualities of dihedral and generalised quaternion codes and applications to quantum codes

  • Sales-Cabrera, Miguel
  • Soler-Escrivà, Xaro|||/items/18f99aed-92a7-4900-93bf-9f1791104428
  • Sotomayor, Víctor
Let Fq be a finite field of q elements, for some prime power q, and let G be a finite group. A (left) group code, or simply a G-code, is a (left) ideal of the group algebra Fq[G]. In this paper, we provide a complete group-algebraic description for the Hermitian dual code of any Dn-code over Fq2, where Dn is a dihedral group of order 2n with n not divisible by char(Fq2), through a suitable Wedderburn-Artin decomposition of the group algebra Fq2[Dn], and we determine all distinct Hermitian self-orthogonal Dn-codes over Fq2. We also present a thorough representation of the Euclidean dual code of any Qn-code over Fq, where Qn is a generalised quaternion group of order 4n not divisible by char(Fq), via the Wedderburn-Artin decomposition of the group algebra Fq[Qn]. In particular, since the semisimple group algebras Fq2[Qn] and Fq2[D2n] are isomorphic, then the Hermitian dual code of any Qn-code has also been fully described. As an application of the Hermitian dualities computed, we give a systematic construction, via the structure of the group algebra, to obtain quantum error-correcting codes, and in fact, with this methodical approach, we recover some already known quantum codes that achieve the best known minimum distance for their length and dimension.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Distance distribution of 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
Given Fq the finite field of size q, a flag code on Fnq consists of a set of flags with a fixed sequence of dimensions (the type). In this paper, we deal with cyclic orbit flag codes, that are orbits of a Singer cycle of the general linear group acting on flags on Fnq . Inspired by the results in Gluesing-Luerssen and Lehmann (Des Codes Crypt 89:447–470, 2021) and Roth et al. (IEEE Trans Inf Theory 64(6):4412–4422, 2018) about cyclic orbit codes, we completely characterize those cyclic orbit flag codes attaining the best distance for the largest possible orbit size, that is, optimal full-length cyclic orbit flag codes. Finally, we show that the distance distribution of this family of codes depends only on q, n and the type of the generating flag, also addressing the case of a union of orbits.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Easy repair via codes with simplex locality

  • Kuijper, Margreta
  • Lieb, Julia
  • Napp, Diego
  • Napp, Diego|||/items/9288f118-72b7-499a-b755-6c1aa078899c
In the context of distributed storage systems, locally repairable codes have become important. In this paper we focus on codes that allow for multi-erasure pattern decoding with low computational effort. Different optimality requirements, measured by the code's rate, minimum distance, locality, availability as well as field size, influence each other and can not all be maximized at the same time. We focus on the notion of easy repair, more specifically on the construction of codes that can repair correctable erasure patterns with minimal computational effort. In particular, we introduce the easy repair property and then present binary codes of different rates that possess this property. The presented codes are all in some way related to binary simplex codes and include block codes as well as unit-memory convolutional codes. We also formulate conditions under which the easy repairs can be performed in parallel, thus improving access speed of the distributed storage system.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

A convolutional mask for the McEliece cryptosystem with binary Goppa codes

  • Almeida, Paulo
  • Beltrá, Miguel
  • Napp, Diego
  • Beltrá, Miguel|||/items/ddb05652-1531-4c02-b7bf-dcfa43c15e82
  • Napp, Diego|||/items/9288f118-72b7-499a-b755-6c1aa078899c
In this work, we propose a variant of the McEliece cryptosystem using a polynomial mask to hide a binary Goppa code. This new proposal can be seen as a convolutional version of the original McEliece scheme. We analyze its security against standard attacks that have been adapted to the particularities of the new scheme. For the same security levels, our proposal requires public keys that are less than half the size of the public keys used in the Classic McEliece cryptosystem presented to the NIST post-quantum standardization project.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Quasi-optimum distance 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
A flag is a sequence of nested subspaces of a given ambient space Fnq over a finite field Fq. In network coding, a flag code is a set of flags, all of them with the same sequence of dimensions, the type vector. In this paper, we investigate quasi-optimum distance flag codes, i.e., those attaining the second best possible distance value. We characterize them and present upper bounds for their cardinality. Moreover, we propose a systematic construction for every choice of the type vector by using partial spreads and sunflowers. For flag codes with lower minimum distance, we adapt the previous construction and provide some results towards their characterization, especially in the case of the third best possible distance value.
RUA. Repositorio Institucional de la Universidad de Alicante
Publicación Otros (Other)

Spread codes from Abelian non-cyclic groups

  • Climent, Joan-Josep
  • Requena Arévalo, Verónica
  • Soler-Escrivà, Xaro
  • Climent, Joan-Josep|||/items/e5ad2c13-73d7-48cd-a8a0-c74efa487a1c
  • Requena Arévalo, Verónica|||/items/a06b702c-0c9b-4738-9391-7238d7ffc3ba
  • Soler-Escrivà, Xaro|||/items/18f99aed-92a7-4900-93bf-9f1791104428
Given the finite field Fq, for a prime power q, in this paper we present a way of constructing spreads of Fnq. Specifically, through the field reduction technique, we will construct the well-known Desarguesian spread of Fnq, using for this purpose the action of an Abelian but not cyclic group. First, we construct a family of orbit codes of maximum distance using this group, and then we complete each of these codes to achieve the Desarguesian spread of the whole space, which will thus have a new orbital structure associated with an Abelian and non-cyclic group.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

A new algebraic approach to binary sequences and Boolean functions

  • Cardell, Sara D.
  • Fúster Sabater, Amparo
  • Requena, Verónica
  • Beltrá, Miguel
33 páginas, 3 figuras, 4 tablas, Boolean functions and binary sequences are fundamental tools in cryptography. In this work, we introduce a new bijection between the set of Boolean functions and the set of binary sequences whose period is a power of two. This correspondence enables the study of properties of Boolean functions through binary sequences and vice versa. Building on this connection, we propose a novel algebraic description, derived from the algebraic normal form of Boolean functions, which we call the reverse-ANF. Then, we explore how this formulation relates both to existing repre- sentations of Boolean functions and to binary sequences. Moreover, several cryp- tographic properties are examined through this new approach. Finally, we analyse generalized self-shrunken sequences from the perspective of Boolean functions, highlighting several properties that emerge under these different frameworks., This work is part of the R+D+i grant P2QProMeTe (PID2020-112586RB-I00) funded by MICIU/AEI/10.13039/501100011033 (Spain). The work of the first author was supported by Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq), Brazil, project 405842/2023-6 and Fapesp with process 2024/05051-7. The work of the third and fourth authors was partially supported by the Spanish I+D+i project PID2022-142159OB-I00 of the Ministerio de Ciencia e Innovación, I+D+i project CIAICO/2022/167 of the Generalitat Valenciana, and the I+D+i project VIGROB23-287 and UADIF23-132 of the Universitat d’Alacant., Peer reviewed