Orbit Structure of Grassmannian $G_{2, m}$ and a decoder for Grassmann code $C(2, m)$

Fernando Piñero; Prasant Singh

Home/Archive/arXiv

arXiv · 2008.12067

Orbit Structure of Grassmannian $G_{2, m}$ and a decoder for Grassmann code $C(2, m)$

Fernando Piñero·Prasant Singh

View original source ↗Read source document ↗Export metadata ↓

Abstract

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 certain finite field extension. We project the corresponding Grassmann code onto these orbits to obtain a few subcodes of certain Reed-Solomon code. We prove that some of these projected codes contains an information set of the parent Grassmann code. By improving the efficiency of Peterson's decoding algorithm for the projected subcodes, we prove that one can correct up to $\lfloor d-1/2\rfloor$ errors for Grassmann code, where $d$ is the minimum distance of Grassmann code.

Explore related subjects

cs.IT math.IT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Fernando Piñero, Prasant Singh. 2021-06-21. Orbit Structure of Grassmannian $G_{2, m}$ and a decoder for Grassmann code $C(2, m)$. https://arxiv.org/abs/2008.12067

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT↗

arXiv2026

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT↗

arXiv2026

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT↗