Applicable Algebra in Engineering, Communication and Computing, Volume 35 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• > Home > Journals > Applicable Algebra in Engineering, Communication and Computing

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 35, Number 1, January 2024

Special Issue: 27th International Conference on Applications of Computer Algebra, Istanbul, August 15-19, 2022

• 
  • 
  • 
  • 
  • 
    Preface. 1-2
• 
  • 
  • 
  • 
  • 
    Malihe Aliasgari, Daniel Panario, Mohammad-Reza Sadeghi:
    Linear label code of a root lattice using Gröbner bases. 3-15
• 
  • 
  • 
  • 
  • 
    Marcin Choinski:
    A discrete SIS-model built on the strictly positive scheme. 17-30
• 
  • 
  • 
  • 
  • 
    Alexander Levin:
    Generalized characteristic sets and new multivariate difference dimension polynomials. 31-53
• 
  • 
  • 
  • 
  • 
    Katsusuke Nabeshima:
    Generic Gröbner basis of a parametric ideal and its application to a comprehensive Gröbner system. 55-70
• 
  • 
  • 
  • 
  • 
    Luis M. Pardo:
    Exploring implications of Trace (Inversion) formula and Artin algebras in extremal combinatorics. 71-118

Volume 35, Number 2, March 2024

• 
  • 
  • 
  • 
  • 
    Teo Mora:
    In memoriam Kai-Uwe Schmidt. 119
• 
  • 
  • 
  • 
  • 
    Joris van der Hoeven, Grégoire Lecerf:
    Univariate polynomial factorization over finite fields with large extension degree. 121-149
• 
  • 
  • 
  • 
  • 
    Ismail Aydogdu, Taher Abualrub, Karim Samei: mathbbFq2{\mathbb {F}}_{q^{2}}mathbbFq2-double cyclic codes with respect to the Hermitian inner product. 151-166
• 
  • 
  • 
  • 
  • 
    Wei Cao:
    Normal bases and factorization of xn-1 in finite fields. 167-175
• 
  • 
  • 
  • 
  • 
    Dean Crnkovic, Nina Mostarac, Andrea Svob:
    Distance-regular graphs and new block designs obtained from the Mathieu groups. 177-194
• 
  • 
  • 
  • 
  • 
    Hai Q. Dinh, Pramod Kumar Kewat, Nilay Kumar Mondal:
    Symbol-pair distance of some repeated-root constacyclic codes of length ps over the Galois ring ,mathrmGR,(pa,m){{\, \mathrm{GR}\, }}(p^a, m),mathrmGR,(pa,m). 195-205
• 
  • 
  • 
  • 
  • 
    María Laura Barbagallo, Gabriela Jeronimo, Juan Sabia:
    Decision problem for a class of univariate Pfaffian functions. 207-232
• 
  • 
  • 
  • 
  • 
    Andrea Flamini, Riccardo Longo, Alessio Meneghetti:
    Multidimensional Byzantine agreement in a synchronous setting. 233-251
• 
  • 
  • 
  • 
  • 
    Pamela E. Harris, Peter Hollander, Daniel C. Qin, Maria Rodriguez-Hertz:
    On Kostant's weight q-multiplicity formula for mathfraksmathfrakp_6(mathbbC){{\mathfrak {s}}}{{\mathfrak {p}}}_6({\mathbb {C}})mathfraksmathfrakp_6(mathbbC). 253-289

Volume 35, Number 3, May 2024

• 
  • 
  • 
  • 
  • 
    Yuan Cao, Yonglin Cao, Fang-Wei Fu, Fanghui Ma:
    Constructing and expressing Hermitian self-dual cyclic codes of length ps over mathbbFpm+umathbbFpm{\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}mathbbFpm+umathbbFpm. 291-314
• 
  • 
  • 
  • 
  • 
    Hai Q. Dinh, Ha T. Le, Bac Trong Nguyen, Paravee Maneejuk:
    δ-dual codes over finite commutative semi-simple rings. 315-335
• 
  • 
  • 
  • 
  • 
    Yanping Wang, Zhengbang Zha, Xiaoni Du, Dabin Zheng:
    Several classes of permutation polynomials with trace functions over mathbbFpn\mathbb {F}_{p^n}mathbbFpn. 337-349
• 
  • 
  • 
  • 
  • 
    Antonio J. Di Scala, Carlo Sanna, Edoardo Signorini:
    RLWE and PLWE over cyclotomic fields are not equivalent. 351-358
• 
  • 
  • 
  • 
  • 
    Bingbing Duan, Guangguo Han, Yanfeng Qi:
    A class of three-weight linear codes over finite fields of odd characteristic. 359-375
• 
  • 
  • 
  • 
  • 
    Xiang Wang, Wenjuan Yin, Fang-Wei Fu:
    Nonexistence of perfect permutation codes under the ℓ ∞ -metric. 377-391
• 
  • 
  • 
  • 
  • 
    Jon-Lark Kim, Young Gun Roe:
    Construction of quasi self-dual codes over a commutative non-unital ring of order 4. 393-406
• 
  • 
  • 
  • 
  • 
    Lei Wan, Jingjun Bao:
    New constructions of optimal frequency hopping sequences. 407-432

Volume 35, Number 4, July 2024

