We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite Algorithm, and its modifications. By identifying specific feedback functions and initial states, we demonstrate that most previously-known greedy algorithms that generate binary de Bruijn sequences are particular cases of our algorithm.

Low-density parity-check (LDPC) codes have been the subject of much interest due to the fact that they can perform near the Shannon limit. In this paper we present a construction of LDPC codes from cubic symmetric graphs. The codes constructed are (3, 3)-regular and the vast majority of the corresponding Tanner graphs have girth greater than four. We analyse properties of the codes obtained and present

The extension problem underlies notions of code equivalence. Two approaches to the extension problem are described. One is a matrix approach that reduces the general problem for weights to one for symmetrized weight compositions. The other is a monoid algebra approach that reframes the extension problem in terms of modules over the monoid algebra determined by the multiplicative monoid of a finite

Traditional global stability measure for sequences is hard to determine because of large search space. We propose the k-error linear complexity with a zone restriction for measuring the local stability of sequences. For several classes of sequences, we demonstrate that the k-error linear complexity is identical to the k-error linear complexity within a zone, while the length of a zone is much smaller

Differential Convolutional Codes with designed Hamming distance are defined, and an algebraic decoding algorithm, inspired by Peterson–Gorenstein–Zierler’s algorithm, is designed for them.

We construct an infinite family of commutative rings \({R_{q,\varDelta }}\) and we study codes over these rings as well as the structure of the rings. We define a canonical Gray map from \({R_{q,\varDelta }}\) to vectors over the residue finite field of q elements and use it to relate codes over \({R_{q,\varDelta }}\) to codes over the finite field \({\mathbb {F}}_q\). Finally, we determine the parameters

Quasi-symmetric (36, 16, 12) designs with intersection numbers \(x=6\), \(y=8\) that cannot be embedded in symmetric (64, 28, 12) designs as residuals are constructed.

The support poset of a monomial ideal \(I\subseteq {{\mathbf {k}}}[x_1,\ldots ,x_n]\) encodes the relation between the variables \(x_1,\ldots ,x_n\) and the minimal monomial generators of I. It is known that not every poset is realizable as the support poset of some monomial ideal. We describe some posets P for which we can explicitly find at least one monomial ideal \(I_P\) such that P is the support

InfoMod is a software devoted to the modular group, \(\mathrm {PSL}_2 (\mathbf {Z})\). It consists of algorithms that deal with the classical correspondences among geodesics on the modular surface, elements of the modular group and binary quadratic forms. In addition, the software implements the recently discovered representation of Gauss’ indefinite binary quadratic forms and their classes in terms

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems and communication systems as they have efficient encoding and decoding algorithms. In this paper, by investigating the solutions of certain equations over finite fields, we make progress towards three conjectures about optimal ternary cyclic codes which were proposed by Ding and Helleseth

The q-analog of Kostant’s weight multiplicity formula is an alternating sum over a finite group, known as the Weyl group, whose terms involve the q-analog of Kostant’s partition function. This formula, when evaluated at \(q=1\), gives the multiplicity of a weight in a highest weight representation of a simple Lie algebra. In this paper, we consider the Lie algebra \(\mathfrak {sl}_4(\mathbb {C})\)

For a prime p and positive integers m, n, let \({{\mathbb {F}}}_q\) be a finite field with \(q=p^m\) elements and \({{\mathbb {F}}}_{q^n}\) be an extension of \({{\mathbb {F}}}_q.\) Let h(x) be a polynomial over \({{\mathbb {F}}}_{q^n}\) satisfying the following conditions: (i) \({\mathrm{Tr}}_m^{nm}(x)\circ h(x)=\tau (x)\circ {\mathrm{Tr}}_m^{nm}(x)\); (ii) For any \(s \in {{\mathbb {F}}}_{q}\), h(x)

Germs of plane curve singularities can be classified accordingly to their equisingularity type. For singularities over \(\mathbb {C}\), this important data coincides with the topological class. In this paper, we characterise a family of singularities, containing irreducible ones, whose equisingularity type can be computed in an expected quasi-linear time with respect to the discriminant valuation of

In this paper we extend the theory of involutive divisions to the case of monomials with coefficients over effective rings. Moreover, as regards involutive bases, we study the computation of weak involutive bases and sketch a conjecture on strong involutive bases.

