Applicable Algebra in Engineering, Communication and Computing, Volume 28 (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 28, Number 1, January 2017

• 
  • 
  • 
  • 
  • 
    Florian Luca, Pantelimon Stanica:
    Counting permutation equivalent degree six binary polynomials invariant under the cyclic group. 1-10
• 
  • 
  • 
  • 
  • 
    Chengju Li, Qin Yue, Fang-Wei Fu:
    A construction of several classes of two-weight and three-weight linear codes. 11-30
• 
  • 
  • 
  • 
  • 
    Graham H. Norton:
    On the annihilator ideal of an inverse form. 31-78
• 
  • 
  • 
  • 
  • 
    Jon-Lark Kim, Nari Lee:
    Secret sharing schemes based on additive codes over GF(4). 79-97

Volume 28, Number 2, March 2017

• 
  • 
  • 
  • 
  • 
    Jiang Weng, Yunqi Dou, Chuangui Ma:
    New algorithm for the elliptic curve discrete logarithm problem with auxiliary inputs. 99-108
• 
  • 
  • 
  • 
  • 
    Palash Sarkar, Shashank Singh:
    A simple method for obtaining relations among factor basis elements for special hyperelliptic curves. 109-130
• 
  • 
  • 
  • 
  • 
    Jian Gao, Fang-Wei Fu, Yun Gao:
    Some classes of linear codes over ℤ4+vℤ4 and their applications to construct good and new ℤ4-linear codes. 131-153
• 
  • 
  • 
  • 
  • 
    Guangkui Xu, Xiwang Cao, Shanding Xu:
    Several classes of Boolean functions with few Walsh transform values. 155-176
• 
  • 
  • 
  • 
  • 
    Haibo Hong, Licheng Wang, Haseeb Ahmad, Jun Shao, Yixian Yang:
    Minimal logarithmic signatures for one type of classical groups. 177-192

Volume 28, Number 3, June 2017

• 
  • 
  • 
  • 
  • 
    László Mérai:
    Predicting the elliptic curve congruential generator. 193-203
• 
  • 
  • 
  • 
  • 
    Alexander Bors:
    On the dynamics of endomorphisms of finite groups. 205-214
• 
  • 
  • 
  • 
  • 
    Dabin Zheng, Zhen Chen:
    More classes of permutation polynomials of the form (xpm - x+δ)s + L(x). 215-223
• 
  • 
  • 
  • 
  • 
    B. Panbehkar, H. Doostie:
    An automatic semigroup of languages. 225-235
• 
  • 
  • 
  • 
  • 
    Thierry Mefenza, Damien Vergnaud:
    Polynomial interpolation of the Naor-Reingold pseudo-random function. 237-255
• 
  • 
  • 
  • 
  • 
    Yogesh Kumar, Prasanna Raghaw Mishra, N. Rajesh Pillai, Rajendra Kumar Sharma:
    Affine equivalence and non-linearity of permutations over Zn. 257-279

Volume 28, Number 4, August 2017

Special Issue: "International Conference on Coding and Cryptography" Algiers, Algeria, November 2-5, 2015

• 
  • 
  • 
  • 
  • 
    Marc Giusti, Kenza Guenda:
    Special issue "International Conference on Coding and Cryptography" Algiers, Algeria, November 2-5, 2015. 281-282
• 
  • 
  • 
  • 
  • 
    Pierre-Louis Cayrel, Mohammed Meziani, Ousmane Ndiaye, Richard Lindner, Rosemberg Silva:
    A pseudorandom number generator based on worst-case lattice problems. 283-294
• 
  • 
  • 
  • 
  • 
    Serhii Dyshko:
    Geometric approach to the MacWilliams Extension Theorem for codes over module alphabets. 295-309
• 
  • 
  • 
  • 
  • 
    Fatmanur Gursoy, Elif Segah Oztas, Irfan Siap:
    Reversible DNA codes using skew polynomial rings. 311-320
• 
  • 
  • 
  • 
  • 
    Jacques Patarin:
    Mirror theory and cryptography. 321-338
• 
  • 
  • 
  • 
  • 
    Nuh Aydin, Nicholas Connolly, John Murphree:
    New binary linear codes from quasi-cyclic codes and an augmentation algorithm. 339-350

Volume 28, Number 5, November 2017

• 
  • 
  • 
  • 
  • 
    Michele Rossi, Lea Terracini:
    A numerical ampleness criterion via Gale duality. 351-368
• 
  • 
  • 
  • 
  • 
    Washiela Fish:
    Binary codes and permutation decoding sets from the graph products of cycles. 369-386
• 
  • 
  • 
  • 
  • 
    Miriam Abdón, Robert Rolland:
    Hamming distances from a function to all codewords of a Generalized Reed-Muller code of order one. 387-408
• 
  • 
  • 
  • 
  • 
    T. Aaron Gulliver, Masaaki Harada:
    Performance of ternary double circulant, double twistulant, and self-dual codes. 409-424
• 
  • 
  • 
  • 
  • 
    Riccardo Aragona, Riccardo Longo, Massimiliano Sala:
    Several proofs of security for a tokenization algorithm. 425-436
• 
  • 
  • 
  • 
  • 
    Ulrich Oberst:
    A constructive test for exponential stability of linear time-varying discrete-time systems. 437-456

Volume 28, Number 6, December 2017

• 
  • 
  • 
  • 
  • 
    Yun Gao, Jian Gao, Tingting Wu, Fang-Wei Fu:
    1-Generator quasi-cyclic and generalized quasi-cyclic codes over the ring ℤ4[u]/〈u2-1〉. 457-467
• 
  • 
  • 
  • 
  • 
    Zohreh Rajabi, Kazem Khashyarmanesh:
    Some cyclic codes from some monomials. 469-495
• 
  • 
  • 
  • 
  • 
    Krzysztof Ziemianski:
    Spaces of directed paths on pre-cubical sets. 497-525
• 
  • 
  • 
  • 
  • 
    Gerardo Vega:
    An improved method for determining the weight distribution of a family of q-ary cyclic codes. 527-533
• 
  • 
  • 
  • 
  • 
    Xiaoni Du, Yunqi Wan:
    Linear codes from quadratic forms. 535-547

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: