for Journals by Title or ISSN
for Articles by Keywords
help
  Subjects -> ENGINEERING (Total: 2269 journals)
    - CHEMICAL ENGINEERING (190 journals)
    - CIVIL ENGINEERING (181 journals)
    - ELECTRICAL ENGINEERING (100 journals)
    - ENGINEERING (1201 journals)
    - ENGINEERING MECHANICS AND MATERIALS (389 journals)
    - HYDRAULIC ENGINEERING (55 journals)
    - INDUSTRIAL ENGINEERING (64 journals)
    - MECHANICAL ENGINEERING (89 journals)

ENGINEERING (1201 journals)                  1 2 3 4 5 6 7 | Last

Showing 1 - 200 of 1205 Journals sorted alphabetically
3 Biotech     Open Access   (Followers: 7)
3D Research     Hybrid Journal   (Followers: 19)
AAPG Bulletin     Full-text available via subscription   (Followers: 5)
AASRI Procedia     Open Access   (Followers: 14)
Abstract and Applied Analysis     Open Access   (Followers: 3)
Aceh International Journal of Science and Technology     Open Access   (Followers: 2)
ACS Nano     Full-text available via subscription   (Followers: 207)
Acta Geotechnica     Hybrid Journal   (Followers: 6)
Acta Metallurgica Sinica (English Letters)     Hybrid Journal   (Followers: 5)
Acta Polytechnica : Journal of Advanced Engineering     Open Access   (Followers: 1)
Acta Scientiarum. Technology     Open Access   (Followers: 3)
Acta Universitatis Cibiniensis. Technical Series     Open Access  
Active and Passive Electronic Components     Open Access   (Followers: 7)
Adaptive Behavior     Hybrid Journal   (Followers: 10)
Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi     Open Access  
Adsorption     Hybrid Journal   (Followers: 4)
Advanced Engineering Forum     Full-text available via subscription   (Followers: 4)
Advanced Science     Open Access   (Followers: 4)
Advanced Science Focus     Free   (Followers: 3)
Advanced Science Letters     Full-text available via subscription   (Followers: 4)
Advanced Science, Engineering and Medicine     Partially Free   (Followers: 6)
Advanced Synthesis & Catalysis     Hybrid Journal   (Followers: 18)
Advances in Artificial Neural Systems     Open Access   (Followers: 3)
Advances in Calculus of Variations     Hybrid Journal   (Followers: 2)
Advances in Catalysis     Full-text available via subscription   (Followers: 5)
Advances in Complex Systems     Hybrid Journal   (Followers: 7)
Advances in Engineering Software     Hybrid Journal   (Followers: 25)
Advances in Fuel Cells     Full-text available via subscription   (Followers: 14)
Advances in Fuzzy Systems     Open Access   (Followers: 5)
Advances in Geosciences (ADGEO)     Open Access   (Followers: 9)
Advances in Heat Transfer     Full-text available via subscription   (Followers: 18)
Advances in Human Factors/Ergonomics     Full-text available via subscription   (Followers: 22)
Advances in Magnetic and Optical Resonance     Full-text available via subscription   (Followers: 7)
Advances in Natural Sciences: Nanoscience and Nanotechnology     Open Access   (Followers: 28)
Advances in Operations Research     Open Access   (Followers: 11)
Advances in OptoElectronics     Open Access   (Followers: 5)
Advances in Physics Theories and Applications     Open Access   (Followers: 13)
Advances in Polymer Science     Hybrid Journal   (Followers: 40)
Advances in Porous Media     Full-text available via subscription   (Followers: 4)
Advances in Remote Sensing     Open Access   (Followers: 34)
Advances in Science and Research (ASR)     Open Access   (Followers: 6)
Aerobiologia     Hybrid Journal   (Followers: 1)
African Journal of Science, Technology, Innovation and Development     Hybrid Journal   (Followers: 4)
AIChE Journal     Hybrid Journal   (Followers: 28)
Ain Shams Engineering Journal     Open Access   (Followers: 5)
Akademik Platform Mühendislik ve Fen Bilimleri Dergisi     Open Access  
Alexandria Engineering Journal     Open Access  
AMB Express     Open Access   (Followers: 1)
American Journal of Applied Sciences     Open Access   (Followers: 28)
American Journal of Engineering and Applied Sciences     Open Access   (Followers: 11)
American Journal of Engineering Education     Open Access   (Followers: 9)
American Journal of Environmental Engineering     Open Access   (Followers: 16)
American Journal of Industrial and Business Management     Open Access   (Followers: 23)
Analele Universitatii Ovidius Constanta - Seria Chimie     Open Access  
Annals of Combinatorics     Hybrid Journal   (Followers: 3)
Annals of Pure and Applied Logic     Open Access   (Followers: 2)
Annals of Regional Science     Hybrid Journal   (Followers: 7)
Annals of Science     Hybrid Journal   (Followers: 7)
Applicable Algebra in Engineering, Communication and Computing     Hybrid Journal   (Followers: 2)
Applicable Analysis: An International Journal     Hybrid Journal   (Followers: 1)
Applied Catalysis A: General     Hybrid Journal   (Followers: 5)
Applied Catalysis B: Environmental     Hybrid Journal   (Followers: 6)
Applied Clay Science     Hybrid Journal   (Followers: 4)
Applied Computational Intelligence and Soft Computing     Open Access   (Followers: 12)
Applied Magnetic Resonance     Hybrid Journal   (Followers: 3)
Applied Nanoscience     Open Access   (Followers: 8)
Applied Numerical Mathematics     Hybrid Journal   (Followers: 5)
Applied Physics Research     Open Access   (Followers: 4)
Applied Sciences     Open Access   (Followers: 3)
Applied Spatial Analysis and Policy     Hybrid Journal   (Followers: 4)
Arabian Journal for Science and Engineering     Hybrid Journal   (Followers: 5)
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 4)
Archives of Foundry Engineering     Open Access  
Archives of Thermodynamics     Open Access   (Followers: 8)
Arkiv för Matematik     Hybrid Journal  
ASEE Prism     Full-text available via subscription   (Followers: 2)
Asian Engineering Review     Open Access  
Asian Journal of Applied Science and Engineering     Open Access   (Followers: 1)
Asian Journal of Applied Sciences     Open Access   (Followers: 2)
Asian Journal of Biotechnology     Open Access   (Followers: 7)
Asian Journal of Control     Hybrid Journal  
Asian Journal of Current Engineering & Maths     Open Access  
Asian Journal of Technology Innovation     Hybrid Journal   (Followers: 9)
Assembly Automation     Hybrid Journal   (Followers: 2)
at - Automatisierungstechnik     Hybrid Journal   (Followers: 1)
ATZagenda     Hybrid Journal  
ATZextra worldwide     Hybrid Journal  
Australasian Physical & Engineering Sciences in Medicine     Hybrid Journal   (Followers: 1)
Australian Journal of Multi-Disciplinary Engineering     Full-text available via subscription   (Followers: 2)
Autonomous Mental Development, IEEE Transactions on     Hybrid Journal   (Followers: 7)
Avances en Ciencias e Ingeniería     Open Access  
Balkan Region Conference on Engineering and Business Education     Open Access   (Followers: 1)
Bangladesh Journal of Scientific and Industrial Research     Open Access  
Basin Research     Hybrid Journal   (Followers: 3)
Batteries     Open Access   (Followers: 3)
Bautechnik     Hybrid Journal   (Followers: 1)
Bell Labs Technical Journal     Hybrid Journal   (Followers: 24)
Beni-Suef University Journal of Basic and Applied Sciences     Open Access   (Followers: 3)
BER : Manufacturing Survey : Full Survey     Full-text available via subscription   (Followers: 2)
BER : Motor Trade Survey     Full-text available via subscription   (Followers: 1)
BER : Retail Sector Survey     Full-text available via subscription   (Followers: 2)
BER : Retail Survey : Full Survey     Full-text available via subscription   (Followers: 2)
BER : Survey of Business Conditions in Manufacturing : An Executive Summary     Full-text available via subscription   (Followers: 3)
BER : Survey of Business Conditions in Retail : An Executive Summary     Full-text available via subscription   (Followers: 3)
Bharatiya Vaigyanik evam Audyogik Anusandhan Patrika (BVAAP)     Open Access   (Followers: 1)
Biofuels Engineering     Open Access  
Biointerphases     Open Access   (Followers: 1)
Biomaterials Science     Full-text available via subscription   (Followers: 8)
Biomedical Engineering     Hybrid Journal   (Followers: 16)
Biomedical Engineering and Computational Biology     Open Access   (Followers: 13)
Biomedical Engineering Letters     Hybrid Journal   (Followers: 5)
Biomedical Engineering, IEEE Reviews in     Full-text available via subscription   (Followers: 16)
Biomedical Engineering, IEEE Transactions on     Hybrid Journal   (Followers: 31)
Biomedical Engineering: Applications, Basis and Communications     Hybrid Journal   (Followers: 5)
Biomedical Microdevices     Hybrid Journal   (Followers: 8)
Biomedical Science and Engineering     Open Access   (Followers: 4)
Biomedizinische Technik - Biomedical Engineering     Hybrid Journal  
Biomicrofluidics     Open Access   (Followers: 4)
BioNanoMaterials     Hybrid Journal   (Followers: 1)
Biotechnology Progress     Hybrid Journal   (Followers: 40)
Boletin Cientifico Tecnico INIMET     Open Access  
Botswana Journal of Technology     Full-text available via subscription  
Boundary Value Problems     Open Access   (Followers: 1)
Brazilian Journal of Science and Technology     Open Access   (Followers: 2)
Broadcasting, IEEE Transactions on     Hybrid Journal   (Followers: 10)
Bulletin of Canadian Petroleum Geology     Full-text available via subscription   (Followers: 14)
Bulletin of Engineering Geology and the Environment     Hybrid Journal   (Followers: 3)
Bulletin of the Crimean Astrophysical Observatory     Hybrid Journal  
Cahiers, Droit, Sciences et Technologies     Open Access  
Calphad     Hybrid Journal  
Canadian Geotechnical Journal     Full-text available via subscription   (Followers: 14)
Canadian Journal of Remote Sensing     Full-text available via subscription   (Followers: 40)
Case Studies in Engineering Failure Analysis     Open Access   (Followers: 7)
Case Studies in Thermal Engineering     Open Access   (Followers: 4)
Catalysis Communications     Hybrid Journal   (Followers: 6)
Catalysis Letters     Hybrid Journal   (Followers: 3)
Catalysis Reviews: Science and Engineering     Hybrid Journal   (Followers: 7)
Catalysis Science and Technology     Free   (Followers: 6)
Catalysis Surveys from Asia     Hybrid Journal   (Followers: 3)
Catalysis Today     Hybrid Journal   (Followers: 5)
CEAS Space Journal     Hybrid Journal  
Cellular and Molecular Neurobiology     Hybrid Journal   (Followers: 4)
Central European Journal of Engineering     Hybrid Journal   (Followers: 1)
CFD Letters     Open Access   (Followers: 6)
Chaos : An Interdisciplinary Journal of Nonlinear Science     Hybrid Journal   (Followers: 2)
Chaos, Solitons & Fractals     Hybrid Journal   (Followers: 3)
Chinese Journal of Catalysis     Full-text available via subscription   (Followers: 2)
Chinese Journal of Engineering     Open Access   (Followers: 2)
Chinese Science Bulletin     Open Access   (Followers: 1)
Ciencia e Ingenieria Neogranadina     Open Access  
Ciencia en su PC     Open Access   (Followers: 1)
Ciencias Holguin     Open Access   (Followers: 1)
CienciaUAT     Open Access  
Cientifica     Open Access  
CIRP Annals - Manufacturing Technology     Full-text available via subscription   (Followers: 10)
CIRP Journal of Manufacturing Science and Technology     Full-text available via subscription   (Followers: 13)
City, Culture and Society     Hybrid Journal   (Followers: 20)
Clay Minerals     Full-text available via subscription   (Followers: 8)
Clean Air Journal     Full-text available via subscription   (Followers: 2)
Coal Science and Technology     Full-text available via subscription   (Followers: 4)
Coastal Engineering     Hybrid Journal   (Followers: 10)
Coastal Engineering Journal     Hybrid Journal   (Followers: 3)
Coatings     Open Access   (Followers: 2)
Cogent Engineering     Open Access   (Followers: 2)
Cognitive Computation     Hybrid Journal   (Followers: 4)
Color Research & Application     Hybrid Journal   (Followers: 1)
COMBINATORICA     Hybrid Journal  
Combustion Theory and Modelling     Hybrid Journal   (Followers: 13)
Combustion, Explosion, and Shock Waves     Hybrid Journal   (Followers: 13)
Communications Engineer     Hybrid Journal   (Followers: 1)
Communications in Numerical Methods in Engineering     Hybrid Journal   (Followers: 2)
Components, Packaging and Manufacturing Technology, IEEE Transactions on     Hybrid Journal   (Followers: 23)
Composite Interfaces     Hybrid Journal   (Followers: 5)
Composite Structures     Hybrid Journal   (Followers: 242)
Composites Part A : Applied Science and Manufacturing     Hybrid Journal   (Followers: 175)
Composites Part B : Engineering     Hybrid Journal   (Followers: 215)
Composites Science and Technology     Hybrid Journal   (Followers: 159)
Comptes Rendus Mécanique     Full-text available via subscription   (Followers: 2)
Computation     Open Access  
Computational Geosciences     Hybrid Journal   (Followers: 12)
Computational Optimization and Applications     Hybrid Journal   (Followers: 7)
Computational Science and Discovery     Full-text available via subscription   (Followers: 2)
Computer Applications in Engineering Education     Hybrid Journal   (Followers: 6)
Computer Science and Engineering     Open Access   (Followers: 17)
Computers & Geosciences     Hybrid Journal   (Followers: 25)
Computers & Mathematics with Applications     Full-text available via subscription   (Followers: 5)
Computers and Electronics in Agriculture     Hybrid Journal   (Followers: 4)
Computers and Geotechnics     Hybrid Journal   (Followers: 8)
Computing and Visualization in Science     Hybrid Journal   (Followers: 6)
Computing in Science & Engineering     Full-text available via subscription   (Followers: 25)
Conciencia Tecnologica     Open Access  
Concurrent Engineering     Hybrid Journal   (Followers: 3)
Continuum Mechanics and Thermodynamics     Hybrid Journal   (Followers: 6)
Control and Dynamic Systems     Full-text available via subscription   (Followers: 7)
Control Engineering Practice     Hybrid Journal   (Followers: 40)
Control Theory and Informatics     Open Access   (Followers: 7)
Corrosion Science     Hybrid Journal   (Followers: 24)
CT&F Ciencia, Tecnologia y Futuro     Open Access  
CTheory     Open Access  
Current Applied Physics     Full-text available via subscription   (Followers: 4)

        1 2 3 4 5 6 7 | Last

