English
Related papers

Related papers: The Lattice Structure of Linear Subspace Codes

200 papers

Cut-and-project sets $\Sigma\subset\mathbb{R}^n$ represent one of the types of uniformly discrete relatively dense sets. They arise by projection of a section of a higher-dimensional lattice to a suitably oriented subspace. Cut-and-project…

Mathematical Physics · Physics 2020-01-31 Zuzana Masáková , Jan Mazáč , Edita Pelantová

It is well-known that the Sobolev spaces $W^{k,p}(\mathbb R^d)$ are vector lattices with respect to the pointwise almost everywhere order if $k \in \{0,1\}$, but not if $k \ge 2$. In this note, we consider negative $k$ and show that the…

Functional Analysis · Mathematics 2025-03-05 Sahiba Arora , Jochen Glück , Felix L. Schwenninger

Any subset Q' of the domain Q of a learning space defines a projection of that learning space on Q' which is itself a learning space consistent with the original one. Moreover, such a construction defines a partition of Q having each of its…

Combinatorics · Mathematics 2008-12-08 Jean-Claude Falmagne

Using linear projections one gets new inequalities for the successive minima of the lattice of sections of an hermitian line bundle on an arithmetic surface.

Algebraic Geometry · Mathematics 2008-12-18 C. Soule

In this paper we give an algebraic characterization of the projections lattice of $M_n(\mathbb C)$ and we extend it to the case of $B(H)$, with $H$ separable Hilbert space.

Logic · Mathematics 2009-09-14 V. Capraro

The hull of a linear code is defined as the intersection of the code and its dual. This concept was initially introduced to classify finite projective planes. The hull plays a crucial role in determining the complexity of algorithms used to…

Information Theory · Computer Science 2025-11-25 Sanjit Bhowmick , Deepak Kumar Dalai , Sihem Mesnager

The cut and project method is a central construction in the theory of Aperiodic Order for generating quasicrystals with pure point diffraction. Linear repetitivity ({\bf LR}) is a form of ideal regularity of aperiodic patterns. Recently,…

Dynamical Systems · Mathematics 2024-03-15 James J. Walton

The surface code is a two-dimensional topological code with code parameters that scale optimally with the number of physical qubits, under the constraint of two-dimensional locality. In three spatial dimensions an analogous simple yet…

Quantum Physics · Physics 2025-11-19 Dominic J. Williamson , Nouédyn Baspin

The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one…

Information Theory · Computer Science 2022-12-08 Chao Liu , Dabin Zheng , Xiaoqiang Wang

We propose the Lattice Representation Hypothesis of large language models: a symbolic backbone that grounds conceptual hierarchies and logical operations in embedding geometry. Our framework unifies the Linear Representation Hypothesis with…

Artificial Intelligence · Computer Science 2026-05-19 Bo Xiong

We study quasi-isometric embeddings of symmetric spaces and non-uniform irreducible lattices in semisimple higher rank Lie groups. We show that any quasi-isometric embedding between symmetric spaces of the same rank can be decomposed into a…

Differential Geometry · Mathematics 2019-06-11 Thang Nguyen

We study the structure of linear codes over the ring $B_k$ which is defined by $\mathbb{F}_{p^r}[v_1,v_2,\ldots,v_k]/\langle v_i^2=v_i,~v_iv_j=v_jv_i \rangle_{i,j=1}^k.$ In order to study the codes, we begin with studying the structure of…

Information Theory · Computer Science 2018-01-18 Irwansyah , Djoko Suprijanto

A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…

Information Theory · Computer Science 2015-12-23 Can Xiang

In this paper, we completely classify the isomorphism classes of certain lattices $L_A(C)$ and $L_B(C)$ from a self-orthogonal code $C$ over the finite field $\mathbb{F}_p$, where $p$ is an odd prime. These lattices are obtained by…

Combinatorics · Mathematics 2026-05-05 Takara Kondo

We determine those maps between affine or projective spaces that are linear in the abstract sense of transforming collinear points into collinear points and whose restriction to any line is constant or injective. Our results are extensions…

Algebraic Geometry · Mathematics 2023-07-28 Juan B. Sancho de Salas

We introduce the class of rank-metric geometric lattices and initiate the study of their structural properties. Rank-metric lattices can be seen as the $q$-analogues of higher-weight Dowling lattices, defined by Dowling himself in 1971. We…

Combinatorics · Mathematics 2022-06-22 Giuseppe Cotardo , Alberto Ravagnani

We consider (symmetric, non-degenerate) bilinear spaces over a finite field and investigate the properties of their $\ell$-complementary subspaces, i.e., the subspaces that intersect their dual in dimension $\ell$. This concept generalizes…

Information Theory · Computer Science 2022-12-16 Heide Gluesing-Luerssen , Alberto Ravagnani

The hull of a linear code (i.e., a finite field vector space)~\({\mathcal C}\) is defined to be the vector space formed by the intersection of~\({\mathcal C}\) with its dual~\({\mathcal C}^{\perp}.\) Constructing vector spaces with a…

Information Theory · Computer Science 2023-05-15 Ghurumuruhan Ganesan

We define a notion of morphism for quotient vector bundles that yields both a category $\textit{QVBun}$ and a contravariant global sections functor $C:\textit{QVBun}^{\textrm{op}}\to\textit{Vect}$ whose restriction to trivial vector bundles…

Category Theory · Mathematics 2016-11-28 Pedro Resende , João Paulo Santos

A structure theorem of the group codes which are relative projective for the subgroup $\lbrace 1 \rbrace$ of $G$ is given. With this, we show that all such relative projective group codes in a fixed group algebra $RG$ are in bijection to…

Information Theory · Computer Science 2020-10-26 Simon Eisenbarth , Sihuang Hu