English
Related papers

Related papers: On the classification of weighing matrices and sel…

200 papers

The study of linear codes over a finite field of odd cardinality, derived from determinantal varieties obtained from symmetric matrices of bounded rank, was initiated in a recent paper by the authors. There, one found the minimum distance…

Algebraic Geometry · Mathematics 2024-12-10 Peter Beelen , Trygve Johnsen , Prasant Singh

In this work we develop a geometric approach to the study of rank metric codes. Using this method, we introduce a simpler definition for generalized rank weight of linear codes. We give a complete classification of constant rank weight code…

Information Theory · Computer Science 2020-01-23 Tovohery Hajatiana Randrianarisoa

It is well known that if a finite order linear differential operator with polynomial coefficients has as eigenfunctions a sequence of orthogonal polynomials with respect to a positive measure (with support in the real line), then its order…

Classical Analysis and ODEs · Mathematics 2025-01-28 Antonio J. Durán , Manuel D. De la Iglesia

Let $R$ be a commutative ring with identity. The paper studies the problem of self-orthogonality and self-duality matrix-product codes (MPCs) over $R$. Some methods as well as special matrices are introduced for the construction of such…

Information Theory · Computer Science 2019-10-22 Abdulaziz Deajim , Mohamed Bouye

Cages ($r$-regular graphs of girth $g$ and minimum order) and their variants have been studied for over seventy years. Here we propose a new variant, "weighted cages". We characterize their existence; for cases $g=3,4$ we determine their…

Combinatorics · Mathematics 2024-11-06 G. Araujo-Pardo , C. De la Cruz , M. Matamala , M. A. Pizaña

Self-orthogonal codes are of interest as they have important applications in quantum codes, lattices and many areas. In this paper, based on the weakly regular plateaued functions or plateaued Boolean functions, we construct a family of…

Information Theory · Computer Science 2024-11-08 Peng Wang , Ziling Heng

We present algorithms for classification of linear codes over finite fields, based on canonical augmentation and on lattice point enumeration. We apply these algorithms to obtain classification results over fields with 2, 3 and 4 elements.…

Information Theory · Computer Science 2021-09-21 Iliya Bouyukliev , Stefka Bouyuklieva , Sascha Kurz

A complete classification of quaternary complex Hadamard matrices of orders 10, 12 and 14 is given, and a new parametrization scheme for obtaining new examples of affine parametric families of complex Hadamard matrices is provided. On the…

Combinatorics · Mathematics 2012-04-24 Pekka H. J. Lampio , Ferenc Szöllősi , Patric R. J. Östergård

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

Mutually unbiased weighing matrices (MUWM) are closely related to an antipodal spherical code with 4 angles. In the present paper, we clarify the relationship between MUWM and the spherical sets, and give the complete solution about the…

Combinatorics · Mathematics 2014-04-03 Hiroshi Nozaki , Sho Suda

We study odd-dimensional modular tensor categories and maximally non-self dual (MNSD) modular tensor categories of low rank. We give lower bounds for the ranks of modular tensor categories in terms of the rank of the adjoint subcategory and…

Quantum Algebra · Mathematics 2024-03-13 Agustina Czenky , Julia Plavnik

This paper introduces new reduction and torsion codes for an octonary code and determines their basic properties. These could be useful for the classification of self-orthogonal and self dual codes over $\mathbb{Z}_8$. We also focus our…

Information Theory · Computer Science 2014-12-10 Manoj K. Raut , Manish K. Gupta

In this paper we have discussed different possible orthogonalities in matrices, namely orthogonal, quasi-orthogonal, semi-orthogonal and non-orthogonal matrices including completely positive matrices, while giving some of their…

Discrete Mathematics · Computer Science 2007-05-23 R. N. Mohan

Self-orthogonal codes have been of interest due to there rich algebraic structures and wide applications. Euclidean self-orthogonal codes have been quite well studied in literature. Here, we have focused on Hermitian self-orthogonal codes.…

Information Theory · Computer Science 2017-10-16 Somphong Jitman , Todsapol Mankean

Due to some practical applications, linear complementary dual (LCD) codes and self-orthogonal codes have attracted wide attention in recent years. In this paper, we use simplicial complexes for construction of an infinite family of binary…

Information Theory · Computer Science 2020-03-18 Yansheng Wu , Yoonjin Lee

In this paper, we propose a new method to bound the capacity of checkerboard codes on the hexagonal lattice. This produces rigorous bounds that are tighter than those commonly known.

Information Theory · Computer Science 2017-04-04 Zhun Deng , Jie Ding , Mohammad Noshad , Vahid Tarokh

Tensor codes are a generalisation of matrix codes. Such codes are defined as subspaces of order-r tensors for which the ambient space is endowed with the tensor-rank as a metric. A class of these codes was introduced by Roth, who also…

Information Theory · Computer Science 2026-05-14 Eimear Byrne , Alain Couvreur , Lucien François

In this paper, an algorithm for construction of multiple sets of two dimensional (2D) or matrix unipolar (optical) orthogonal codes has been proposed. Representations of these 2D codes in difference of positions representation (DoPR) have…

Information Theory · Computer Science 2013-09-10 Ram Chandra Singh Chauhan , Yatindra Nath Singh , Rachna Asthana

In this paper, based on the theory of defining sets, two classes of five-weight or six-weight linear codes over Fp are constructed. The weight distributions of the linear codes are determined by means of Weil sums and a new type of…

Information Theory · Computer Science 2021-04-09 Xina Zhang

Matrices over the dual numbers are considered. We propose an approach to classify these matrices up to similarity. Some preliminary results on the realization of this approach are obtained. In particular, we produce explicitly canonical…

Rings and Algebras · Mathematics 2009-10-06 I. M. Trishin