<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-05-05T21:50:34Z</responseDate><request verb="GetRecord" identifier="oai:uvadoc.uva.es:10324/75926" metadataPrefix="etdms">https://uvadoc.uva.es/oai/request</request><GetRecord><record><header><identifier>oai:uvadoc.uva.es:10324/75926</identifier><datestamp>2025-06-10T19:02:16Z</datestamp><setSpec>com_10324_32197</setSpec><setSpec>com_10324_952</setSpec><setSpec>com_10324_894</setSpec><setSpec>col_10324_32199</setSpec></header><metadata><thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.0/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.0/ http://www.ndltd.org/standards/metadata/etdms/1.0/etdms.xsd">
<title>About the generalized Hamming weights of matrix-product codes</title>
<creator>San José Rubio, Rodrigo</creator>
<description>Producción Científica</description>
<description>We derive a general lower bound for the generalized Hamming weights of nested matrix-&#xd;
product codes, with a particular emphasis on the cases with two and three constituent codes.&#xd;
We also provide an upper bound which is reminiscent of the bounds used for the minimum&#xd;
distance of matrix-product codes. When the constituent codes are two Reed–Solomon codes,&#xd;
we obtain an explicit formula for the generalized Hamming weights of the resulting matrix-&#xd;
product code. We also deal with the non-nested case for the case of two constituent codes.</description>
<date>2025-06-10</date>
<date>2025-06-10</date>
<date>2025</date>
<type>info:eu-repo/semantics/article</type>
<identifier>Computational and Applied Mathematics, 2025, vol. 44, n. 4.</identifier>
<identifier>2238-3603</identifier>
<identifier>https://uvadoc.uva.es/handle/10324/75926</identifier>
<identifier>10.1007/s40314-025-03141-x</identifier>
<identifier>4</identifier>
<identifier>Computational and Applied Mathematics</identifier>
<identifier>44</identifier>
<identifier>1807-0302</identifier>
<language>eng</language>
<relation>https://link.springer.com/article/10.1007/s40314-025-03141-x</relation>
<rights>info:eu-repo/semantics/openAccess</rights>
<rights>http://creativecommons.org/licenses/by/4.0/</rights>
<rights>© 2025 The Author(s)</rights>
<rights>Atribución 4.0 Internacional</rights>
<publisher>Springer</publisher>
</thesis></metadata></record></GetRecord></OAI-PMH>