English
Related papers

Related papers: Optimal Anticodes, Diameter Perfect Codes, Chains …

200 papers

Let the design of an experiment be represented by an $s$-dimensional vector $\mathbf {w}$ of weights with nonnegative components. Let the quality of $\mathbf {w}$ for the estimation of the parameters of the statistical model be measured by…

Statistics Theory · Mathematics 2015-10-16 Guillaume Sagnol , Radoslav Harman

Let $\mathbb{F}_q$ denote the finite field of order $q,$ $n$ be a positive integer coprime to $q$ and $t \geq 2$ be an integer. In this paper, we enumerate all the complementary-dual cyclic $\mathbb{F}_q$-linear $\mathbb{F}_{q^t}$-codes of…

Combinatorics · Mathematics 2017-02-03 Anuradha Sharma , Taranjot Kaur

Recently, linear codes constructed from defining sets have been investigated extensively and they have many applications. In this paper, for an odd prime $p$, we propose a class of $p$-ary linear codes by choosing a proper defining set.…

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

We develop an algebraic theory of supports for $R$-linear codes of fixed length, where $R$ is a finite commutative unitary ring. A support naturally induces a notion of generalized weights and allows one to associate a monomial ideal to a…

Information Theory · Computer Science 2022-01-19 Elisa Gorla , Alberto Ravagnani

Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random network coding. In this paper, we show that constant-rank codes are closely related to constant-dimension codes and…

Information Theory · Computer Science 2008-05-07 Maximilien Gadouleau , Zhiyuan Yan

In this paper, we consider codes over finite fields, finite abelian groups, and finite Frobenius rings. For such codes, the complete weight enumerator and the Hamming weight enumerator serve as powerful tools. These two types of weight…

Information Theory · Computer Science 2025-11-03 S. T. Dougherty , C. Fernández-Córdoba

In this work we study the set of leader codewords of a non-binary linear code. This set has some nice properties related to the monotonicity of the weight compatible order on the generalized support of a vector in $\mathbb F_q^n$. This…

Information Theory · Computer Science 2014-12-01 Mijail Borges-Quintana , Miguel Angel Borges-Trenard , Edgar Martinez-Moro

We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspond to a projective system containing all the points in a…

Combinatorics · Mathematics 2017-10-24 Relinde Jurrius

Self-dual codes are important because many of the best codes known are of this type and they have a rich mathematical theory. Topics covered in this survey include codes over F_2, F_3, F_4, F_q, Z_4, Z_m, shadow codes, weight enumerators,…

Combinatorics · Mathematics 2007-07-16 E. M. Rains , N. J. A. Sloane

Let G be an edge-weighted hypergraph on n vertices, m edges of size \le s, where the edges have real weights in an interval [1,W]. We show that if we can approximate a maximum weight matching in G within factor alpha in time T(n,m,W) then…

Data Structures and Algorithms · Computer Science 2011-01-12 Andrzej Lingas , Cui Di

Let $\mathcal{Q}(\varphi):=\int_\Omega \big(|\nabla \varphi|^p+V|\varphi|^p\big)\dnu$ on $\core$, and assume that $\mathcal{Q}\geq 0$. The aim of the paper is to obtain ''as large as possible" nonnegative (optimal) Hardy-type weight $W$…

Analysis of PDEs · Mathematics 2013-12-24 Baptiste Devyver , Yehuda Pinchover

Linear codes with a few weights are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of $q$-ary linear codes from trace and norm functions over finite fields. The weight…

Information Theory · Computer Science 2017-07-25 Ziling Heng , Qin Yue

We consider the task of weighted first-order model counting (WFOMC) used for probabilistic inference in the area of statistical relational learning. Given a formula $\phi$, domain size $n$ and a pair of weight functions, what is the…

Artificial Intelligence · Computer Science 2022-11-03 Jan Tóth , Ondřej Kuželka

The weight spectra of MDS codes of length $ n $ and dimension $ k $ over the arbitrary alphabets are studied. For all $ q $-ary MDS codes of dimension $ k $ containing the zero codeword, it is shown that all $ k $ weights from $ n $ to $…

Combinatorics · Mathematics 2022-07-18 Tim L. Alderson

We construct linear codes over the finite field Fq from arbitrary simplicial complexes, establishing a connection between topological properties and fundamental coding parameters. First, we study the behaviour of the weights of codewords…

Information Theory · Computer Science 2026-03-05 Antonio Jesús Lorite López , Daniel Camazón Portela , Juan Antonio López Ramos

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…

Information Theory · Computer Science 2019-10-15 Xiaoqiang Wang , Dabin Zheng , Yan Zhang

A $q$-ary $t$-$(n,w,\lambda)$ design is a collection $\mathcal{A}$ of vectors of weight $w$ in $\mathbb{F}_{q}^{n}$ with the property that every vector of weight $t$ in $\mathbb{F}_{q}^{n}$ is contained in exactly $\lambda$ members of…

Information Theory · Computer Science 2026-03-16 Xinghao Wu , Junling Zhou

Let $m \geq 2$ be an integer, and let $\mathbb{F}_q$ be the finite field of prime power order $q.$ Let $\mathcal{R}=\frac{\mathbb{F}_q[u]}{\langle u^2 \rangle}\times \mathbb{F}_q$ be the mixed-alphabet ring, where…

Information Theory · Computer Science 2025-12-29 Leijo Jose , Lavanya G. , Anuradha Sharma

Universally decodable matrices can be used for coding purposes when transmitting over slow fading channels. These matrices are parameterized by positive integers $L$ and $n$ and a prime power $q$. Based on Pascal's triangle we give an…

Information Theory · Computer Science 2007-07-13 Pascal O. Vontobel , Ashwin Ganesan

Following the approach by R. K\"otter and F. R. Kschischang, we study network codes as families of k-dimensional linear subspaces of a vector space F_q^n, q being a prime power and F_q the finite field with q elements. In particular,…

Information Theory · Computer Science 2013-06-25 Elisa Gorla , Alberto Ravagnani