<?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-04-28T19:49:43Z</responseDate><request verb="GetRecord" identifier="oai:uvadoc.uva.es:10324/31724" metadataPrefix="rdf">https://uvadoc.uva.es/oai/request</request><GetRecord><record><header><identifier>oai:uvadoc.uva.es:10324/31724</identifier><datestamp>2024-12-18T15:53:22Z</datestamp><setSpec>com_10324_1129</setSpec><setSpec>com_10324_931</setSpec><setSpec>com_10324_894</setSpec><setSpec>com_10324_32197</setSpec><setSpec>com_10324_952</setSpec><setSpec>col_10324_1193</setSpec><setSpec>col_10324_32199</setSpec></header><metadata><rdf:RDF xmlns:rdf="http://www.openarchives.org/OAI/2.0/rdf/" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ds="http://dspace.org/ds/elements/1.1/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:ow="http://www.ontoweb.org/ontology/1#" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/rdf/ http://www.openarchives.org/OAI/2.0/rdf.xsd">
<ow:Publication rdf:about="oai:uvadoc.uva.es:10324/31724">
<dc:title>On the distance of stabilizer quantum codes from J-affine variety codes</dc:title>
<dc:creator>Galindo, Carlos</dc:creator>
<dc:creator>Geil, Olav</dc:creator>
<dc:creator>Hernando, Fernando</dc:creator>
<dc:creator>Ruano Benito, Diego</dc:creator>
<dc:description>Producción Científica</dc:description>
<dc:description>Self-orthogonal J-affine variety codes have been successfully used to obtain quantum stabilizer codes with excellent parameters. In a previous paper we gave formulae for the dimension of this family of quantum codes, but no bound for the minimum distance was given. In this work, we show how to derive quantum stabilizer codes with designed minimum distance from J-affine variety codes and their subfield-subcodes. Moreover, this allows us to obtain new quantum codes, some of them either, with better parameters, or with larger distances than the previously known codes.</dc:description>
<dc:date>2018-09-24T12:27:20Z</dc:date>
<dc:date>2018-09-24T12:27:20Z</dc:date>
<dc:date>2017</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:identifier>Quantum Information Processing. Volume 16, Issue 4, 16:111 (2017)</dc:identifier>
<dc:identifier>http://uvadoc.uva.es/handle/10324/31724</dc:identifier>
<dc:identifier>10.1007/s11128-017-1559-1</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>https://link.springer.com/articl/10.1007%2Fs11128-017-1559-1</dc:relation>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:rights>http://creativecommons.org/licenses/by-nc-nd/4.0/</dc:rights>
<dc:rights>Attribution-NonCommercial-NoDerivatives 4.0 International</dc:rights>
<dc:peerreviewed>SI</dc:peerreviewed>
</ow:Publication>
</rdf:RDF></metadata></record></GetRecord></OAI-PMH>