Symplectic self-orthogonal codes over finite fields are an important class of linear codes in coding theory, which can be used to construct quantum codes. In this paper, characterizations of symplectic self-orthogonal codes over finite fields \(F_{q}\) are given. A necessary and sufficient condition for determining symplectic self-orthogonal codes is obtained. Several classes of symplectic self-orthogonal

Let q be a prime power.

An associative memory is a special type of artificial neural network that has the purpose of store input patterns with their corresponding output patterns and efficiently recall a pattern from a noise-distorted version. Presented in this article is a new framework for constructing a binary associative memory model based on two new autoinverse operations called extended XOR/XNOR; these new operations

We present two algorithms determining all the complete and simplicial fans admitting a fixed non-degenerate set of vectors V as generators of their 1-skeleton. The interplay of the two algorithms allows us to discerning if the associated toric varieties admit a projective embedding, in principle for any values of dimension and Picard number. The first algorithm is slower than the second one, but it

Rigid graph theory is an active area with many open problems, especially regarding embeddings in \({\mathbb R}^d\) or other manifolds, and tight upper bounds on their number for a given number of vertices. Our premise is to relate the number of embeddings to that of solutions of a well-constrained algebraic system and exploit progress in the latter domain. In particular, the system’s complex solutions

The F4 algorithm re-imagines Buchberger’s algorithm as the row reduction of a Macaulay matrix: each row corresponds to a polynomial; each reduction of one row by another corresponds to one step of reducing an S-polynomial; and any row that completes reduction with a new pivot position corresponds to a new element of the basis. On the other hand, each column corresponds to a term, so that while it is