• 
  • 
  • 
  • 
  • 
    Saúl A. Blanco, Charles Buehrle:
    Presentations of Coxeter groups of type A, B, and D using prefix-reversal generators. 433-454
• 
  • 
  • 
  • 
  • 
    Lu Zhao, Yongzhen Pei, Tianqing Cao, Jiao Du:
    Linear complexity of two classes of quaternary sequences based on sign alternation transformation. 455-484
• 
  • 
  • 
  • 
  • 
    Hai Q. Dinh, Bhanu Pratap Yadav, Sachin Pathak, Abhyendra Prasad, Ashish Kumar Upadhyay, Woraphon Yamaka:
    ℤ4ℤ4ℤ4-additive cyclic codes are asymptotically good. 485-505
• 
  • 
  • 
  • 
  • 
    Kanat Abdukhalikov, Rongquan Feng, Duy Ho:
    Quadratic bent functions and their duals. 507-523
• 
  • 
  • 
  • 
  • 
    Lei Sun, Zexia Shi:
    The linear structures and fast points of rotation symmetric Boolean functions. 525-544
• 
  • 
  • 
  • 
  • 
    Nazahet Fellah, Kenza Guenda, Ferruh Özbudak, Padmapani Seneviratne:
    Construction of self dual codes from graphs. 545-556
• 
  • 
  • 
  • 
  • 
    Hai Q. Dinh, Pramod Kumar Kewat, Nilay Kumar Mondal:
    Maximum distance separable repeated-root constacyclic codes over mathbbF2m+umathbbF2m\mathbb {F}_{2^m}+u\mathbb {F}_{2^m}mathbbF2m+umathbbF2m with respect to the Lee distance. 557-571
• 
  • 
  • 
  • 
  • 
    Boran Kim:
    Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes. 573-588
• 
  • 
  • 
  • 
  • 
    Boran Kim:
    Correction: Determination for minimum symbol-pair and RT weights via torsional degrees of repeated-root cyclic codes. 589

Volume 35, Number 5, September 2024

• 
  • 
  • 
  • 
  • 
    Tsuyoshi Miezaki, Hiroyuki Nakasora:
    On the support t-designs of extremal Type III and IV codes. 591-613
• 
  • 
  • 
  • 
  • 
    Mitra Jalali, Reza Nikandish:
    Strong metric dimension in annihilating-ideal graph of commutative rings. 615-627
• 
  • 
  • 
  • 
  • 
    Augustine Musukwa, Massimiliano Sala, Irene Villa, Marco Zaninelli:
    On cryptographic properties of cubic and splitting Boolean functions. 629-645
• 
  • 
  • 
  • 
  • 
    Wenshuo Guo, Fang-Wei Fu:
    Two modifications for Loidreau's code-based cryptosystem. 647-665
• 
  • 
  • 
  • 
  • 
    Huaning Liu, Yixin Ren:
    Balance, pattern distribution and linear complexity of M-ary sequences from Sidel'nikov sequences. 667-682
• 
  • 
  • 
  • 
  • 
    Xiaoshan Quan, Qin Yue:
    Note on the dimension of Goppa codes. 683-690
• 
  • 
  • 
  • 
  • 
    Cuiling Fan, Xiaoxiao Cui, Wei Su:
    Constructions of low-hit-zone frequency hopping sequence sets from cyclic codes. 691-701
• 
  • 
  • 
  • 
  • 
    Rodrigo Iglesias, Eduardo Sáenz-de-Cabezón:
    Cellular structure of the Pommaret-Seiler resolution for quasi-stable ideals. 703-724

Volume 35, Number 6, November 2024

• 
  • 
  • 
  • 
  • 
    Hanglong Zhang, Xiwang Cao:
    On the existence of r-primitive pairs (α ,f(α )) in finite fields. 725-738
• 
  • 
  • 
  • 
  • 
    Simon Abelard, Alain Couvreur, Grégoire Lecerf:
    Efficient computation of Riemann-Roch spaces for plane curves with ordinary singularities. 739-804
• 
  • 
  • 
  • 
  • 
    Mahmoud Benkhalifa:
    Absorbing homogeneous polynomials arising from rational homotopy theory and graph theory. 805-820
• 
  • 
  • 
  • 
  • 
    Nurdagül Anbar:
    On a special type of permutation rational functions. 821-832
• 
  • 
  • 
  • 
  • 
    Adam Michael Roberts:
    Quaternary Hermitian self-dual codes of lengths 26, 32, 36, 38 and 40 from modifications of well-known circulant constructions. 833-858
• 
  • 
  • 
  • 
  • 
    Prachi Gupta, P. R. Mishra, Atul Gaur:
    Bounds on the maximum nonlinearity of permutations on the rings mathbbZp{\mathbb {Z}}_pmathbbZp and mathbbZ2p{\mathbb {Z}}_{2p}mathbbZ2p. 859-874
• 
  • 
  • 
  • 
  • 
    Tomas Bayer, Tamás Mészáros, Lajos Rónyai, Tibor Szabó:
    The automorphism group of projective norm graphs. 875-886
• 
  • 
  • 
  • 
  • 
    Christian Elsholtz, Clemens Heuberger, Daniel Krenn:
    Algorithmic counting of nonequivalent compact Huffman codes. 887-903

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.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: