Related papers: Permutation equivalent maximal irreducible Goppa c…

We obtain an asymptotic formula in q for the number of MDS codes of length n and dimension k over a finite field with q elements.

We study the list-decoding problem of alternant codes, with the notable case of classical Goppa codes. The major consideration here is to take into account the size of the alphabet, which shows great influence on the list-decoding radius.…

In a recent paper, we defined twisted unitary $1$-groups and showed that they automatically induced error-detecting quantum codes. We also showed that twisted unitary $1$-groups correspond to irreducible products of characters thereby…

In this article we calculate the minimal faithful permutation degree for all of the irreducible Coxeter groups. We also exhibit new examples of finite groups that possess a quotient whose minimal degree is strictly greater than that of the…

In this paper we prove that among the permutations of length n with i fixed points and j excedances, the number of 321-avoiding ones equals the number of 132-avoiding ones, for all given i,j<=n. We use a new technique involving diagonals of…

We consider recursive decoding techniques for RM codes, their subcodes, and newly designed codes. For moderate lengths up to 512, we obtain near-optimum decoding with feasible complexity.

We investigate the relation between the girth and the guaranteed error correction capability of $\gamma$-left regular LDPC codes when decoded using the bit flipping (serial and parallel) algorithms. A lower bound on the number of variable…

Here we prove that a commuting variety associated with a symmetric pair (g, g_0) is irreducible for (so_{n+m}, so_n + so_m) and reducible for (gl_{n+m}, {gl}_n + gl_m) with n>m, (so_{2n}, gl_n) with odd n, (E_6, {so}_{10} + k).

Recursive permutations whose cycles are the classes of a decidable equivalence relation are studied; the set of these permutations is called $\mathrm{Perm}$, the group of all recursive permutations $\mathcal{G}$. Multiple equivalent…

Let $n_k(s)$ be the maximal length $n$ such that a quaternary additive $[n,k,n-s]_4$-code exists. We solve a natural asymptotic problem by determining the lim sup $\lambda_k$ of $n_k(s)/s,$ and the smallest value of $s$ such that…

An n-ary operation q:A^n->A is called an n-ary quasigroup of order |A| if in x_0=q(x_1,...,x_n) knowledge of any n elements of x_0,...,x_n uniquely specifies the remaining one. An n-ary quasigroup q is permutably reducible if…

For a finite group $G$, let $a_n(G)$ be the number of subgroups of order $n$ and define $\zeta_G(s)=\sum_{n\ge 1} a_n(G)n^{-s}$. Examples are known of non-isomorphic finite groups with the same group zeta function. However, no general…

We enumerate the number of complex irreducible representations of each degree of general unitary groups of degree 4 over principal ideal rings of length 2.

An upper bound on degrees of elements of a minimal generating system for invariants of quivers of dimension (2,...,2) is established over a field of arbitrary characteristic and its precision is estimated. The proof is based on the…

We classify indecomposable commutative separable (special Frobenius) algebras and their local modules in (untwisted) group-theoretical modular categories. This gives a description of modular invariants for group-theoretical modular data. As…

In mutation testing the question whether a mutant is equivalent to its program is important in order to compute the correct mutation score. Unfortunately, answering this question is not always possible and can hardly be obtained just by…

Let $\mathbb F_q$ denote the finite field with $q$ elements. In this paper we use the relationship between suitable polynomials and number of rational points on algebraic curves to give the exact number of elements $a\in \mathbb F_q$ for…

Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…

We give a 1-sided randomised algorithm to detect when a permutation group of degree n, given by generators, contains the alternating group of degree n. This improves on standard methods, and on an algorithm of P. Cameron and J. Cannon.

We consider $U_{q}(\mathfrak{gl}_{n})$, the quantum group of type $A$ for $|q| = 1$, $q$ generic. We provide formulas for signature characters of irreducible finite-dimensional highest weight modules and Verma modules. In both cases, the…