default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDApplicable Algebra in Engineering, Communication and Computing, Volume 31
Volume 31, Number 1, January 2020
- Giuseppe Zito:
Arf good semigroups with fixed genus. 1-21 - Arti D. Yardi
, Saravanan Vijayakumaran:
Properties of syndrome distribution for blind reconstruction of cyclic codes. 23-41 - Rafael A. Arce-Nazario, Francis N. Castro, Domingo Gómez-Pérez, Oscar Moreno, José R. Ortiz-Ubarri, Ivelisse Rubio, Andrew Z. Tirkel:
Multidimensional linear complexity analysis of periodic arrays. 43-63 - R. K. Sharma, Rohit Gupta:
Determination of a type of permutation binomials and trinomials. 65-86
Volume 31, Number 2, March 2020
- Gert-Martin Greuel, Thuy Huong Pham:
Algorithms for group actions in arbitrary characteristic and a problem in singularity theory. 87-100 - Didier Henrion, Simone Naldi, Mohab Safey El Din:
Real root finding for low rank linear matrices. 101-133 - Fatma Çaliskan, Refia Aksoy:
Linear codes over $\mathbb {F}_2 \times (\mathbb {F}_2+v\mathbb {F}_2)$ and the MacWilliams identities. 135-147 - Dae-Woong Lee:
Digital H-spaces and actions in the pointed digital homotopy category. 149-169
Volume 31, Numbers 3-4, June 2020
- Kenza Guenda, Iiro S. Honkala, Ilias S. Kotsireas, Teo Mora, Qiang Wang:
Special Issue: "Computer Algebra and Application to Combinatorics, Coding Theory and Cryptography" ACA 2019, Montreal, Canada, July 16-20, 2019. 171-172 - Swati Bhardwaj, Madhu Raka:
Skew constacyclic codes over a non-chain ring ${\mathbb {F}}_{q}[u, v]/\langle f(u), g(v), uv-vu\rangle $. 173-194 - Curtis Bright, Kevin K. H. Cheung, Brett Stevens, Dominique Roy, Ilias S. Kotsireas, Vijay Ganesh:
A nonexistence certificate for projective planes of order ten with weight 15 codewords. 195-213 - Michela Ceria, Teo Mora, Massimiliano Sala:
HELP: a sparse error locator polynomial for BCH codes. 215-233 - Boo Barkee, Michela Ceria, Theo Moriarty, Andrea Visconti:
Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures. 235-252 - Juliano B. Lima, Daniel Panario:
A trigonometric approach for Dickson polynomials over fields of characteristic two. 253-270 - Charul Rajput, Maheshanand Bhaintwal:
Optimal RS-like LRC codes of arbitrary length. 271-289 - Hai Q. Dinh, Atul Gaur, Indivar Gupta, Abhay Kumar Singh, Manoj Kumar Singh, Roengchai Tansuchat:
Hamming distance of repeated-root constacyclic codes of length 2ps over ${\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}$. 291-305 - Yan-Ping Wang, Qiang Wang, Wei-Guo Zhang:
Boomerang uniformity of normalized permutation polynomials of low degree. 307-322
Volume 31, Numbers 5-6, November 2020
- Cristina Bertone, Francesca Cioffi, Luis M. Pardo:
Special Issue: "Algebraic Geometry from an Algorithmic Point of View", ACA 2019, Montréal, Canada, July 16-20, 2019. 323-324 - Evangelos Bartzos, Ioannis Z. Emiris, Josef Schicho:
On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs. 325-357 - Michela Ceria, Teo Mora:
Toward involutive bases over effective rings. 359-387 - Gabriel Mattos Langeloh:
A comparison of unrestricted dynamic Gröbner Basis algorithms. 389-409 - John Perry:
A dynamic F4 algorithm to compute Gröbner bases. 411-434 - Adrien Poteaux, Martin Weimann:
Computing the equisingularity type of a pseudo-irreducible polynomial. 435-460 - Michele Rossi, Lea Terracini:
Toric varieties and Gröbner bases: the complete $\mathbb {Q}$-factorial case. 461-482
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
