Related papers: On Binary Codes from Conics in PG(2,q)
Let $p$ be a prime, and $N$ be a positive integer not divisible by $p$. Denote by ${\rm ord}_N(p)$ the multiplicative order of $p$ modulo $N$. Let $\mathbb{F}_q$ represent the finite field of order $q=p^{{\rm ord}_N(p)}$. For $a,…
For a natural number $m$, a Lie algebra $L$ over a field $k$ is said to be of breadth type $(0, m)$ if the co-dimension of the centralizer of every non-central element is of dimension $m$. In this article, we classify finite dimensional…
We study characteristic polynomials of symmetric matrices with entries ${i+j\choose i}$ the binomial coefficients, over finite fields.
We classify the irredible representations of $\mathrm{GL}_{2}(q)$ for which the induction to the product group $\mathrm{GL}_{2}(q)\times\mathrm{GL}_{2}(q)$, under the diagonal embedding, decomposes multiplicity free. It turns out that only…
Linear intersection pairs of linear codes have become of interest due to their nice algebraic properties and wide applications. In this paper, we focus on linear intersection pairs of cyclic codes over finite fields. Some properties of…
We study finite-field extensions that preserve the same support as the parity-check matrices defining a given binary CSS code. Here, an LDPC-CSS code refers to a CSS code whose parity-check matrices are orthogonal in the sense that each…
We present constructions and bounds for additive codes over a finite field in terms of their geometric counterpart, i.e., projective systems. It is known that the maximum number of $(h-1)$-spaces in PG$(2,q)$, such that no hyperplane…
Let F* be the field of q elements and let P(n,q) denote the projective space of dimension n-1 over F*. We construct a family H^{n}_{k,i} of combinatorial homology modules associated to P(n,q) for a coefficient field F of positive…
The aim of this work is to study the structure and properties of the binary LCD codes having an automorphisms of odd prime order and to present a method for their construction.
Motivated by a concept studied in [1], we consider a property of matrices over finite fields that generalizes triangular totally nonsingular matrices to block matrices. We show that (1) matrices with this property suffice to construct good…
Qualitative characteristics and the rigorous definition of a concept of the double symmetry is given. We use some double symmetry for constructing a theory of fields not investigated before which transform as the proper Lorentz group…
Linear codes generated by component functions of perfect nonlinear (PN) and almost perfect nonlinear (APN) functions and the first-order Reed-Muller codes have been an object of intensive study in coding theory. The objective of this paper…
To determine the dimension of null space of any given linearized polynomial is one of vital problems in finite field theory, with concern to design of modern symmetric cryptosystems. But, the known general theory for this task is much far…
We define the generalized hypergeometric polynomial of degree N in terms of the generalized hypergeometric function that depends on p parameters a_1, ..., a_p and q parameters b_1, ..., b_q. The parameters are "generic", possibly complex,…
We classify irreducible unitary representations of the group of all infinite matrices over a $p$-adic field ($p\ne 2$) with integer elements equipped with a natural topology. Any irreducible representation passes through a group $GL$ of…
This paper studies the problem of decomposing a low-rank matrix into a factor with binary entries, either from $\{\pm 1\}$ or from $\{0,1\}$, and an unconstrained factor. The research answers fundamental questions about the existence and…
We study rewriting properties of the column presentation of plactic monoid for any semisimple Lie algebra such as termination and confluence. Littelmann described this presentation using L-S paths generators. Thanks to the shapes of…
A new proof is given for the correctness of the powers of two descent method for computing discrete logarithms. The result is slightly stronger than the original work, but more importantly we provide a unified geometric argument,…
An identity for binomial symbols modulo an odd positive integer $n$ relating to the least prime factor of $n$ is proved. The identity is discussed within the context of Pell conics.
The assumed hardness of the Linear Code Equivalence problem (LCE) lies at the core of the security of the LESS signature scheme and other signature schemes with advanced functionalities. The LCE problem asks to determine whether two linear…