The Lattice Structure of Linear Subspace Codes

11/02/2019
by   Pranab Basu, et al.
0

The projective space P_q(n), i.e. the set of all subspaces of the vector space F_q^n, is a metric space endowed with the subspace distance metric. Braun, Etzion and Vardy argued that codes in a projective space are analogous to binary block codes in F_2^n using a framework of lattices. They defined linear codes in P_q(n) by mimicking key features of linear codes in the Hamming space F_2^n. In this paper, we prove that a linear code in a projective space forms a sublattice of the corresponding projective lattice if and only if the code is closed under intersection. The sublattice thus formed is geometric distributive. We also present an application of this lattice-theoretic characterization.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/22/2021

Divisible Codes

A linear code over 𝔽_q with the Hamming metric is called Δ-divisible if ...
research
05/10/2021

The Typical Non-Linear Code over Large Alphabets

We consider the problem of describing the typical (possibly) non-linear ...
research
09/15/2021

On Characterization of Finite Geometric Distributive Lattices

A Lattice is a partially ordered set where both least upper bound and gr...
research
05/04/2021

Intersection Patterns in Optimal Binary (5,3) Doubling Subspace Codes

Subspace codes are collections of subspaces of a projective space such t...
research
06/27/2023

Codes and Orbit Covers of Finite Abelian Groups

It is well known that the discrete analogue of a lattice is a linear cod...
research
10/17/2018

Properties of Constacyclic Codes Under the Schur Product

For a subspace W of a vector space V of dimension n, the Schur-product s...
research
05/20/2020

ReLU Code Space: A Basis for Rating Network Quality Besides Accuracy

We propose a new metric space of ReLU activation codes equipped with a t...

Please sign up or login with your details

Forgot password? Click here to reset