<?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-11-22T20:17:44Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/2778" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/2778</identifier><datestamp>2017-03-21T19:10:36Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="8afa6145-a205-4a9d-92e2-694c36720eeb" confidence="600">Li, Chao</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2007-05-01T17:17:25Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2007-05-01T17:17:25Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2007-05-01T17:17:25Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2007</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/2778</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">This thesis investigates lattice compression of polynomial matrices&#xd;
over finite fields. For an m x n matrix, the goal of lattice&#xd;
compression is to find an m x (m+k) matrix, for some relatively&#xd;
small k, such that the lattice span of two matrices are &#xd;
equivalent. For any m x n polynomial matrix with degree bound&#xd;
d, it can be compressed by multiplying by a random n x (m+k)&#xd;
matrix B with degree bound s. In this thesis, we prove that&#xd;
there is a positive probability that &#xd;
L(A)=L(AB) with k(s+1)=\Theta(\log(md)). This&#xd;
is shown to hold even when s=0 (i.e., where B is a matrix of&#xd;
constants). We also design a competitive probabilistic lattice&#xd;
compression algorithm of the Las Vegas type that has a positive &#xd;
probability of success on any input and requires&#xd;
O~(nm^{\theta-1}B(d)) field operations.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">283031 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Polynomial matrices</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Lattice compression</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Randomize</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Lattice Compression of Polynomial Matrices</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>