When a pairing \(e: {\mathbb {G}}_1 \times {\mathbb {G}}_2 \rightarrow {\mathbb {G}}_{T}\), on an elliptic curve E defined over a finite field \({\mathbb {F}}_q\), is exploited for an identity-based protocol, there is often the need to hash binary strings into \({\mathbb {G}}_1\) and \({\mathbb {G}}_2\). Traditionally, if E admits a twist \({\tilde{E}}\) of order d, then \({\mathbb {G}}_1=E({\mathbb

Dynamic Gröbner Basis algorithms aim to obtain small reduced Gröbner Bases in terms of number of polynomials and monomials. Dynamic algorithms allowing previous leading monomials to change during the execution, called unrestricted algorithms, are underexplored in the literature and the only previous unrestricted algorithm was not implemented. In this paper, we introduce a definition of neighborhoods

In this paper we investigate different questions related to bent–negabent functions. We first take an expository look at the state-of-the-art research in this domain and point out some technical flaws in certain results and fix some of them. Further, we derive a necessary and sufficient condition for which the functions of the form \({\mathbf{x}}\cdot \pi ({\mathbf{y}})\oplus h({\mathbf{y}})\) [Maiorana–McFarland

In this paper, we investigate all coset leaders of primitive BCH codes for \(\delta\) in the range \(1\le \delta \le q^\frac{m+7}{2}\), which extends Liu and Shi’s results. Besides, we also generalize Shi’s results by proposing the maximum designed distance of non-narrow-sense(\(b=k_2q^2+k_1q+k_0\)) primitive BCH codes which can contain their Euclidean dual. At the end, we calculate the dimension of

Interplay between coding theory and combinatorial t-designs has attracted a lot of attention. It is well known that the supports of all codewords of a fixed Hamming weight in a linear code may hold a t-design. In this paper, we first settle the weight distributions of two classes of linear codes, and then determine the parameters of infinite families of 2-designs held in these codes.

In this paper we study a family of Legendre sequences and its pseudo-randomness in terms of their family complexity. We present an improved lower bound on the family complexity of a family based on the Legendre symbol of polynomials over a finite field. The new bound depends on the Lambert W function and the number of elements in a finite field belonging to its proper subfield. Moreover, we present

In this paper we consider in detail the composition of an irreducible polynomial with \(X^2\) and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an irreducible polynomial of degree n and order \(2^rt\) with t odd, the construction produces \(ord_t(2)\) irreducible polynomials of degree n and order t. The construction

Lechuga and Murillo showed that a non-oriented, simple, connected, finite graph G is k-colourable if and only if a certain pure Sullivan algebra associated to G and k is not elliptic. In this paper, we extend this result to simplicial complexes by means of several notions of colourings of these objects.

Let s be a prime power and \( {{{\mathbb {F}}}}_q\) be a finite field with s elements. In this paper, we employ the AGW criterion to investigate the permutation behavior of some polynomials of the form $$\begin{aligned} b(x^q+ax+\delta )^{1+\frac{i(q^2-1)}{d}}+c(x^q+ax+\delta )^{1+\frac{j(q^2-1)}{d}}+L(x) \end{aligned}$$ over \( {{{\mathbb {F}}}}_{q^2}\) with \(a^{1+q}=1, q\equiv \pm 1\pmod {d}\) and

Error-correcting codes that can effectively encode and decode messages of distinct lengths while maintaining a constant blocklength are considered. It is known conventionally that a k-dimensional block code of length n defined over \(\texttt {GF}(q^{n})\) is designed to encode a k-symbol user data in to an n-length codeword, resulting in a fixed-rate coding. In contrast, considering \(q=p^{\lambda

In this paper, we introduce double Quadratic Residue Codes (QRC) of length \(n=p+q\) for prime numbers p and q in the ambient space \({{\mathbb {F}}} _{2}^{p}\times {{\mathbb {F}}}_{2}^{q}.\) We give the structure of separable and non-separable double QRC over this alphabet and we show that interesting double QR codes in this space exist only in the case when \(p=q.\) We give the main properties for

In this paper, we provide new methods and algorithms to construct Euclidean self-dual codes over large finite fields. With the existence of a dual basis, we study dual preserving linear maps, and as an application, we use them to construct self-orthogonal codes over small finite prime fields using the method of concatenation. Many new optimal self-orthogonal and self-dual codes are obtained.

Differential uniformity of permutation polynomials has been studied intensively in recent years due to the differential cryptanalysis of S-boxes. The boomerang attack is a variant of differential cryptanalysis which combines two differentials for the upper part and the lower part of the block cipher. The boomerang uniformity measures the resistance of block ciphers to the boomerang attack. In this

We study the equivalence between the ring learning with errors and polynomial learning with errors problems for cyclotomic number fields, namely: we prove that both problems are equivalent via a polynomial noise increase as long as the number of distinct primes dividing the conductor is kept constant. We refine our bound in the case where the conductor is divisible by at most three primes and we give

For any odd positive integer n, we express cyclic codes over \({\mathbb {Z}}_4\) of length 4n in a new way. Based on the expression of each cyclic code \({\mathcal {C}}\), we provide an efficient encoder and determine the type of \({\mathcal {C}}\). In particular, we give an explicit representation and enumeration for all distinct self-dual cyclic codes over \({\mathbb {Z}}_4\) of length 4n and correct

Let p be an odd prime, and \(\delta\) be an arbitrary unit of the finite chain ring \({\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m} \,\, (u^2=0)\). The Hamming distances of all \(\delta\)-constacyclic codes of length \(2p^s\) over \({\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}\) are completely determined. We provide some examples from which some codes have better parameters than the existing ones. As applications

In 1990 Cooper suggested to use Groebner bases’ computations to decode cyclic codes and his idea gave rise to many research papers. In particular, as proved by Sala-Orsini, once defined the polynomial ring whose variables are the syndromes, the locations and the error values and considered the syndrome ideal, only one polynomial of a lexicographical Groebner basis for such ideal is necessary to decode

Let f(u) and g(v) be two polynomials, not both linear, which split into distinct linear factors over \({\mathbb {F}}_{q}\). Let \({\mathcal {R}}={\mathbb {F}}_{q}[u,v]/\langle f(u),g(v),uv-vu\rangle \) be a finite commutative non-chain ring. In this paper, we study general skew cyclic codes and \(\theta _t\)-skew constacyclic codes over the ring \({\mathcal {R}}\) where \(\theta _t\) is an automorphism

In this paper, we present some work towards a complete characterization of Hilbert quasi-polynomials of graded polynomial rings. In this setting, a Hilbert quasi-polynomial splits in a polynomial F and a lower degree quasi-polynomial G. We completely describe the periodic structure of G. Moreover, we give an explicit formula for the \((n-1)\)th and \((n-2)\)th coefficient of F, where n denotes the

In 1994, Moss Sweedler’s dog proposed a cryptosystem, known as Barkee’s Cryptosystem, and the related cryptanalysis. Its explicit aim was to dispel the proposal of using the urban legend that “Gröbner bases are hard to compute”, in order to devise a public key cryptography scheme. Therefore he claimed that “no scheme using Gröbner bases will ever work”. Later, further variations of Barkee’s Cryptosystem

Using techniques from the fields of symbolic computation and satisfiability checking we verify one of the cases used in the landmark result that projective planes of order ten do not exist. In particular, we show that there exist no projective planes of order ten that generate codewords of weight fifteen, a result first shown in 1973 via an exhaustive computer search. We provide a simple satisfiability

In this paper, we first introduce a trigonometric approach for Dickson polynomials of the first and the second kinds over fields of characteristic two. Employing the proposed concepts, we revisit known properties of such polynomials. Additionally, we derive new results regarding the fixed points and the involutive behavior of Dickson polynomials of the second kind over \({\mathbb {F}}_{2^n}\).

RS-like locally recoverable (LRC) codes have construction based on the classical construction of Reed–Solomon (RS) codes, where codewords are obtained as evaluations of suitably chosen polynomials. These codes were introduced by Tamo and Barg (IEEE Trans Inf Theory 60(8):4661–4676, 2014) where they assumed that the length n of the code is divisible by \(r+1\), where r is the locality of the code. They

In this paper we consider an error-detecting code based on linear quasigroups. Namely, each input block \(a_0a_1\ldots a_{n-1}\) is extended into a block \(a_0a_1\ldots a_{n-1}d_0d_1\ldots d_{n-1}\), where the redundant characters \(d_0, d_1, \ldots , d_{n-1}\) are defined with \(d_i=a_i*a_{i+1}*a_{i+2}\), where \(*\) is a linear quasigroup operation and the operations in the indexes are modulo n.

This paper is a continuation of ideas presented by Bagirmaz (Appl Algebra Eng Commun Comput 30(4):285–297, 2019). Indeed, we introduce the notion of near approximations in a ring, which is an extended notion of a rough approximations in a ring. Then we define lower and upper near subrings based on ideals in a ring and give some properties of such subrings. Furthermore, we obtain a comparison between

Recently, Kim et al. proposed a modified Dual-Ouroboros public-key encryption (\({\textsf{PKE}}\)) using Gabidulin codes to overcome the limitation of having decryption failure in the original Dual-Ouroboros using low rank parity check codes. This modified Dual-Ouroboros \({\textsf{PKE}}\) using Gabidulin codes is proved to be IND–CPA secure, with very compact public key size of 738 bytes achieving

A numerical semigroup S is closed under addition of its divisors (\({\mathcal {C}}\)-semigroup) if the following condition holds: if \(s\in S\setminus \{0\}\) and d is a non trivial divisor of s then \(s+d\in S\). In this paper we prove that the set of all \({\mathcal {C}}\)-semigroups is a Frobenius variety. As a consequence, we give algorithms to compute the set \({\mathcal {C}}\)-semigroups with

We apply fundamental ideas from algebraic topology in mathematics to the digital world in computer science. We develop digital H-spaces and digital H-functions between the digital H-spaces with digital multiplications, and construct a necessary and sufficient condition for a digital H-space (or a digital homotopy associative H-space, a digital homotopy commutative H-space, or a digital H-group) to

In this work, we study linear codes over the ring \(\mathbb {F}_2 \times (\mathbb {F}_2+v\mathbb {F}_2)\) and their weight enumerators, where \(v^2=v\). We first give the structure of the ring and investigate linear codes over this ring. We also define two weights called Lee weight and Gray weight for these codes. Then we introduce two Gray maps from \(\mathbb {F}_2 \times (\mathbb {F}_2+v\mathbb {F}_2)\)

We consider \(m \times s\) matrices (with \(m\ge s\)) in a real affine subspace of dimension n. The problem of finding elements of low rank in such spaces finds many applications in information and systems theory, where low rank is synonymous of structure and parsimony. We design computer algebra algorithms, based on advanced methods for polynomial system solving, to solve this problem efficiently

Let \({M}_{m,n}\) denote the space of \(m\times n\) matrices with entries in the formal power series ring \(K[[x_1,\ldots , x_s]], K\) an arbitrary field. We consider different groups G acting on \(M_{m,n}\) by formal change of coordinates, combined with the multiplication by invertible matrices. This includes right and contact equivalence of functions, mappings, and ideals. A matrix A is called finitely