相关论文: Geometric representations of linear codes

On restriction to the maximal compact subgroup $\mathrm{GL}(3,\mathscr{R})$, an unramified principal series representation of the $p$-adic group $\mathrm{GL}(3,F)$ decomposes into a direct sum of finite-dimensional irreducibles each…

Many fundamental questions in theoretical computer science are naturally expressed as special cases of the following problem: Let $G$ be a complex reductive group, let $V$ be a $G$-module, and let $v,w$ be elements of $V$. Determine if $w$…

It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…

We present here algorithms for efficient computation of linear algebra problems over finite fields.

A rectangular dual of a graph $G$ is a contact representation of $G$ by axis-aligned rectangles such that (i)~no four rectangles share a point and (ii)~the union of all rectangles is a rectangle. The partial representation extension problem…

A graph $G=(V,E)$ is representable if there exists a word $W$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $W$ if and only if $(x,y)\in E$ for each $x\neq y$. If $W$ is $k$-uniform (each letter of $W$ occurs exactly $k$…

Recently, linear codes constructed by defining sets have attracted a lot of study, and many optimal linear codes with a few weights have been produced. The objective of this paper is to present a class of binary linear codes with three…

Let $\F$ be a non-Archimedean locally compact field, $q$ be the cardinality of its residue field, and $\R$ be an algebraically closed field of characteristic $\ell$ not dividing $q$.We classify all irredu\-cible smooth $\R$-representations…

We study the representability of sets that admit extended formulations using mixed-integer bilevel programs. We show that feasible regions modeled by continuous bilevel constraints (with no integer variables), complementarity constraints,…

Two general constructions of linear codes with functions over finite fields have been extensively studied in the literature. The first one is given by $\mathcal{C}(f)=\left\{ {\rm Tr}(af(x)+bx)_{x \in \mathbb{F}_{q^m}^*}: a,b \in…

Let $G$ be a group acting on a field $L$, and suppose that $L /L^G$ is a finite extension. We show that the category of semilinear representations of $G$ over $L$ can be described in terms of the category of linear representations of $H$,…

Let $\mathbb{F}_{p^m}$ be the finite field of order $p^m$, where $p$ is an odd prime and $m$ is a positive integer. In this paper, we investigate a class of subfield codes of linear codes and obtain the weight distribution of…

A fascinating topic of combinatorics is $t$-designs, which have a very long history. The incidence matrix of a $t$-design generates a linear code over GF$(q)$ for any prime power $q$, which is called the linear code of the $t$-design over…

Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings $R_k$.…

We give new proofs of asymptotic upper bounds of coding theory obtained within the frame of Delsarte's linear programming method. The proofs rely on the analysis of eigenvectors of some finite-dimensional operators related to orthogonal…

The projective general linear group $\mathrm{PGL}_2(\mathrm{GF}(2^m))$ acts as a $3$-transitive permutation group on the set of points of the projective line. The first objective of this paper is to prove that all linear codes over…

We consider the problem of characterizing upper-triangular matrices $M=\begin{pmatrix}p&r\\0&q\end{pmatrix}\in M_2(\mathbb Z)$ which can be represented in the form $A^2-B^2$ with upper-triangular integer matrices $A$ and $B$ and give a…

We study links between algebraic cycles on threefolds and finite-dimensionality of their motives with coefficients in Q. We decompose the motive of a non-singular projective threefold X with representable algebraic part of CH_0(X) into…

In this paper, we construct a large family of projective linear codes over ${\mathbb F}_{q}$ from the general simplicial complexes of ${\mathbb F}_{q}^m$ via the defining-set construction, which generalizes the results of [IEEE Trans. Inf.…

If an Fq-linear set LU in a projective space is defined by a vector subspace U which is linear over a proper superfield of Fq, then all of its points have weight at least 2. It is known that the converse of this statement holds for linear…