Applicable Algebra in Engineering, Communication and Computing
Publisher: Springer Nature · ISSN 0938-1279,1432-0622 · 83 articles
- Sparse systems and algorithmic equidimensional decomposition
- Towards a library for straight-line programs
- Improving the inserting construction via echelon-Ferrers construction for constant dimension subspace codes
- Algebraic properties of some configurations of fat lines
- Construction of a linear code over a finite commutative ring generated by a set of minimal codewords
-
A convolutional mask for the McEliece cryptosystem with binary Goppa codes
Abstract In this work, we propose a variant of the McEliece cryptosystem using a polynomial mask to hide a binary Goppa code. This new proposal can be seen as a convolutional version of the original McEliece scheme. We analyze its...
- Erzeugungsgrad, VC-dimension and neural networks with rational activation function
- Algorithms to decide the generalised alibi query for space-time prisms with stationary activity time
-
Structural rigidity and flexibility using graphs of groups
Abstract In structural rigidity, one studies frameworks of bars and joints in Euclidean space. Such a framework is an articulated structure consisting of rigid bars joined together at joints around which the bars may rotate. In this...
- Quasi self-dual codes over $$S_{m}(\mathbb {F}_{2})$$
-
Subalgebras of the univariate polynomial algebra
Abstract In previous work we have shown that any subalgebra $$A \subseteq \mathbb {K}[x]$$ A ⊆ K [ x ] of finite codimension n can be described by a finite set $$\text {Sp}(A)$$ Sp ( A ) , called the subalgebra spectrum of A , together...
-
Unified Newton’s method for matrix decompositions
Abstract We propose a way to unify the construction of Newton’s methods for matrix decompositions. This construction is based on a perturbation analysis of a suitable system associated with matrix decompositions. Then it appears that...
- Almost monomial subalgebras of $$\mathbb {K}[x]$$ and their LAGBI bases
- Well-rounded algebraic lattices coming from the maximal real subfield of the 4q-th cyclotomic field, where q is an odd number
- Several new classes of optimal quinary cyclic codes
- Lower bounds on the third-order nonlinearities of biquadratic Boolean functions
-
Classification of quadratic APN functions with coefficients in $$\mathbb {F}_2$$ in dimension 10
Abstract Yu et al. described an algorithm for conducting computational searches for quadratic APN functions over the finite field $$\mathbb {F}_{2^n}$$ , and used this algorithm to give a classification of all quadratic APN functions...
- Weight distribution of a class of p-ary codes
- MDS and AMDS symbol-pair cyclic codes of length 6p
- New MDS symbol-pair codes of length 4p from repeated-root cyclic codes
- Parallel computation of interval bases for persistence module decomposition
- Faster multi-point evaluation over any field
-
Some directed strongly regular graphs constructed from linear groups
Abstract In this paper, we classify directed strongly regular graphs admitting a transitive action of one of the linear groups $$L_2(q), q\le 32$$ , $$L_3(q), q \le 7$$ , and $$L_4(2)$$ , for which the rank of the permutation...
- Scalar products and Left LCD codes
- Linear recurring sequences and weight distributions of some cyclic codes
- Reconstruction of permutations distorted by single ℓ∞-errors
- On the difference of generalized Vandermonde matrices and difference schemes
-
On the security of the initial tropical Stickel protocol and its modification based on Linde–de la Puente matrices
Abstract Recently, a more efficient attack on the initial tropical Stickel protocol has been proposed, different from the previously known Kotov–Ushakov attack, yet equally guaranteed to succeed. Given that the Stickel protocol can be...
- Amds codes and quantum AMDS codes of length $$3p^s$$ over $${\mathbb {F}}_{p^m}$$
- Several new classes of permutation polynomials over finite fields $$\mathbb {F}_{5^{2m}}$$