Journal Cover Applicable Algebra in Engineering, Communication and Computing
  [SJR: 0.354]   [H-I: 27]   [2 followers]  Follow
    
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 1432-0622 - ISSN (Online) 0938-1279
   Published by Springer-Verlag Homepage  [2335 journals]
  • New algorithm for the elliptic curve discrete logarithm problem with
           auxiliary inputs
    • Authors: Jiang Weng; Yunqi Dou; Chuangui Ma
      Pages: 99 - 108
      Abstract: The discrete logarithm problem with auxiliary inputs (DLP-wAI) is a special discrete logarithm problem. Cheon first proposed a novel algorithm to solve the discrete logarithm problem with auxiliary inputs. Given a cyclic group \({\mathbb {G}}=\langle P\rangle \) of order p and some elements \(P,\alpha P,\alpha ^2 P,\ldots , \alpha ^d P\in {\mathbb {G}}\) , an attacker can recover \(\alpha \in {\mathbb {Z}}_p^*\) in the case of \(d (p\pm 1)\) with running time of \({\mathcal {O}}(\sqrt{(p\pm 1)/d}+d^i)\) group operations by using \({\mathcal {O}}(\text {max}\{\sqrt{(p\pm 1)/d}, \sqrt{d}\})\) storage ( \(i=\frac{1}{2}\) or 1 for \(d (p-1)\) case or \(d (p+1)\) case, respectively). In this paper, we propose a new algorithm to solve another form of elliptic curve discrete logarithm problem with auxiliary inputs (ECDLP-wAI). We show that if some points \(P,\alpha P,\alpha ^k P,\alpha ^{k^2} P,\alpha ^{k^3} P,\ldots ,\alpha ^{k^{\varphi (d)-1}}P\in {\mathbb {G}}\) and multiplicative cyclic group \(K=\langle k \rangle \) are given, where d is a prime, \(\varphi (d)\) is the order of K and \(\varphi \) is the Euler totient function, the secret key \(\alpha \in {\mathbb {Z}}_p^*\) can be solved in \({\mathcal {O}}(\sqrt{(p-1)/d}+d)\) group operations by using \({\mathcal {O}}(\sqrt{(p-1)/d})\) storage.
      PubDate: 2017-03-01
      DOI: 10.1007/s00200-016-0301-z
      Issue No: Vol. 28, No. 2 (2017)
       
  • A simple method for obtaining relations among factor basis elements for
           special hyperelliptic curves
    • Authors: Palash Sarkar; Shashank Singh
      Pages: 109 - 130
      Abstract: Nagao proposed a decomposition method for divisors of hyperelliptic curves defined over a field \({\mathbb {F}}_{q^n}\) with \(n\ge 2\) . Joux and Vitse later proposed a variant which provided relations among the factor basis elements. Both Nagao’s and the Joux–Vitse methods require solving a multi-variate system of polynomial equations. In this work, we revisit Nagao’s approach with the idea of avoiding the requirement of solving a multi-variate system. While this cannot be done in general, we are able to identify special cases for which this is indeed possible. Our main result is for curves \(C:y^2=f(x)\) of genus g defined over \({\mathbb {F}}_{q^2}\) having characteristic >2. If there is no restriction on f(x), we show that it is possible to obtain a relation in \((4g+4)!\) trials. The number of trials, though high, quantifies the computation effort needed to obtain a relation. This is in contrast to the methods of Nagao and Joux–Vitse which are based on solving systems of polynomial equations, for which the computation effort is hard to precisely quantify. The new method combines well with a sieving technique proposed by Joux and Vitse. If f(x) has a special form, then the number of trials can be significantly lower. For example, if f(x) has at most g consecutive coefficients which are in \({\mathbb {F}}_{q^2}\) while the rest are in \({\mathbb {F}}_q\) , then we show that it is possible to obtain a single relation in about \((2g+3)!\) trials. Our implementation of the resulting algorithm provides examples of factor basis relations for \(g=5\) and \(g=6\) . To the best of our knowledge, none of the previous methods known in the literature can provide such relations faster than our method. Other than obtaining such decompositions, we also explore the applicability of our approach for \(n>2\) and for binary characteristic fields.
      PubDate: 2017-03-01
      DOI: 10.1007/s00200-016-0299-2
      Issue No: Vol. 28, No. 2 (2017)
       
  • Some classes of linear codes over $$\mathbb {Z}_4+v\mathbb {Z}_4$$ Z 4 + v
           Z 4 and their applications to construct good and new $$\mathbb {Z}_4$$ Z 4
           -linear codes
    • Authors: Jian Gao; Fang-Wei Fu; Yun Gao
      Pages: 131 - 153
      Abstract: Some classes of linear codes over the ring \(\mathbb {Z}_4+v\mathbb {Z}_4\) with \(v^2=v\) are considered. Construction of Euclidean formally self-dual codes and unimodular complex lattices from self-dual codes over \(\mathbb {Z}_4+v\mathbb {Z}_4\) are studied. Structural properties of cyclic codes and quadratic residue codes are also considered. Finally, some good and new \(\mathbb {Z}_4\) -linear codes are constructed from linear codes over \(\mathbb {Z}_4+v\mathbb {Z}_4\) .
      PubDate: 2017-03-01
      DOI: 10.1007/s00200-016-0300-0
      Issue No: Vol. 28, No. 2 (2017)
       
  • Several classes of Boolean functions with few Walsh transform values
    • Authors: Guangkui Xu; Xiwang Cao; Shanding Xu
      Pages: 155 - 176
      Abstract: In this paper, several classes of Boolean functions with few Walsh transform values, including bent, semi-bent and five-valued functions, are obtained by adding the product of two or three linear functions to some known bent functions. Numerical results show that the proposed class contains cubic bent functions that are affinely inequivalent to all known quadratic ones.
      PubDate: 2017-03-01
      DOI: 10.1007/s00200-016-0298-3
      Issue No: Vol. 28, No. 2 (2017)
       
  • Minimal logarithmic signatures for one type of classical groups
    • Authors: Haibo Hong; Licheng Wang; Haseeb Ahmad; Jun Shao; Yixian Yang
      Pages: 177 - 192
      Abstract: As a special type of factorization of finite groups, logarithmic signature (LS) is used as the main component of cryptographic keys for secret key cryptosystems such as PGM and public key cryptosystems like \(MST_1\) , \(MST_2\) and \(MST_3\) . An LS with the shortest length, called a minimal logarithmic signature (MLS), is even desirable for cryptographic applications. The MLS conjecture states that every finite simple group has an MLS. Recently, the conjecture has been shown to be true for general linear groups \(GL_n(q)\) , special linear groups \(SL_n(q)\) , and symplectic groups \(Sp_n(q)\) with q a power of primes and for orthogonal groups \(O_n(q)\) with q a power of 2. In this paper, we present new constructions of minimal logarithmic signatures for the orthogonal group \(O_n(q)\) and \(SO_n(q)\) with q a power of an odd prime. Furthermore, we give constructions of MLSs for a type of classical groups—the projective commutator subgroup \(P{\varOmega }_n(q)\) .
      PubDate: 2017-03-01
      DOI: 10.1007/s00200-016-0302-y
      Issue No: Vol. 28, No. 2 (2017)
       
  • Counting permutation equivalent degree six binary polynomials invariant
           under the cyclic group
    • Authors: Florian Luca; Pantelimon Stănică
      Pages: 1 - 10
      Abstract: In this paper we find an exact formula for the number of affine equivalence classes under permutations for binary polynomials degree \(d=6\) invariant under the cyclic group (also, called monomial rotation symmetric), for a prime number of variables; this extends previous work for \(2\le d\le 5\) .
      PubDate: 2017-01-01
      DOI: 10.1007/s00200-016-0294-7
      Issue No: Vol. 28, No. 1 (2017)
       
  • A construction of several classes of two-weight and three-weight linear
           codes
    • Authors: Chengju Li; Qin Yue; Fang-Wei Fu
      Pages: 11 - 30
      Abstract: Linear codes constructed from defining sets have been extensively studied and may have a few nonzero weights if the defining sets are well chosen. Let \({\mathbb {F}}_q\) be a finite field with \(q=p^m\) elements, where p is a prime and m is a positive integer. Motivated by Ding and Ding’s recent work (IEEE Trans Inf Theory 61(11):5835–5842, 2015), we construct p-ary linear codes \({\mathcal {C}}_D\) by $$\begin{aligned} {\mathcal {C}}_D=\{{\mathbf {c}}(a,b)=\big (\text {Tr}_m(ax+by)\big )_{(x,y)\in D}: a, b \in {\mathbb {F}}_q\}, \end{aligned}$$ where \(D \subset {\mathbb {F}}_q^2\) and \(\text {Tr}_m\) is the trace function from \({\mathbb {F}}_q\) onto \({\mathbb {F}}_p\) . In this paper, we will employ exponential sums to investigate the weight enumerators of the linear codes \({\mathcal {C}}_D\) , where \(D=\{(x, y) \in {\mathbb {F}}_q^2 \setminus \{(0,0)\}: \text {Tr}_m(x^{N_1}+y^{N_2})=0\}\) for two positive integers \(N_1\) and \(N_2\) . Several classes of two-weight and three-weight linear codes and their explicit weight enumerators are presented if \(N_1, N_2 \in \{1, 2, p^{\frac{m}{2}}+1\}\) . By deleting some coordinates, more punctured two-weight and three-weight linear codes \({\mathcal {C}}_{\overline{D}}\) which include some optimal codes are derived from \({\mathcal {C}}_D\) .
      PubDate: 2017-01-01
      DOI: 10.1007/s00200-016-0297-4
      Issue No: Vol. 28, No. 1 (2017)
       
  • On the annihilator ideal of an inverse form
    • Authors: Graham H. Norton
      Pages: 31 - 78
      Abstract: Let \(\mathbbm {k}\) be a field. We simplify and extend work of Althaler and Dür on finite sequences over \(\mathbbm {k}\) by regarding \(\mathbbm {k}[x^{-1},z^{-1}]\) as a \(\mathbbm {k}[x,z]\) module and studying forms in \(\mathbbm {k}[x^{-1},z^{-1}]\) from first principles. Then we apply our results to finite sequences. First we define the annihilator ideal \(\mathcal {I}_F\) of a form \(F\in \mathbbm {k}[x^{-1},z^{-1}]\) of total degree \(m\le 0\) . This is a homogeneous ideal. We inductively construct an ordered pair ( \(f_1\) ,  \(f_2\) ) of forms in \(\mathbbm {k}[x,z]\) which generate \(\mathcal {I}_F\)  ; our generators are special in that z does not divide the leading grlex monomial of \(f_1\) but z divides \(f_2\) , and the sum of their total degrees is always \(2-m\) . The corresponding algorithm is \(\sim m^2/2\) . We prove that the row vector obtained by accumulating intermediate forms of the construction gives a minimal grlex Gröbner basis for \(\mathcal {I}_F\) for no extra computational cost other than storage (this is based on a closed-form description of a ’form vector’ for F, an associated vector of total degrees and a syzygy triple derived from the construction. These imply that the remainder of the S polynomial of \(f_1,f_2\) is zero. Then we inductively apply Buchberger’s Criterion to show that the form vector yields a minimal Gb for \(\mathcal {I}_F\) ). We apply this to determining \(\dim _\mathbbm {k}(\mathbbm {k}[x,z] /\mathcal {I}_F)\) . We show that either the form vector is reduced or a monomial of \(f_1\) can be reduced by \(f_2\) . This enables us to efficiently construct the unique reduced Gröbner basis for \(\mathcal {I}_F\) from the vector extension of our algorithm. Then we specialise to the inverse form of a finite sequence, obtaining generator forms for its annihilator ideal and a corresponding algorithm. We compute the intersection of two annihilator ideals using syzygies in \(\mathbbm {k}[x,z]^5\) . This improves a result of Althaler and Dür. Finally we show that dehomogenisation induces a one-to-one correspondence ( \(f_1\) ,
      PubDate: 2017-01-01
      DOI: 10.1007/s00200-016-0295-6
      Issue No: Vol. 28, No. 1 (2017)
       
  • Secret sharing schemes based on additive codes over GF (4)
    • Authors: Jon-Lark Kim; Nari Lee
      Pages: 79 - 97
      Abstract: A secret sharing scheme (SSS) was introduced by Shamir in 1979 using polynomial interpolation. Later it turned out that it is equivalent to an SSS based on a Reed–Solomon code. SSSs based on linear codes have been studied by many researchers. However there is little research on SSSs based on additive codes. In this paper, we study SSSs based on additive codes over GF(4) and show that they require at least two steps of calculations to reveal the secret. We also define minimal access structures of SSSs from additive codes over GF(4) and describe SSSs using some interesting additive codes over GF(4) which contain generalized 2-designs.
      PubDate: 2017-01-01
      DOI: 10.1007/s00200-016-0296-5
      Issue No: Vol. 28, No. 1 (2017)
       
  • Spaces of directed paths on pre-cubical sets
    • Authors: Krzysztof Ziemiański
      Abstract: The spaces of directed paths on the geometric realizations of pre-cubical sets, called also \(\square \) -sets, can be interpreted as the spaces of possible executions of Higher Dimensional Automata, which are models for concurrent computations. In this paper we construct, for a sufficiently good pre-cubical set K, a CW-complex \(W(K)_v^w\) that is homotopy equivalent to the space of directed paths between given vertices v, w of K. This construction is functorial with respect to K, and minimal among all functorial constructions. Furthermore, explicit formulas for incidence numbers of the cells of \(W(K)_v^w\) are provided.
      PubDate: 2017-03-02
      DOI: 10.1007/s00200-017-0316-0
       
  • Some cyclic codes from some monomials
    • Authors: Zohreh Rajabi; Kazem Khashyarmanesh
      Abstract: Cyclic codes are an important class of linear codes. The objectives of this paper are to earn and extend earlier results over cyclic codes from some monomials. In fact, we determine the dimension and the generator polynomial of the code \({\mathcal {C}}_s\) defined by the monomial \(f(x)=x^{\frac{p^h+1}{2}}\) over \({\mathrm {GF}}(p^m)\) , where p is an odd prime and h is an integer. Also, we provide some answers for Open Problems 5.26 and 5.30 in Ding (SIAM J Discrete Math 27:1977–1994, 2013). Moreover, we study the code \({\mathcal {C}}_s\) defined by the monomial \(f(x)=x^{\frac{q^h-1}{q-1}}\) over \(\mathrm {GF}(q^m)\) , where h is an integer, without any restriction on h (see Section 5.3 in the above mentioned paper).
      PubDate: 2017-03-01
      DOI: 10.1007/s00200-017-0317-z
       
  • 1-Generator quasi-cyclic and generalized quasi-cyclic codes over the ring
           $$\frac{{{\mathbb {Z}_4}[u]}}{{\left\langle {{u^2} - 1}\right\rangle }}$$
           Z 4 [ u ] u 2 - 1
    • Authors: Yun Gao; Jian Gao; Tingting Wu; Fang-Wei Fu
      Abstract: In this paper, we study 1-generator quasi-cyclic and generalized quasi-cyclic codes over the ring \(R=\frac{{{\mathbb {Z}_4}[u]}}{{\left\langle {{u^2} - 1} \right\rangle }}\) . We determine the structure of the generators and the minimal generating sets of 1-generator QC and GQC codes. We also give a lower bound for the minimum distance of free 1-generator quasi-cyclic and generalized quasi-cyclic codes over this ring, respectively. Furthermore, some new \(\mathbb {Z}_4\) -linear codes via the Gray map which have better parameters than the best known \(\mathbb {Z}_4\) -linear codes are presented.
      PubDate: 2017-02-20
      DOI: 10.1007/s00200-017-0315-1
       
  • A constructive test for exponential stability of linear time-varying
           discrete-time systems
    • Authors: Ulrich Oberst
      Abstract: We complete the stability results of the paper Bourlès et al. (SIAM J Control Optim 53:2725–2761, 2015), and for this purpose use the linear time-varying (LTV) discrete-time behaviors and the exponential stability (e.s.) of this paper. In the main theorem we characterize the e.s. of an autonomous LTV system by standard spectral properties of a complex matrix connected with the system. We extend the theory of discrete-time LTV behaviors, developed in the quoted publication, from the coefficient field of rational functions to that of locally convergent Laurent series or even of Puiseux series. The stability test can and has to be applied in connection with the construction of stabilizing compensators.
      PubDate: 2017-02-15
      DOI: 10.1007/s00200-017-0314-2
       
  • Several proofs of security for a tokenization algorithm
    • Authors: Riccardo Aragona; Riccardo Longo; Massimiliano Sala
      Abstract: In this paper we propose a tokenization algorithm of Reversible Hybrid type, as defined in PCI DSS guidelines for designing a tokenization solution, based on a block cipher with a secret key and (possibly public) additional input. We provide some formal proofs of security for it, which imply our algorithm satisfies the most significant security requirements described in PCI DSS tokenization guidelines. Finally, we give an instantiation with concrete cryptographic primitives and fixed length of the PAN, and we analyze its efficiency and security.
      PubDate: 2017-02-13
      DOI: 10.1007/s00200-017-0313-3
       
  • Performance of ternary double circulant, double twistulant, and self-dual
           codes
    • Authors: T. Aaron Gulliver; Masaaki Harada
      Abstract: We study the performance of ternary isodual codes which are not self-dual and ternary self-dual codes, as measured by the decoding error probability with bounded distance decoding. We compare the performance of ternary double circulant and double twistulant codes which are not self-dual with ternary extremal self-dual codes. We also investigate the performance of ternary self-dual codes having large minimum weights.
      PubDate: 2017-01-16
      DOI: 10.1007/s00200-017-0312-4
       
  • Computing Tjurina stratifications of $$\mu $$ μ -constant deformations
           via parametric local cohomology systems
    • Authors: Katsusuke Nabeshima; Shinichi Tajima
      Pages: 451 - 467
      Abstract: Algebraic local cohomology classes associated with parametric semi-quasihomogeneous hypersurface isolated singularities are considered in the context of symbolic computation. The motivations for this paper are computer calculations of complete lists of Tjurina numbers of semi-quasihomogeneous polynomials with isolated singularity. A new algorithm, that utilizes parametric local cohomology systems, is proposed to compute Tjurina stratifications associated with \(\mu \) -constant deformations of weighted homogeneous isolated singularities. The resulting algorithm gives in particular a suitable decomposition of the parameter space depending on the structure of the parametric local cohomology systems. An efficient algorithm of computing parametric standard bases of relevant ideals is also given as an application of parametric local cohomology systems.
      PubDate: 2016-12-01
      DOI: 10.1007/s00200-016-0289-4
      Issue No: Vol. 27, No. 6 (2016)
       
  • Computing Tjurina stratifications of $$\mu $$ μ -constant deformations
           via parametric local cohomology systems
    • Authors: Katsusuke Nabeshima; Shinichi Tajima
      Pages: 451 - 467
      Abstract: Algebraic local cohomology classes associated with parametric semi-quasihomogeneous hypersurface isolated singularities are considered in the context of symbolic computation. The motivations for this paper are computer calculations of complete lists of Tjurina numbers of semi-quasihomogeneous polynomials with isolated singularity. A new algorithm, that utilizes parametric local cohomology systems, is proposed to compute Tjurina stratifications associated with \(\mu \) -constant deformations of weighted homogeneous isolated singularities. The resulting algorithm gives in particular a suitable decomposition of the parameter space depending on the structure of the parametric local cohomology systems. An efficient algorithm of computing parametric standard bases of relevant ideals is also given as an application of parametric local cohomology systems.
      PubDate: 2016-12-01
      DOI: 10.1007/s00200-016-0289-4
      Issue No: Vol. 27, No. 6 (2016)
       
  • Dynamics of linear systems over finite commutative rings
    • Authors: Yangjiang Wei; Guangwu Xu; Yi Ming Zou
      Pages: 469 - 479
      Abstract: The dynamics of a linear dynamical system over a finite field can be described by using the elementary divisors of the corresponding matrix. It is natural to extend the investigation to a general finite commutative ring. In a previous publication, the last two authors developed an efficient algorithm to determine whether a linear dynamical system over a finite commutative ring is a fixed point system or not. The algorithm can also be used to reduce the problem of finding the cycles of such a system to the case where the system is given by an automorphism. Here, we further analyze the cycle structure of such a system and develop a method to determine its cycles.
      PubDate: 2016-12-01
      DOI: 10.1007/s00200-016-0290-y
      Issue No: Vol. 27, No. 6 (2016)
       
  • Dynamics of linear systems over finite commutative rings
    • Authors: Yangjiang Wei; Guangwu Xu; Yi Ming Zou
      Pages: 469 - 479
      Abstract: The dynamics of a linear dynamical system over a finite field can be described by using the elementary divisors of the corresponding matrix. It is natural to extend the investigation to a general finite commutative ring. In a previous publication, the last two authors developed an efficient algorithm to determine whether a linear dynamical system over a finite commutative ring is a fixed point system or not. The algorithm can also be used to reduce the problem of finding the cycles of such a system to the case where the system is given by an automorphism. Here, we further analyze the cycle structure of such a system and develop a method to determine its cycles.
      PubDate: 2016-12-01
      DOI: 10.1007/s00200-016-0290-y
      Issue No: Vol. 27, No. 6 (2016)
       
  • Undeniable signature scheme based over group ring
    • Authors: Neha Goel; Indivar Gupta; M. K. Dubey; B. K. Dass
      Pages: 523 - 535
      Abstract: D. Chaum and H. van Antwerpen first introduced the concept of an undeniable signature scheme where the verification step is verified with the signer’s co-operation. In this paper, first we discuss a combination of Discrete Logarithm Problem (DLP) and Conjugacy Search Problem (CSP) analysing its security. Then we propose an undeniable signature scheme in a non-abelian group over group ring whose security relies on difficulty of the combination of the DLP and the CSP. The complexity and security of our proposed scheme has also been discussed.
      PubDate: 2016-12-01
      DOI: 10.1007/s00200-016-0293-8
      Issue No: Vol. 27, No. 6 (2016)
       
  • Undeniable signature scheme based over group ring
    • Authors: Neha Goel; Indivar Gupta; M. K. Dubey; B. K. Dass
      Pages: 523 - 535
      Abstract: D. Chaum and H. van Antwerpen first introduced the concept of an undeniable signature scheme where the verification step is verified with the signer’s co-operation. In this paper, first we discuss a combination of Discrete Logarithm Problem (DLP) and Conjugacy Search Problem (CSP) analysing its security. Then we propose an undeniable signature scheme in a non-abelian group over group ring whose security relies on difficulty of the combination of the DLP and the CSP. The complexity and security of our proposed scheme has also been discussed.
      PubDate: 2016-12-01
      DOI: 10.1007/s00200-016-0293-8
      Issue No: Vol. 27, No. 6 (2016)
       
  • Hamming distances from a function to all codewords of a Generalized
           Reed-Muller code of order one
    • Authors: Miriam Abdón; Robert Rolland
      Abstract: For any finite field \({\mathbb {F}}_q\) with q elements, we study the set \({\mathscr {F}}_{(q,m)}\) of functions from \({\mathbb {F}}_q^m\) into \({\mathbb {F}}_q\) from geometric, analytic and algorithmic points of view. We determine a linear system of \(q^{m+1}\) equations and \(q^{m+1}\) unknowns, which has for unique solution the Hamming distances of a function in \({\mathscr {F}}_{(q,m)}\) to all the affine functions. Moreover, we introduce a Fourier-like transform which allows us to compute all these distances at a cost \(O(mq^m)\) and which would be useful for further problems.
      PubDate: 2016-12-24
      DOI: 10.1007/s00200-016-0311-x
       
  • Binary codes and permutation decoding sets from the graph products of
           cycles
    • Authors: W. Fish
      Abstract: Let \(n, m \ge 2\) be integers. The cartesian, categorical and lexicographic products of m copies of the n-cycle denoted by \(C_n\) all have as their vertex-set \(\{0, 1, \ldots , n-1\}^m\) , with adjacency defined variously. In this paper the binary codes generated by the row span of adjacency matrices of the cartesian, categorical and lexicographic products of m copies of \(C_n\) are examined. Full and partial PD-sets were also found for the various codes.
      PubDate: 2016-12-20
      DOI: 10.1007/s00200-016-0310-y
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
Home (Search)
Subjects A-Z
Publishers A-Z
Customise
APIs
Your IP address: 184.73.55.221
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-2016