English
Related papers

Related papers: Subspace Packings

200 papers

In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family…

Information Theory · Computer Science 2012-06-08 Elisa Gorla , Felice Manganiello , Joachim Rosenthal

Given a finite field F_q and a positive integer n, a flag is a sequence of nested F_q-subspaces of a vector space F_q^n and a flag code is a nonempty collection of flags. The projected codes of a flag code are the constant dimension codes…

Information Theory · Computer Science 2023-11-13 Miguel Ángel Navarro-Pérez , Xaro Soler-Escrivà

One of the main problems of the research area of network coding is to compute good lower and upper bounds of the achievable cardinality of so-called subspace codes in $\operatorname{PG}(n,q)$, i.e., the set of subspaces of $\mathbb{F}_q^n$,…

Combinatorics · Mathematics 2017-09-27 Daniel Heinlein , Sascha Kurz

We are concerned with the problem of designing large families of subsets over a common labeled ground set that have small pairwise intersections and the property that the maximum discrepancy of the label values within each of the sets is…

Information Theory · Computer Science 2019-01-18 R. Gabrys , H. S. Dau , C. J. Colbourn , O. Milenkovic

This paper proposes new propagation rules on quantum codes in the entanglement-assisted and in quantum subsystem scenarios. The rules lead to new families of such quantum codes whose parameters are demonstrably optimal. To obtain the…

Information Theory · Computer Science 2022-06-22 Gaojun Luo , Martianus Frederic Ezerman , San Ling

Let PG$(\mathbb{F}_q^v)$ be the $(v-1)$-dimensional projective space over $\mathbb{F}_q$ and let $\Gamma$ be a simple graph of order ${q^k-1\over q-1}$ for some $k$. A 2$-(v,\Gamma,\lambda)$ design over $\mathbb{F}_q$ is a collection $\cal…

Combinatorics · Mathematics 2020-11-30 Marco Buratti , Anamari Nakic , Alfred Wassermann

There is a hierarchy of commuting soliton equations associated to each symmetric space U/K. When U/K has rank n, the first n flows in the hierarchy give rise to a natural first order non-linear system of partial diffferential equations in n…

Differential Geometry · Mathematics 2009-09-25 Martina Brück , Xi Du , Joonsang Park , Chuu-Lian Terng

Let $p$ be a prime such that $p \equiv 2$ or $3$ mod $5$. Linear block codes over the non-commutative matrix ring of $2 \times 2$ matrices over the prime field $GF(p)$ endowed with the Bachoc weight are derived as isometric images of linear…

Information Theory · Computer Science 2015-02-17 Bryan Hernandez , Virgilio Sison

Let F<X> be the free unitary associative algebra over a field F on the set X = {x_1, x_2, ...}. A vector subspace V of F<X> is called a T-subspace (or a T-space) if V is closed under all endomorphisms of F<X>. A T-subspace V in F<X> is…

Rings and Algebras · Mathematics 2013-10-30 Dimas José Gonçalves , Alexei Krasilnikov , Irina Sviridova

We continue the study of optimal chordal packings, with emphasis on packing subspaces of dimension greater than one. Following a principle outlined in a previous work, where the authors use maximal affine block designs and maximal sets of…

Functional Analysis · Mathematics 2018-06-12 Peter G. Casazza , John I. Haas , Joshua Stueck , Tin T. Tran

The projective space of order $n$ over a finite field $\F_q$ is a set of all subspaces of the vector space $\F_q^{n}$. In this work, we consider error-correcting codes in the projective space, focusing mainly on constant dimension codes. We…

Information Theory · Computer Science 2011-09-09 Natalia Silberstein

Let V be a vector space with a nondegenerate symmetric form and OG be the orthogonal Grassmannian which parametrizes maximal isotropic subspaces in V. We give a presentation for the (small) quantum cohomology ring QH^*(OG) and show that its…

Algebraic Geometry · Mathematics 2007-05-23 Andrew Kresch , Harry Tamvakis

In this manuscript, we consider decoding Grassmann codes, linear codes associated to Grassmannian of planes in an affine space. We look at the orbit structure of Grassmannian arising from the natural action of multiplicative group of…

Information Theory · Computer Science 2021-06-23 Fernando Piñero , Prasant Singh

We study the packing dimension of unions of subsets of $k$-planes in $\mathbb{R}^n$ using tools from algorithmic information theory, obtaining an analog of a result of H\'era and a mild generalization of a recent result of Fraser. Along the…

Classical Analysis and ODEs · Mathematics 2025-08-26 Jacob B. Fiedler

A systematic way of constructing Grassmannian codes endowed with the subspace distance as lifts of matrix codes over the prime field $GF(p)$ is introduced. The matrix codes are $GF(p)$-subspaces of the ring $M_2(GF(p))$ of $2 \times 2$…

Information Theory · Computer Science 2015-02-23 Bryan Hernandez , Virgilio Sison

Intersection numbers for subspace designs are introduced and $q$-analogs of the Mendelsohn and K\"ohler equations are given. As an application, we are able to determine the intersection structure of a putative $q$-analog of the Fano plane…

Combinatorics · Mathematics 2015-10-16 Michael Kiermaier , Mario Osvin Pavčević

Given a homogeneous component of an exterior algebra, we characterize those subspaces in which every nonzero element is decomposable. In geometric terms, this corresponds to characterizing the projective linear subvarieties of the Grassmann…

Algebraic Geometry · Mathematics 2009-03-31 Sudhir R. Ghorpade , Arunkumar R. Patil , Harish K. Pillai

Let $\mathcal{X}$ be a set of $(h-1)$-dimensional subspaces of $\mathrm{PG}(kh-1,q)$ with the property that every hyperplane contains at most $t$ elements of $\mathcal{X}$. We prove the upper bound $|\mathcal{X}| \leq (t-k+2)q^h + t$, and…

Combinatorics · Mathematics 2026-03-31 Tim Alderson , Simeon Ball

Let $\mathbb{F}_q$ be a finite field of $q$ elements, for some prime power $q$, and let $G$ be a finite group. A (left) group code, or simply a $G$-code, is a (left) ideal of the group algebra $\mathbb{F}_q[G]$. In this paper, we provide a…

Information Theory · Computer Science 2026-02-05 Miguel Sales-Cabrera , Xaro Soler-Escrivà , Víctor Sotomayor

This paper is concerned with a covering problem of Euclidean space by a particular arrangement of cones that are not necessarily full and are allowed to overlap. The problem provides an equivalent geometric reformulation of the solvability…

Optimization and Control · Mathematics 2026-02-11 Khalil Ghorbal , Christelle Kozaily
‹ Prev 1 4 5 6 7 8 10 Next ›