| Four families of minimal binary linear codes with wmin/wmax1/2 |
7 |
| Quantum codes from cyclic codes over the ring Fq+v1Fq++vrFq |
6 |
| Near-rings on digital Hopf groups |
4 |
| Matrix-product structure of constacyclic codes over finite chain rings F-p(m)[u]/< u(e)> |
4 |
| Few-weight codes from trace codes over a local ring |
4 |
| Generalized Walsh transforms of symmetric and rotation symmetric Boolean functions are linear recurrent |
3 |
| Computing weight q-multiplicities for the representations of the simple Lie algebras |
3 |
| Several classes of linear codes and their weight distributions |
3 |
| Extremal invariant polynomials not satisfying the Riemann hypothesis |
2 |
| New quadratic bent functions in polynomial forms with coefficients in extension fields |
2 |
| Fixed points of rational functions satisfying the Carlitz property |
2 |
| Two classes of optimal frequency-hopping sequences with new parameters |
2 |
| A class of primitive BCH codes and their weight distribution |
2 |
| Complete classification of (delta plus alpha u(2))-constacyclic codes over F-3m[u]/< u(4)> of length 3n |
2 |
| On division polynomial PIT and supersingularity |
1 |
| Six new classes of permutation trinomials over F-3(3k) |
1 |
| A class of cyclotomic linear codes and their generalized Hamming weights |
1 |
| Factoring RSA moduli with primes sharing bits in the middle |
1 |
| LCD codes from adjacency matrices of graphs |
1 |
| On the optimality of lattices for the coppersmith technique |
1 |
| On codes over Frobenius rings: generating characters, MacWilliams identities and generator matrices |
1 |
| A further study of the linear complexity of new binary cyclotomic sequence of length p(r) |
1 |
| A note on the generalized Hamming weights of Reed-Muller codes |
1 |
| A class of 2D skew-cyclic codes over F-q + uF(q) |
1 |
| Near approximations in groups |
1 |
| Several classes of binary linear codes and their weight enumerators |
1 |
| The connection between quadratic bent-negabent functions and the Kerdock code |
1 |
| On extremal double circulant self-dual codes of lengths 90-96 |
1 |
| Computing with D-algebraic power series |
1 |
| Directed path spaces via discrete vector fields |
0 |
| A characterization of all semiprimitive irreducible cyclic codes in terms of their lengths |
0 |
| n-dimensional optical orthogonal codes, bounds and optimal constructions |
0 |
| A Swan-like note for a family of binary pentanomials |
0 |
| Orthogonal matrix and its application in Bloom's threshold scheme |
0 |
| On the Cipolla-Lehmer type algorithms in finite fields |
0 |
| Three questions of Bertram on locally maximal sum-free sets |
0 |
| On the near prime-order MNT curves |
0 |
| Conditions for confluence of innermost terminating term rewriting systems |
0 |
| Counting extended irreducible Goppa codes |
0 |
| Approximately Gamma-semigroups in proximal relator spaces |
0 |
| Fast Grobner basis computation and polynomial reduction for generic bivariate ideals |
0 |
| On the annihilator ideal of an inverse form: addendum |
0 |
| A further construction of asymptotically optimal codebooks with multiplicative characters |
0 |
| Complete decompositions of finite abelian groups |
0 |
| From implicit to recursive equations |
0 |
| Greedy construction of DNA codes and new bounds |
0 |
| Some new linear codes from skew cyclic codes and computer algebra challenges |
0 |
| Cryptanalysis of a key exchange protocol based on the ring |
0 |
| Iterated local transitivity model for signed social networks |
0 |
| Choosing and generating parameters for pairing implementation on BN curves |
0 |
