English
Related papers

Related papers: Ring geometries, Two-Weight Codes and Strongly Reg…

200 papers

In this paper, we present a construction of linear codes over $\f_{2^t}$ from Boolean functions, which is a generalization of Ding's method \cite[Theorem 9]{Ding15}. Based on this construction, we give two classes of linear codes…

Information Theory · Computer Science 2015-11-10 Can Xiang , Keqin Feng , Chunming Tang

We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the…

Computational Geometry · Computer Science 2017-08-10 Alfredo García , Ferran Hurtado , Matias Korman , Inês Matos , Maria Saumell , Rodrigo I. Silveira , Javier Tejel , Csaba D. Tóth

In this paper, we first introduce the notion of generalized pair weights of an $[n, k]$-linear code over the finite field $\mathbb{F}_q$ and the notion of pair $r$-equiweight codes, where $1\le r\le k-1$. Some basic properties of…

Information Theory · Computer Science 2020-09-16 Hongwei Liu , Xu Pan

Let $\mathcal{C}$ be a quasi-cyclic code of index $l(l\geq2)$. Let $G$ be the subgroup of the automorphism group of $\mathcal{C}$ generated by $\rho^l$ and the scalar multiplications of $\mathcal{C}$, where $\rho$ denotes the standard…

Information Theory · Computer Science 2023-11-08 Xiaoxiao Li , Minjia Shi , San Ling

A set $C$ of vertices of a simple graph is called a completely regular code if for each $i=0$, $1$, $2$, \ldots and $j = i-1$, $i$, $i+1$, all vertices at distance $i$ from $C$ have the same number $s_{ij}$ of neighbors at distance $j$ from…

Metric Geometry · Mathematics 2016-12-06 Sergey V. Avgustinovich , Denis S. Krotov , Anastasia Yu. Vasil'eva

In this paper, based on the theory of defining sets, two classes of five-weight or six-weight linear codes over Fp are constructed. The weight distributions of the linear codes are determined by means of Weil sums and a new type of…

Information Theory · Computer Science 2021-04-09 Xina Zhang

In this paper, several infinite families of codes over the extension of non-unital non-commutative rings are constructed utilizing general simplicial complexes. Thanks to the special structure of the defining sets, the principal parameters…

Information Theory · Computer Science 2024-07-16 Yanan Wu , Tingting Pang , Nian Li , Yanbin Pan , Xiangyong Zeng

Let $F_q$ be a finite field. A flag of $F_q$-linear codes $C_0\subsetneq C_1\subsetneq\dots\subsetneq C_s$ is said to satisfy the isometry-dual property if there exists a vector $x\in(F_q^*)^n$ such that $C_i=x\cdot C_{s-i}^\perp$, where…

Information Theory · Computer Science 2023-07-18 Maria Bras-Amorós , Alonso S. Castellanos , Luciane Quoos

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

In this paper we investigate connections between linear sets and subspaces of linear maps. We give a geometric interpretation of the results of [18, Section 5] on linear sets on a projective line. We extend this to linear sets in arbitrary…

Combinatorics · Mathematics 2018-06-18 John Sheekey , Geertrui Van de Voorde

A finite collection of unit vectors $S \subset \mathbb{R}^n$ is called a spherical two-distance set if there are two numbers $a$ and $b$ such that the inner products of distinct vectors from $S$ are either $a$ or $b$. We prove that if $a\ne…

Functional Analysis · Mathematics 2015-02-26 Alexander Barg , Alexei Glazyrin , Kasso Okoudjou , Wei-Hsuan Yu

We provide a geometric characterization of $k$-dimensional $\mathbb{F}_{q^m}$-linear sum-rank metric codes as tuples of $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^k$. We then use this characterization to study one-weight codes in the…

Information Theory · Computer Science 2021-12-10 Alessandro Neri , Paolo Santonastaso , Ferdinando Zullo

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

A graph is universally $k$-edge-weightable if for every $k$-element set $Q\subset\mathbb{R}$, it admits a proper $Q$-edge weighting. The settled 1-2-3 conjecture implies that for any arithmetic progression $\{a,b,c\}$, every nice regular…

Combinatorics · Mathematics 2026-02-16 Kecai Deng

We prove that if a framework of a graph is neighborhood affine rigid in $d$-dimensions (or has the stronger property of having an equilibrium stress matrix of rank $n-d-1$) then it has an affine flex (an affine, but non Euclidean, transform…

Metric Geometry · Mathematics 2017-01-19 Robert Connelly , Steven J. Gortler , Louis Theran

The real monomial representations of Clifford algebras give rise to two sequences of bent functions. For each of these sequences, the corresponding Cayley graphs are strongly regular graphs, and the corresponding sequences of strongly…

Combinatorics · Mathematics 2019-04-22 Paul Leopardi

The values of the normalized homogeneous weight are determined for arbitrary finite Frobenius rings and expressed in a form that is independent from a generating character and the M\"obius function on the ring. The weight naturally induces…

Information Theory · Computer Science 2014-03-19 Heide Gluesing-Luerssen

Let $X$ be a smooth proper genus 2 curve over an algebraically closed field of characteristic 2. The absolute Frobenius induces a rational map $F$ on the the moduli space $M\_X$ of semi-stable rank 2 vector bundles over $X$, which is…

Algebraic Geometry · Mathematics 2007-05-23 Laurent Ducrohet

The demand of two-dimensional source coding and constrained coding has been getting higher these days, but compared to the one-dimensional case, many problems have remained open as the analysis is cumbersome. A main reason for that would be…

Information Theory · Computer Science 2016-02-03 Takahiro Ota , Akiko Manada , Hiroyoshi Morita

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

Combinatorics · Mathematics 2025-09-30 Marién Abreu , Martin Funk , Vedran Krčadinac , Domenico Labbate