English
Related papers

Related papers: Proofs of Two Conjectures On the Dimensions of Bin…

200 papers

This paper gives a construction of group divisible designs on the binary extension fields with block sizes 3, 4, 5, 6, and 7, respectively, which is motivated from the decoding of binary quadratic residue codes. A conjecture is proposed for…

Combinatorics · Mathematics 2017-01-02 Chong-Dao Lee , Yaotsu Chang , Chia-an Liu

We prove that the Lie algebra $\mathfrak{sl}_n(\textbf{F}_q)$ of traceless matrices over a finite field of characteristic $p$ can be generated by $2$ elements with exceptions when $(n, p)$ is $(3, 3)$ or $(4,2)$. In the latter cases, we…

Rings and Algebras · Mathematics 2025-02-25 Omer Cantor , Urban Jezernik , Andoni Zozaya

We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+\delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that…

Information Theory · Computer Science 2020-12-02 P. G. Boyvalenkov , K. V. Delchev , D. V. Zinoviev , V. A. Zinoviev

Minimal linear codes have interesting applications in secret sharing schemes and secure two-party computation. This paper uses characteristic functions of some subsets of $\mathbb{F}_q$ to construct minimal linear codes. By properties of…

Information Theory · Computer Science 2019-11-21 Sihem Mesnager , Yanfeng Qi , Hongming Ru , Chunming Tang

Recently, it was shown that a binary linear code can be associated to a binomial ideal given as the sum of a toric ideal and a non-prime ideal. Since then two different generalizations have been provided which coincide for the binary case.…

Commutative Algebra · Mathematics 2014-01-14 N. Dück , K. -H. Zimmermann

There exists a large literature of construction of convolutional codes with maximal or near maximal free distance. Much less is known about constructions of convolutional codes having optimal or near optimal column distances. In this paper,…

Information Theory · Computer Science 2023-05-26 Zita Abreu , Julia Lieb , Joachim Rosenthal

In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum…

Combinatorics · Mathematics 2018-10-10 Peter Beelen , Prasant Singh

In this paper, we present a new bordered construction for self-dual codes which employs $\lambda$-circulant matrices. We give the necessary conditions for our construction to produce self-dual codes over a finite commutative Frobenius ring…

Information Theory · Computer Science 2023-03-24 Joe Gildea , Adrian Korban , Adam Michael Roberts , Alexander Tylyshchak

Consider two symmetric $3 \times 3$ matrices $A$ and $B$ with entries in $GF(q)$, for $q=p^n$, $p$ an odd prime. The zero sets of $v^T Av$ and $v^T Bv$ can be viewed as (possibly degenerate) conics in the finite projective coordinate plane…

Combinatorics · Mathematics 2015-07-06 Katharina Kusejko

We introduce a general framework to deterministically construct binary measurement matrices for compressed sensing. The proposed matrices are composed of (circulant) permutation submatrix blocks and zero submatrix blocks, thus making their…

Information Theory · Computer Science 2014-09-26 Xin-Ji Liu , Shu-Tao Xia , Tao Dai

The superselection sectors of two classes of scalar bilocal quantum fields in D>=4 dimensions are explicitly determined by working out the constraints imposed by unitarity. The resulting classification in terms of the dual of the respective…

Mathematical Physics · Physics 2008-11-26 Bojko Bakalov , Nikolay Nikolov , Karl-Henning Rehren , Ivan Todorov

A natural construction of the logarithmic extension of the M(2,p) minimal models is presented, which generalises our previous model [0708.0802] of percolation (p=3). Its key aspect is the replacement of the minimal model irreducible modules…

High Energy Physics - Theory · Physics 2008-11-26 Pierre Mathieu , David Ridout

Double polycirculant codes are introduced here as a generalization of double circulant codes. When the matrix of the polyshift is a companion matrix of a trinomial, we show that such a code is isodual, hence formally self-dual. Numerical…

Cryptography and Security · Computer Science 2020-03-31 Minjia Shi , Li Xu , Patrick Sole

We extend the original cylinder conjecture on point sets in affine three-dimensional space to the more general framework of divisible linear codes over $\mathbb{F}_q$ and their classification. Through a mix of linear programming,…

Combinatorics · Mathematics 2021-12-14 Sascha Kurz , Sam Mattheus

We give an explicit construction of length-$n$ binary codes capable of correcting the deletion of two bits that have size $2^n/n^{4+o(1)}$. This matches up to lower order terms the existential result, based on an inefficient greedy choice…

Information Theory · Computer Science 2020-07-22 Venkatesan Guruswami , Johan Håstad

In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and…

Information Theory · Computer Science 2017-04-03 Maosheng Xiong

We study a new class of codes over Z_2 x Z_2 which we call L-codes. They arise as a natural fifth step in a series of analogies between Kleinian codes, binary codes, lattices and vertex operator algebras. This analogy will be explained in…

Combinatorics · Mathematics 2010-08-12 Julia Galstad , Gerald Hoehn

In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$, where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes and…

Information Theory · Computer Science 2017-04-13 A. Melakhessou , K. Guenda , T. A. Gulliver , M. Shi , P. Solé

It has been known since the 1970's that the difference of the non-zero weights of a projective $\mathbb{F}_q$-linear two-weight has to be a power of the characteristic of the underlying field. Here we study non-projective two-weight codes…

Combinatorics · Mathematics 2024-02-29 Sascha Kurz

The numerical range of a matrix is studied geometrically via the cone of positive semidefinite matrices (or semidefinite cone for short). In particular it is shown that the feasible set of a two-dimensional linear matrix inequality (LMI),…

Optimization and Control · Mathematics 2010-04-08 Didier Henrion