Publicación: Una nota acerca del método de la función inversa de codificación de redes
dc.contributor.author | Peña-Macias, Victor | |
dc.contributor.corporatename | Academia Colombiana de Ciencias Exactas, Físicas y Naturales | spa |
dc.date.accessioned | 2025-07-01T14:51:46Z | |
dc.date.available | 2025-07-01T14:51:46Z | |
dc.date.issued | 2024-12-13 | |
dc.description.abstract | La teoría de codificación de redes estudia la transmisión de mensajes a través de un grafo dirigido o red, de tal manera que los destinatarios previstos los reciban claramente. Es importante determinar la mejor forma de transmitir mensajes, lo cual se mide mediante una tasa. El método de la función inversa es una técnica que involucra la construcción de transformaciones lineales que cumplen ciertas condiciones asociadas con la topología de una red. Según la estructura de la red, el método funcionaría al producir una desigualdad propia del álgebra lineal, lo que a su vez brindaría información acerca del comportamiento de la tasa con respecto a un espacio vectorial sobre un cuerpo finito. Se demuestra aquí que el método puede usarse con la red conocida como Char-2, el cual produce una desigualdad válida en espacios vectoriales definidos sobre cuerpos de característica impar. | spa |
dc.description.abstract | Network coding theory studies the transmission of messages through a directed graph, or network, in such a way that the intended recipients receive them clearly. It is important to determine the best way to transmit messages, which is measured by a rate. The inverse function method is a technique that involves constructing linear transformations that satisfy certain conditions associated with a network's topology. Depending on the network structure, the method would work by producing an inequality typical of linear algebra, which in turn would provide information about the behavior of the rate with respect to a vector space over a finite field. It is shown here that the method can be used with the network known as Char-2, which produces an inequality valid in vector spaces defined over fields of odd characteristic. | eng |
dc.format.mimetype | application/pdf | spa |
dc.identifier.doi | https://doi.org/10.18257/raccefyn.3018 | |
dc.identifier.eissn | 2382-4980 | spa |
dc.identifier.issn | 0370-3908 | spa |
dc.identifier.uri | https://repositorio.accefyn.org.co/handle/001/3454 | |
dc.language.iso | spa | spa |
dc.relation.citationendpage | 951 | spa |
dc.relation.citationissue | 189 | spa |
dc.relation.citationstartpage | 936 | spa |
dc.relation.citationvolume | 48 | spa |
dc.relation.ispartofjournal | Revista de la Academia Colombiana de Ciencias Exactas, Físicas y Naturales | spa |
dc.rights | La revista de la Academia se distribuye con el modelo de acceso abierto y la licencia Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International con el fin de contribuir a la visibilidad, el acceso y la difusión de la producción científica. | spa |
dc.rights.accessrights | info:eu-repo/semantics/openAccess | spa |
dc.rights.coar | http://purl.org/coar/access_right/c_abf2 | spa |
dc.rights.license | Atribución-NoComercial-CompartirIgual 4.0 Internacional (CC BY-NC-SA 4.0) | spa |
dc.rights.uri | https://creativecommons.org/licenses/by-nc-sa/4.0/ | spa |
dc.subject.proposal | Grafo acíclico dirigido | spa |
dc.subject.proposal | Directed acyclic graph, | eng |
dc.subject.proposal | transformación lineal | spa |
dc.subject.proposal | linear transformation | eng |
dc.subject.proposal | Codificación lineal de redes | spa |
dc.subject.proposal | linear network coding | eng |
dc.subject.proposal | Desigualdades rango lineales | spa |
dc.subject.proposal | linear rank inequalities lineales | eng |
dc.subject.proposal | Capacidad de red | spa |
dc.subject.proposal | network capacity | eng |
dc.title | Una nota acerca del método de la función inversa de codificación de redes | spa |
dc.title | A note on the inverse function method of network coding | eng |
dc.type | Artículo de revista | spa |
dc.type.coar | http://purl.org/coar/resource_type/c_2df8fbb1 | spa |
dc.type.coarversion | http://purl.org/coar/version/c_970fb48d4fbd8a85 | spa |
dc.type.content | Text | spa |
dc.type.driver | info:eu-repo/semantics/article | spa |
dc.type.redcol | http://purl.org/redcol/resource_type/ART | spa |
dc.type.version | info:eu-repo/semantics/updatedVersion | spa |
dcterms.audience | Estudiantes, Profesores, Comunidad científica | spa |
dcterms.references | Ahlswede, R., Cai, N., Li, S.-Y. R., Yeung, R. W. (2000) Network information flow. IEEE Transactions on Information Theory, 46, 1204–1216. https://doi.org/10.1109/18.850663 | spa |
dcterms.references | Blasiak, A., Kleinberg, R., Lubetzky, E. (2011) Lexicographic products and the power of non-linear network coding. 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 609–618. https://doi.org/10.1109/FOCS.2011.39 | spa |
dcterms.references | Connelly, J., Zeger, K. (2016) A class of non-linearly solvable networks. 2016 IEEE International Symposium on Information Theory (ISIT), 1964–1968. https://doi.org/10.1109/ISIT.2016.7541642 | spa |
dcterms.references | Connelly, J., Zeger, K. (2019) Capacity and achievable rate regions for linear network coding over ring alphabets. IEEE Transactions on Information Theory, 65(1), 220–234. https://doi.org/10.1109/TIT.2018.2866244 | spa |
dcterms.references | Das, N., Rai, B. K. (2017) On the dependence of linear coding rates on the characteristic of the finite field. arXiv:1709.05970. | spa |
dcterms.references | Dougherty, R., Freiling, C., Zeger, K. (2005) Insufficiency of linear coding in network information flow. IEEE Transactions on Information Theory, 51(8), 2745–2759.https://doi.org/10.1109/TIT.2005.851744 | spa |
dcterms.references | Dougherty, R., Freiling, C., Zeger, K. (2007) Networks, matroids, and non-shannon information inequalities. IEEE Transactions on Information Theory, 3(6), 1949–1969. https://doi.org/10.1109/TIT.2007.896862 | spa |
dcterms.references | Dougherty, R., Freiling, C., Zeger, K. (2015) Achievable rate regions for network coding. IEEE Transactions on Information Theory, 61(5), 2488–2509. https://doi.org/10.1109/TIT.2015.2403315 | spa |
dcterms.references | Freiling, E. F. (2014) Characteristic dependent linear rank inequalities and applications to network coding. Dissertation for the doctoral degree, University of California, San Diego. | spa |
dcterms.references | Pe˜na-Macias, V. (2023) Access structures for finding characteristic-dependent linear rank inequalities. Kybernetika - International Journal of Institute of Information Theory and Automation, 59(2), 198–208. https://doi.org/10.14736/kyb-2023-2-0198 | spa |
dcterms.references | Pe˜na-Macias, V., Sarria, H. (2020) Characteristic-dependent linear rank inequalities via complementary vector spaces. Journal of Information and Optimization Sciences, 42(2), 345–369. https://doi.org/10.1080/02522667.2019.1668157 | spa |
dcterms.references | Pe˜na-Macias, V., Sarria-Zapata, H. (2019) Characteristic-dependent linear rank inequalities in 21 variables. Revista De La Academia Colombiana De Ciencias Exactas, F´ısicas y Naturales, 43(169), 764–770. https://doi.org/10.18257/raccefyn.928 | spa |
dcterms.references | Shen, A., Hammer, D., Romashchenko, A. E., Vereshchagin, N. K. (2000) Inequalities for shannon entropy and kolmogorov complexity. Journal of Computer and Systems Sciences, 60, 442–464. https://doi.org/10.1006/jcss.1999.1677 | spa |
dspace.entity.type | Publication |
Archivos
Bloque original
1 - 1 de 1
Cargando...
- Nombre:
- 15 3018 MT - tex-metodoFunción inversa.pdf
- Tamaño:
- 615.63 KB
- Formato:
- Adobe Portable Document Format
- Descripción:
Bloque de licencias
1 - 1 de 1
Cargando...
- Nombre:
- license.txt
- Tamaño:
- 14.48 KB
- Formato:
- Item-specific license agreed upon to submission
- Descripción: