English
Related papers

Related papers: Geometric representations of linear codes

200 papers

We say that a binary linear code C has a geometric representation if there exists a two dimensional simplicial complex D such that C is a punctured code of the kernel ker D of the incidence matrix of D and dim C = dim ker D. We show that…

Combinatorics · Mathematics 2012-12-06 Pavel Rytíř

For every linear binary code $C$, we construct a geometric triangular configuration $\Delta$ so that the weight enumerator of $C$ is obtained by a simple formula from the weight enumerator of the cycle space of $\Delta$. The triangular…

Combinatorics · Mathematics 2010-08-23 Pavel Rytíř

Recently, linear codes with few weights have been widely studied, since they have applications in data storage systems, communication systems and consumer electronics. In this paper, we present a class of three-weight and five-weight linear…

Information Theory · Computer Science 2015-09-22 Fei Li , Qiuyan Wang , Dongdai Lin

Self-orthogonal codes are an important subclass of linear codes which have nice applications in quantum codes and lattices. It is known that a binary linear code is self-orthogonal if its every codeword has weight divisible by four, and a…

Information Theory · Computer Science 2023-11-21 Xiaoru Li , Ziling Heng

Linear codes have been an interesting subject of study for many years. Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, a class of three-weight linear codes over Fp…

Information Theory · Computer Science 2015-12-24 Qiuyan Wang , Fei Li , Dongdai Lin

We prove that many representations $\overline{\rho} : \operatorname{Gal}(\overline{K} / K) \to \operatorname{GL}_2(\mathbb{F}_3)$, where $K$ is a CM field, arise from modular elliptic curves. We prove similar results when the prime $p = 3$…

Number Theory · Mathematics 2022-09-05 Patrick B. Allen , Chandrashekhar Khare , Jack A. Thorne

A well-known result on Lie Theory states that every finite-dimensional complex solvable Lie algebra can be represented as a matrix Lie algebra, with upper-triangular square matrices as elements. However, this result does not specify which…

Representation Theory · Mathematics 2014-04-15 Manuel Ceballos , Juan Núñez , Ángel F. Tenorio

A linear code of length $n$ over a finite chain ring $R$ with residue field $\F_q$ is a $R$-submodule of $R^n$. A $R$-linear code is a code over $\F_q$ (not necessarily linear) which is the generalized Gray map image of a linear code over…

Information Theory · Computer Science 2025-12-03 Cristina Fernández-Córdoba , Sergi Sánchez-Aragón , Mercè Villanueva

Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of…

Information Theory · Computer Science 2016-01-27 Can Xiang , Chunming Tang , Keqin Feng

Let $F$ be a finite extension of ${\mathbb{Q}} \_p$. Any dihedral supercuspidal representation of $GL \_2 (K)$ arises from an admissible multiplicative character $\omega$ of a quadratic extension $L$ of $K$. We show that such a…

Representation Theory · Mathematics 2007-05-23 Nadir Matringe

The constrained linear representability problem (CLRP) for polymatroids determines whether there exists a polymatroid that is linear over a specified field while satisfying a collection of constraints on the rank function. Using a computer…

Information Theory · Computer Science 2017-02-03 Jayant Apte , John MacLaren Walsh

This paper defines a linear representation for nonlinear maps $F:\mathbb{F}^n\rightarrow\mathbb{F}^n$ where $\mathbb{F}$ is a finite field, in terms of matrices over $\mathbb{F}$. This linear representation of the map $F$ associates a…

Symbolic Computation · Computer Science 2024-04-04 Ramachandran Anantharaman , Virendra Sule

We examine the structure of the insertion-elimination Lie algebra on rooted trees introduced in \cite{CK}. It possesses a triangular structure $\g = \n_+ \oplus \mathbb{C}.d \oplus \n_-$, like the Heisenberg, Virasoro, and affine algebras.…

Quantum Algebra · Mathematics 2009-11-13 Matthew Szczesny

This book is mainly an exposition of the author's works and his joint works with his former students on explicit representations of finite-dimensional simple Lie algebras, related partial differential equations, linear orthogonal algebraic…

Representation Theory · Mathematics 2016-01-29 Xiaoping Xu

We study $t$-designs of parameters $(n,k,\lambda)$ over finite fields as group divisible designs and set systems admitting a transitive action of a linear group encoded in an hypergraph $G$ whose vertex set of size $n$ is partitioned into…

Combinatorics · Mathematics 2018-10-26 Alberto Besana , Cristina Martinez

Let F be a finite extension of Qp and G be GL(2,F). When V is the tensor product of three admissible, irreducible, finite dimensional representations of G, the space of G-invariant linear forms has dimension at most one. When a non zero…

Number Theory · Mathematics 2007-05-23 Louise Nyssen

Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of $p$-ary linear codes with two or three weights are constructed…

Information Theory · Computer Science 2015-10-20 Zhengchun Zhou , Nian Li , Cuiling Fan , Tor Helleseth

Given three irreducible, admissible, infinite dimensional complex representations of GL2(F), with F a local field, the space of trilinear functionals invariant by the group has dimension at most one. When it is one we provide an explicit…

Number Theory · Mathematics 2010-05-06 Mladen Dimitrov , Louise Nyssen

We construct two series of linear codes over finite ring $\mathbb{F}_{q}[x]/(x^2)$ and Galois ring $GR(p^2,m)$ respectively reaching the Griesmer bound. They derive two series of codes over finite field $\mathbb{F}_{q}$ by Gray map. The…

Information Theory · Computer Science 2016-12-06 Jin Li , Aixian Zhang , Keqin Feng

The critical exponent of a matroid is one of the important parameters in matroid theory and is related to the Rota and Crapo's Critical Problem. This paper introduces the covering dimension of a linear code over a finite field, which is…

Information Theory · Computer Science 2015-04-10 Thomas Britz , Keisuke Shiromoto
‹ Prev 1 2 3 10 Next ›