Weight-2 input sequences of 1/n convolutional codes from linear systems point of view
Por favor, use este identificador para citar o enlazar este ítem:
http://hdl.handle.net/10045/128552
Registro completo de metadatos
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor | Grupo de Álgebra y Geometría (GAG) | es_ES |
dc.contributor.author | Herranz, Victoria | - |
dc.contributor.author | Napp, Diego | - |
dc.contributor.author | Perea, Carmen | - |
dc.contributor.other | Universidad de Alicante. Departamento de Matemáticas | es_ES |
dc.date.accessioned | 2022-10-18T07:28:00Z | - |
dc.date.available | 2022-10-18T07:28:00Z | - |
dc.date.issued | 2022-10-11 | - |
dc.identifier.citation | AIMS Mathematics. 2023, 8(1): 713-732. https://doi.org/10.3934/math.2023034 | es_ES |
dc.identifier.issn | 2473-6988 | - |
dc.identifier.uri | http://hdl.handle.net/10045/128552 | - |
dc.description.abstract | 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. | es_ES |
dc.description.sponsorship | The research of the second author was supported by Spanish I+D+i project PID2019-108668GB-I00 of MCIN/AEI/10.13039/501100011033. | es_ES |
dc.language | eng | es_ES |
dc.publisher | AIMS Press | es_ES |
dc.rights | © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0) | es_ES |
dc.subject | Convolutional codes | es_ES |
dc.subject | Input-state-output representations | es_ES |
dc.subject | Linear time-invariant systems | es_ES |
dc.subject | Effective free distance | es_ES |
dc.title | Weight-2 input sequences of 1/n convolutional codes from linear systems point of view | es_ES |
dc.type | info:eu-repo/semantics/article | es_ES |
dc.peerreviewed | si | es_ES |
dc.identifier.doi | 10.3934/math.2023034 | - |
dc.relation.publisherversion | https://doi.org/10.3934/math.2023034 | es_ES |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-108668GB-I00 | es_ES |
Aparece en las colecciones: | INV - GAG - Artículos de Revistas |
Archivos en este ítem:
Archivo | Descripción | Tamaño | Formato | |
---|---|---|---|---|
Herranz_etal_2022_AIMSMath.pdf | 274,81 kB | Adobe PDF | Abrir Vista previa | |
Este ítem está licenciado bajo Licencia Creative Commons