Related papers: Geometric representations of linear codes

We show that the weight enumerator of any binary linear code is equal to the permanent of a 3-dimensional hypermatrix (3-matrix). We also show that each permanent is a determinant of a 3-matrix. As an application we write the dimer…

We give a polynomial representation for additive cyclic codes over $\mathbb{F}_{p^2}$. This representation will be applied to uniquely present each additive cyclic code by at most two generator polynomials. We determine the generator…

In this article, we review some aspects of logarithmic conformal field theories which can be inferred from the characters of irreducible submodules of indecomposable modules. We will mainly consider the W(2,2p-1,2p-1,2p-1) series of triplet…

The study of the generalized Hamming weight of linear codes is a significant research topic in coding theory as it conveys the structural information of the codes and determines their performance in various applications. However,…

Given a faithful finite-dimensional representation $V$ of a finite group $G$ over any field $\mathbb{F}$, we show that any irreducible ${\mathbb{F}}G$-module $W$ appears, as a submodule or a quotient, in $\mathrm{Sym}^m(V)$ for some integer…

We study the irreducible complex representations of general linear groups over principal ideal local rings of length two with a fixed finite residue field. We construct a canonical correspondence between the irreducible representations of…

Motivated by the study of trilinear forms for complex representations, we investigate the space of $G$-invariant linear forms on tensor products of irreducible admissible representations of $G = \mathrm{GL}_2(\mathbb{Q}_p)$ over…

Let F be a non-archimedean local field with residue characteristic p. Let l be a prime number different from p. Let G be a connected reductive group which is split, semi-simple, and simply connected. On the one hand, we describe the…

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…

We study finite-dimensional representations of quantum affine algebras using q-characters. We prove the conjectures from math.QA/9810055 and derive some of their corollaries. In particular, we prove that the tensor product of fundamental…

It is generally believed (and for the most part is probably true) that Lie theory, in contrast to the characteristic zero case, is insufficient to tackle the representation theory of algebraic groups over prime characteristic fields.…

We consider codes over $\mathbb{Z}_{p^s}$ with the extended Lee weight. We find Singleton bounds with respect to this weight and define MLDS and MLDR codes accordingly. We also consider the kernels of these codes and the notion of…

Let $\K$ be a finite extension of a characteristic zero field $\F$. We say that the pair of $n\times n$ matrices $(A,B)$ over $\F$ represents $\K$ if $\K \cong \F[A]/< B >$ where $\F[A]$ denotes the smallest subalgebra of $M_n(\F)$…

A residual design ${\cal{D}}_B$ with respect to a block $B$ of a given design $\cal{D}$ is defined to be linearly embeddable over $GF(p)$ if the $p$-ranks of the incidence matrices of ${\cal{D}}_B$ and $\cal{D}$ differ by one. A sufficient…

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…

Let F be a nonarchimedean locally compact field with residue characteristic p and G(F) the group of F-rational points of a connected reductive group. Following Schneider and Stuhler, one can realize, in a functorial way, any smooth complex…

The weight distribution of a linear code C is put in an explicit bijective correspondence with Duursma's reduced polynomial of C. We prove that the Riemann Hypothesis Analogue for a linear code C requires the formal self-duality of C and…

We introduce a categorical framework for the study of representations of $G_F$, where $G$ is a reductive group, and $\bF$ is a 2-dimensional local field, i.e. $F=K((t))$, where $K$ is a local field. Our main result says that the space of…

We develop an algorithm for computing the weight distribution of a linear $[n,k]$ code over a finite field $\mathbb{F}_q$. We represent the codes by their characteristic vector with respect to a given generator matrix and a special type of…

Motivated by recent advances in solution methods for mixed-integer convex optimization (MICP), we study the fundamental and open question of which sets can be represented exactly as feasible regions of MICP problems. We establish several…