Lossless dimension expanders via linearized polynomials and subspace designs

For a vector space F^n over a field F, an (eta,beta)-dimension expander of degree d is a collection of d linear maps Gamma_j : F^n -> F^n such that for every subspace U of F^n of dimension at most eta n, the image of U under all the maps, sum_{j=1}^d Gamma_j(U), has dimension at least beta dim(U)...

Full description

Saved in:
Bibliographic Details
Main Authors: Guruswami, Venkatesan, Resch, Nicolas, Xing, Chaoping
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2018
Subjects:
Online Access:https://hdl.handle.net/10356/89333
http://hdl.handle.net/10220/46214
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-89333
record_format dspace
spelling sg-ntu-dr.10356-893332023-02-28T19:24:03Z Lossless dimension expanders via linearized polynomials and subspace designs Guruswami, Venkatesan Resch, Nicolas Xing, Chaoping School of Physical and Mathematical Sciences Coding Theory Algebraic Constructions DRNTU::Science::Mathematics For a vector space F^n over a field F, an (eta,beta)-dimension expander of degree d is a collection of d linear maps Gamma_j : F^n -> F^n such that for every subspace U of F^n of dimension at most eta n, the image of U under all the maps, sum_{j=1}^d Gamma_j(U), has dimension at least beta dim(U). Over a finite field, a random collection of d = O(1) maps Gamma_j offers excellent "lossless" expansion whp: beta ~~ d for eta >= Omega(1/d). When it comes to a family of explicit constructions (for growing n), however, achieving even modest expansion factor beta = 1+epsilon with constant degree is a non-trivial goal. We present an explicit construction of dimension expanders over finite fields based on linearized polynomials and subspace designs, drawing inspiration from recent progress on list-decoding in the rank-metric. Our approach yields the following: - Lossless expansion over large fields; more precisely beta >= (1-epsilon)d and eta >= (1-epsilon)/d with d = O_epsilon(1), when |F| >= Omega(n). - Optimal up to constant factors expansion over fields of arbitrarily small polynomial size; more precisely beta >= Omega(delta d) and eta >= Omega(1/(delta d)) with d=O_delta(1), when |F| >= n^{delta}. Previously, an approach reducing to monotone expanders (a form of vertex expansion that is highly non-trivial to establish) gave (Omega(1),1+Omega(1))-dimension expanders of constant degree over all fields. An approach based on "rank condensing via subspace designs" led to dimension expanders with beta >rsim sqrt{d} over large fields. Ours is the first construction to achieve lossless dimension expansion, or even expansion proportional to the degree. Published version 2018-10-03T08:18:28Z 2019-12-06T17:23:06Z 2018-10-03T08:18:28Z 2019-12-06T17:23:06Z 2018 Journal Article Guruswami, V., Resch, N., & Xing, C. (2018). Lossless dimension expanders via linearized polynomials and subspace designs. Leibniz International Proceedings in Informatics, 102, 4-. doi:10.4230/LIPIcs.CCC.2018.4 https://hdl.handle.net/10356/89333 http://hdl.handle.net/10220/46214 10.4230/LIPIcs.CCC.2018.4 en Leibniz International Proceedings in Informatics © 2018 Venkatesan Guruswami, Nicolas Resch, and Chaoping Xing; licensed under Creative Commons License CC-BY. 16 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Coding Theory
Algebraic Constructions
DRNTU::Science::Mathematics
spellingShingle Coding Theory
Algebraic Constructions
DRNTU::Science::Mathematics
Guruswami, Venkatesan
Resch, Nicolas
Xing, Chaoping
Lossless dimension expanders via linearized polynomials and subspace designs
description For a vector space F^n over a field F, an (eta,beta)-dimension expander of degree d is a collection of d linear maps Gamma_j : F^n -> F^n such that for every subspace U of F^n of dimension at most eta n, the image of U under all the maps, sum_{j=1}^d Gamma_j(U), has dimension at least beta dim(U). Over a finite field, a random collection of d = O(1) maps Gamma_j offers excellent "lossless" expansion whp: beta ~~ d for eta >= Omega(1/d). When it comes to a family of explicit constructions (for growing n), however, achieving even modest expansion factor beta = 1+epsilon with constant degree is a non-trivial goal. We present an explicit construction of dimension expanders over finite fields based on linearized polynomials and subspace designs, drawing inspiration from recent progress on list-decoding in the rank-metric. Our approach yields the following: - Lossless expansion over large fields; more precisely beta >= (1-epsilon)d and eta >= (1-epsilon)/d with d = O_epsilon(1), when |F| >= Omega(n). - Optimal up to constant factors expansion over fields of arbitrarily small polynomial size; more precisely beta >= Omega(delta d) and eta >= Omega(1/(delta d)) with d=O_delta(1), when |F| >= n^{delta}. Previously, an approach reducing to monotone expanders (a form of vertex expansion that is highly non-trivial to establish) gave (Omega(1),1+Omega(1))-dimension expanders of constant degree over all fields. An approach based on "rank condensing via subspace designs" led to dimension expanders with beta >rsim sqrt{d} over large fields. Ours is the first construction to achieve lossless dimension expansion, or even expansion proportional to the degree.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Guruswami, Venkatesan
Resch, Nicolas
Xing, Chaoping
format Article
author Guruswami, Venkatesan
Resch, Nicolas
Xing, Chaoping
author_sort Guruswami, Venkatesan
title Lossless dimension expanders via linearized polynomials and subspace designs
title_short Lossless dimension expanders via linearized polynomials and subspace designs
title_full Lossless dimension expanders via linearized polynomials and subspace designs
title_fullStr Lossless dimension expanders via linearized polynomials and subspace designs
title_full_unstemmed Lossless dimension expanders via linearized polynomials and subspace designs
title_sort lossless dimension expanders via linearized polynomials and subspace designs
publishDate 2018
url https://hdl.handle.net/10356/89333
http://hdl.handle.net/10220/46214
_version_ 1759855885657571328