Zobrazeno 1 - 10
of 67
pro vyhledávání: '"Diego Napp"'
Publikováno v:
AIMS Mathematics, Vol 8, Iss 1, Pp 713-732 (2023)
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 seque
Externí odkaz:
https://doaj.org/article/a3149392545745ae92ca065871a35656
Publikováno v:
Mathematics, Vol 9, Iss 12, p 1410 (2021)
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
Externí odkaz:
https://doaj.org/article/4a666ac1b0fd4895a8aa3faa1b12c604
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c300b69e0409409b0908ad18cd577c65
https://hdl.handle.net/10045/125001
https://hdl.handle.net/10045/125001
Publikováno v:
IEEE Transactions on Information Theory. 65:1063-1071
Maximum distance profile codes over finite non-binary fields have been introduced and thoroughly studied in the last decade. These codes have the property that their column distances are maximal among all codes of the same rate and degree. In this pa
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 are being polynomial left prime matrices. In t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::949a64f5b67fdcfc873c0e96e48e4b7a
http://arxiv.org/abs/2104.06754
http://arxiv.org/abs/2104.06754
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
RUA. Repositorio Institucional de la Universidad de Alicante
Universidad de Alicante (UA)
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
RUA. Repositorio Institucional de la Universidad de Alicante
Universidad de Alicante (UA)
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8123bebe1c12ed0da9785c6801ffac15
http://hdl.handle.net/10773/30499
http://hdl.handle.net/10773/30499
Publikováno v:
RUA. Repositorio Institucional de la Universidad de Alicante
Universidad de Alicante (UA)
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Universidad de Alicante (UA)
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c21324c6e9798364e6f91c7f00e49fe0
http://hdl.handle.net/10045/112285
http://hdl.handle.net/10045/112285
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
RUA. Repositorio Institucional de la Universidad de Alicante
Universidad de Alicante (UA)
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
RUA. Repositorio Institucional de la Universidad de Alicante
Universidad de Alicante (UA)
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::befde65784c145b05412a5655b1a3aa0
Autor:
Umberto Martínez-Peñas, Diego Napp
Publikováno v:
RUA. Repositorio Institucional de la Universidad de Alicante
Universidad de Alicante (UA)
ISIT
Universidad de Alicante (UA)
ISIT
Locally repairable convolutional codes (LRCCs) for distributed storage systems (DSSs) are introduced in this work. They enable local repair, for a single node erasure (or more generally, $ \partial - 1 $ erasures per local group), and sliding-window
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::032f147c12e93dd02b87fb19ec7485a2
https://hdl.handle.net/10045/108411
https://hdl.handle.net/10045/108411
Publikováno v:
RUA. Repositorio Institucional de la Universidad de Alicante
Universidad de Alicante (UA)
Universidad de Alicante (UA)
The notion of Generalized Hamming weights of block codes has been investigated since the nineties due to its significant role in coding theory and cryptography. In this paper we extend this concept to the context of convolutional codes. In particular
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b83cd2804f152e33ac3e5a663eb6b2d2
https://hdl.handle.net/10045/109876
https://hdl.handle.net/10045/109876