English
Related papers

Related papers: Geometric representations of linear codes

200 papers

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime $p$, we present the explicit complete weight enumerator of a family of $p$-ary linear codes constructed with defining…

Information Theory · Computer Science 2017-07-07 Shudi Yang , Zheng-An Yao

Let g be the Lie superalgebra p(3) of rank 2 over an algebraically closed field K of characteristic p > 3. We classify all irreducible modules of g, and give the character formulae for irreducible modules.

Representation Theory · Mathematics 2026-01-23 Ye Ren

Let $\mathbb{F}_{q}$ be a finite field of characteristic $p$, and let $W_{2}(\mathbb{F}_{q})$ be the ring of Witt vectors of length two over $\mathbb{F}_{q}$. We prove that for any reductive group scheme $\mathbb{G}$ over $\mathbb{Z}$ such…

Representation Theory · Mathematics 2019-02-20 Alexander Stasinski , Andrea Vera-Gajardo

For any positive integer $m$ and an odd prime $p$; let $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $q=p^{m}$, be a ring extension of the ring $\mathbb{F}_{p}+u\mathbb{F}_{p}.$ In this paper, we construct linear codes over…

Information Theory · Computer Science 2024-06-27 Pavan Kumar , Noor Mohammad Khan

A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…

Information Theory · Computer Science 2015-12-23 Can Xiang

We classify all $q$-ary $\Delta$-divisible linear codes which are spanned by codewords of weight $\Delta$. The basic building blocks are the simplex codes, and for $q=2$ additionally the first order Reed-Muller codes and the parity check…

Combinatorics · Mathematics 2023-05-23 Michael Kiermaier , Sascha Kurz

It is proved that for each prime field $GF(p)$, there is an integer $f(p)$ such that a 4-connected matroid has at most $f(p)$ inequivalent representations over $GF(p)$. We also prove a stronger theorem that obtains the same conclusion for…

Combinatorics · Mathematics 2011-01-26 Jim Geelen , Geoff Whittle

We propose a binary representation of categorical values using a linear map. This linear representation preserves the neighborhood structure of categorical values. In the context of evolutionary algorithms, it means that every categorical…

Neural and Evolutionary Computing · Computer Science 2021-06-15 Arnaud Berny

We prove that if M is a vertically 4-connected matroid with a modular flat X of rank at least three, then every representation of M | X over a finite field F extends to a unique F-representation of M. A corollary is that when F has order q,…

Combinatorics · Mathematics 2013-04-25 Jim Geelen , Rohan Kapadia

In this paper, for an odd prime power $q$, we extend the construction of Xie et al. \cite{XOYM2023} to propose two classes of linear codes $\mathcal{C}_{Q}$ and $\mathcal{C}_{Q}'$ over the finite field $\mathbb{F}_{q}$ with at most four…

Information Theory · Computer Science 2025-12-17 Xiumei Li , Xiaotong Sun , Min Sha

We classify representations of the mapping class group of a surface of genus $g$ (with at most one puncture or boundary component) up to dimension $3g-3$. Any such representation is the direct sum of a representation in dimension $2g$ or…

Geometric Topology · Mathematics 2025-07-16 Julian Kaufmann , Nick Salter , Zhong Zhang , Xiyan Zhong

We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…

Information Theory · Computer Science 2020-11-23 Hugues Randriambololona

We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property,…

Number Theory · Mathematics 2012-09-11 Rafe Jones

We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…

Information Theory · Computer Science 2023-12-25 Peter Beelen , Trygve Johnsen , Prasant Singh

In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…

Information Theory · Computer Science 2022-01-03 Yansheng Wu , Chengju Li , Fu Xiao

Polyhedra and spectrahedra over the real numbers, or more generally their images under linear maps, are respectively the feasible sets of linear and semidefinite programming, and form the family of semidefinite-representable sets. This…

Algebraic Geometry · Mathematics 2026-05-13 Corentin Cornou , Simone Naldi , Tristan Vaccon

This short note introduces a geometric representation for binary (or ternary) sequences. The proposed representation is linked to multivariate data plotting according to the radar chart. As an illustrative example, the binary Hamming…

Information Theory · Computer Science 2021-03-09 H. M. de Oliveira , R. J. Cintra

We investigate generalized quadratic forms with values in the set of rational integers over quadratic fields. We characterize the real quadratic fields which admit a positive definite binary generalized form of this type representing every…

Let F be a non-Archimedean locally compact field of residue characteristic p, let G be an inner form of GL(n,F) with n>0, and let l be a prime number different from p. We describe the block decomposition of the category of finite length…

Representation Theory · Mathematics 2022-04-28 Bastien Drevon , Vincent Sécherre

We present a simple proof that finding a rank-$R$ canonical polyadic decomposition of a 3-dimensional tensor over a finite field $\mathbb{F}$ is fixed-parameter tractable with respect to $R$ and $\mathbb{F}$. We also show a nontrivial upper…

Computational Complexity · Computer Science 2024-06-18 Jason Yang
‹ Prev 1 3 4 5 6 7 10 Next ›