for Journals by Title or ISSN for Articles by Keywords help
 Subjects -> COMPUTER SCIENCE (Total: 2050 journals)     - ANIMATION AND SIMULATION (30 journals)    - ARTIFICIAL INTELLIGENCE (99 journals)    - AUTOMATION AND ROBOTICS (100 journals)    - CLOUD COMPUTING AND NETWORKS (64 journals)    - COMPUTER ARCHITECTURE (9 journals)    - COMPUTER ENGINEERING (10 journals)    - COMPUTER GAMES (16 journals)    - COMPUTER PROGRAMMING (27 journals)    - COMPUTER SCIENCE (1196 journals)    - COMPUTER SECURITY (46 journals)    - DATA BASE MANAGEMENT (14 journals)    - DATA MINING (32 journals)    - E-BUSINESS (22 journals)    - E-LEARNING (28 journals)    - ELECTRONIC DATA PROCESSING (22 journals)    - IMAGE AND VIDEO PROCESSING (39 journals)    - INFORMATION SYSTEMS (109 journals)    - INTERNET (94 journals)    - SOCIAL WEB (51 journals)    - SOFTWARE (34 journals)    - THEORY OF COMPUTING (8 journals) COMPUTER SCIENCE (1196 journals)                  1 2 3 4 5 6 | Last
 Showing 1 - 200 of 872 Journals sorted alphabetically 3D Printing and Additive Manufacturing       (Followers: 20) Abakós       (Followers: 4) ACM Computing Surveys       (Followers: 22) ACM Journal on Computing and Cultural Heritage       (Followers: 8) ACM Journal on Emerging Technologies in Computing Systems       (Followers: 11) ACM Transactions on Accessible Computing (TACCESS)       (Followers: 3) ACM Transactions on Algorithms (TALG)       (Followers: 15) ACM Transactions on Applied Perception (TAP)       (Followers: 5) ACM Transactions on Architecture and Code Optimization (TACO)       (Followers: 9) ACM Transactions on Autonomous and Adaptive Systems (TAAS)       (Followers: 7) ACM Transactions on Computation Theory (TOCT)       (Followers: 12) ACM Transactions on Computational Logic (TOCL)       (Followers: 3) ACM Transactions on Computer Systems (TOCS)       (Followers: 17) ACM Transactions on Computer-Human Interaction       (Followers: 14) ACM Transactions on Computing Education (TOCE)       (Followers: 5) ACM Transactions on Design Automation of Electronic Systems (TODAES)       (Followers: 3) ACM Transactions on Economics and Computation ACM Transactions on Embedded Computing Systems (TECS)       (Followers: 3) ACM Transactions on Information Systems (TOIS)       (Followers: 19) ACM Transactions on Intelligent Systems and Technology (TIST)       (Followers: 7) ACM Transactions on Interactive Intelligent Systems (TiiS)       (Followers: 3) ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)       (Followers: 9) ACM Transactions on Reconfigurable Technology and Systems (TRETS)       (Followers: 6) ACM Transactions on Sensor Networks (TOSN)       (Followers: 7) ACM Transactions on Speech and Language Processing (TSLP)       (Followers: 8) ACM Transactions on Storage ACS Applied Materials & Interfaces       (Followers: 27) Acta Automatica Sinica       (Followers: 2) Acta Universitatis Cibiniensis. Technical Series Ad Hoc Networks       (Followers: 11) Adaptive Behavior       (Followers: 11) Advanced Engineering Materials       (Followers: 28) Advanced Science Letters       (Followers: 9) Advances in Adaptive Data Analysis       (Followers: 7) Advances in Artificial Intelligence       (Followers: 15) Advances in Calculus of Variations       (Followers: 2) Advances in Catalysis       (Followers: 5) Advances in Computational Mathematics       (Followers: 18) Advances in Computer Science : an International Journal       (Followers: 15) Advances in Computing       (Followers: 2) Advances in Data Analysis and Classification       (Followers: 51) Advances in Engineering Software       (Followers: 27) Advances in Geosciences (ADGEO)       (Followers: 13) Advances in Human Factors/Ergonomics       (Followers: 23) Advances in Human-Computer Interaction       (Followers: 19) Advances in Materials Sciences       (Followers: 14) Advances in Operations Research       (Followers: 12) Advances in Parallel Computing       (Followers: 6) Advances in Porous Media       (Followers: 5) Advances in Remote Sensing       (Followers: 43) Advances in Science and Research (ASR)       (Followers: 4) Advances in Technology Innovation       (Followers: 5) AEU - International Journal of Electronics and Communications       (Followers: 8) African Journal of Information and Communication       (Followers: 6) African Journal of Mathematics and Computer Science Research       (Followers: 4) AI EDAM Air, Soil & Water Research       (Followers: 11) AIS Transactions on Human-Computer Interaction       (Followers: 5) Algebras and Representation Theory       (Followers: 1) Algorithms       (Followers: 11) American Journal of Computational and Applied Mathematics       (Followers: 5) American Journal of Computational Mathematics       (Followers: 4) American Journal of Information Systems       (Followers: 5) American Journal of Sensor Technology       (Followers: 4) Anais da Academia Brasileira de CiÃªncias       (Followers: 2) Analog Integrated Circuits and Signal Processing       (Followers: 7) Analysis in Theory and Applications       (Followers: 1) Animation Practice, Process & Production       (Followers: 5) Annals of Combinatorics       (Followers: 3) Annals of Data Science       (Followers: 11) Annals of Mathematics and Artificial Intelligence       (Followers: 12) Annals of Pure and Applied Logic       (Followers: 2) Annals of Software Engineering       (Followers: 13) Annual Reviews in Control       (Followers: 6) Anuario Americanista Europeo Applicable Algebra in Engineering, Communication and Computing       (Followers: 2) Applied and Computational Harmonic Analysis       (Followers: 1) Applied Artificial Intelligence: An International Journal       (Followers: 13) Applied Categorical Structures       (Followers: 2) Applied Clinical Informatics       (Followers: 2) Applied Computational Intelligence and Soft Computing       (Followers: 11) Applied Computer Systems       (Followers: 2) Applied Informatics Applied Mathematics and Computation       (Followers: 33) Applied Medical Informatics       (Followers: 10) Applied Numerical Mathematics       (Followers: 5) Applied Soft Computing       (Followers: 16) Applied Spatial Analysis and Policy       (Followers: 4) Applied System Innovation Architectural Theory Review       (Followers: 3) Archive of Applied Mechanics       (Followers: 5) Archive of Numerical Software Archives and Museum Informatics       (Followers: 130) Archives of Computational Methods in Engineering       (Followers: 5) arq: Architectural Research Quarterly       (Followers: 7) Artifact       (Followers: 2) Artificial Life       (Followers: 7) Asia Pacific Journal on Computational Engineering Asia-Pacific Journal of Information Technology and Multimedia       (Followers: 1) Asian Journal of Computer Science and Information Technology Asian Journal of Control Assembly Automation       (Followers: 2) at - Automatisierungstechnik       (Followers: 1) Australian Educational Computing       (Followers: 1) Automatic Control and Computer Sciences       (Followers: 4) Automatic Documentation and Mathematical Linguistics       (Followers: 5) Automatica       (Followers: 11) Automation in Construction       (Followers: 6) Autonomous Mental Development, IEEE Transactions on       (Followers: 9) Basin Research       (Followers: 5) Behaviour & Information Technology       (Followers: 52) Big Data and Cognitive Computing       (Followers: 2) Biodiversity Information Science and Standards Bioinformatics       (Followers: 282) Biomedical Engineering       (Followers: 15) Biomedical Engineering and Computational Biology       (Followers: 13) Biomedical Engineering, IEEE Reviews in       (Followers: 19) Biomedical Engineering, IEEE Transactions on       (Followers: 35) Briefings in Bioinformatics       (Followers: 43) British Journal of Educational Technology       (Followers: 142) Broadcasting, IEEE Transactions on       (Followers: 10) c't Magazin fuer Computertechnik       (Followers: 1) CALCOLO Calphad Canadian Journal of Electrical and Computer Engineering       (Followers: 14) Capturing Intelligence Catalysis in Industry       (Followers: 1) CEAS Space Journal       (Followers: 2) Cell Communication and Signaling       (Followers: 2) Central European Journal of Computer Science       (Followers: 5) CERN IdeaSquare Journal of Experimental Innovation       (Followers: 2) Chaos, Solitons & Fractals       (Followers: 3) Chemometrics and Intelligent Laboratory Systems       (Followers: 14) ChemSusChem       (Followers: 7) China Communications       (Followers: 7) Chinese Journal of Catalysis       (Followers: 2) CIN Computers Informatics Nursing       (Followers: 11) Circuits and Systems       (Followers: 15) Clean Air Journal       (Followers: 1) CLEI Electronic Journal Clin-Alert       (Followers: 1) Cluster Computing       (Followers: 1) Cognitive Computation       (Followers: 4) COMBINATORICA Combinatorics, Probability and Computing       (Followers: 4) Combustion Theory and Modelling       (Followers: 14) Communication Methods and Measures       (Followers: 12) Communication Theory       (Followers: 20) Communications Engineer       (Followers: 1) Communications in Algebra       (Followers: 3) Communications in Computational Physics       (Followers: 2) Communications in Partial Differential Equations       (Followers: 3) Communications of the ACM       (Followers: 52) Communications of the Association for Information Systems       (Followers: 16) COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering       (Followers: 3) Complex & Intelligent Systems       (Followers: 1) Complex Adaptive Systems Modeling Complex Analysis and Operator Theory       (Followers: 2) Complexity       (Followers: 6) Complexus Composite Materials Series       (Followers: 8) Computación y Sistemas Computation Computational and Applied Mathematics       (Followers: 2) Computational and Mathematical Methods in Medicine       (Followers: 2) Computational and Mathematical Organization Theory       (Followers: 2) Computational and Structural Biotechnology Journal       (Followers: 2) Computational and Theoretical Chemistry       (Followers: 9) Computational Astrophysics and Cosmology       (Followers: 1) Computational Biology and Chemistry       (Followers: 11) Computational Chemistry       (Followers: 2) Computational Cognitive Science       (Followers: 2) Computational Complexity       (Followers: 4) Computational Condensed Matter Computational Ecology and Software       (Followers: 9) Computational Economics       (Followers: 9) Computational Geosciences       (Followers: 15) Computational Linguistics       (Followers: 23) Computational Management Science Computational Mathematics and Modeling       (Followers: 8) Computational Mechanics       (Followers: 5) Computational Methods and Function Theory Computational Molecular Bioscience       (Followers: 2) Computational Optimization and Applications       (Followers: 7) Computational Particle Mechanics       (Followers: 1) Computational Research       (Followers: 1) Computational Science and Discovery       (Followers: 2) Computational Science and Techniques Computational Statistics       (Followers: 14) Computational Statistics & Data Analysis       (Followers: 30) Computer       (Followers: 94) Computer Aided Surgery       (Followers: 6) Computer Applications in Engineering Education       (Followers: 8) Computer Communications       (Followers: 10) Computer Engineering and Applications Journal       (Followers: 5) Computer Journal       (Followers: 9) Computer Methods in Applied Mechanics and Engineering       (Followers: 23) Computer Methods in Biomechanics and Biomedical Engineering       (Followers: 12) Computer Methods in the Geosciences       (Followers: 2) Computer Music Journal       (Followers: 19)
 Applicable Algebra in Engineering, Communication and Computing   [SJR: 0.354]   [H-I: 27]   [2 followers]  Follow         Hybrid journal (It can contain Open Access articles)    ISSN (Print) 1432-0622 - ISSN (Online) 0938-1279    Published by Springer-Verlag  [2352 journals]
• Cryptanalysis of a key exchange protocol based on the ring $$E_p^{(m)}$$ E
p ( m )
• Authors: Yang Zhang
Pages: 103 - 112
Abstract: An extension of Bergman’s ring (Israel J Math 18:257–277, 1974) was introduced by Climent et al. (Appl Algebra Eng Commun Comput 23:347–361, 2014). For this ring called $$E_p^{(m)}$$ , they established that only a negligible fraction of elements are invertible, and then proposed a key exchange protocol based on this property. Shortly afterwards, they constructed another key agreement protocol for multicast over this ring (WIT Trans Inf Commun Technol 45:13–24, 2013). In this paper, we introduce a polynomial-time attack to these two protocols without using invertible elements.
PubDate: 2018-03-01
DOI: 10.1007/s00200-017-0332-0
Issue No: Vol. 29, No. 2 (2018)

• Choosing and generating parameters for pairing implementation on BN curves
• Authors: Sylvain Duquesne; Nadia El Mrabet; Safia Haloui; Franck Rondepierre
Pages: 113 - 147
Abstract: Because pairings have many applications, many hardware and software pairing implementations can be found in the literature. However, the parameters generally used have been invalidated by the recent results on the discrete logarithm problem over pairing friendly elliptic curves (Kim and Barbulescu in CRYPTO 2016, volume 9814 of lecture notes in computer science, Springer, Berlin, pp 543–571, 2016). New parameters must be generated to insure enough security in pairing based protocols. More generally it could be useful to generate nice pairing parameters in many real-world applications (specific security level, resistance to specific attacks on a protocol, database of curves). The main purpose of this paper is to describe explicitly and exhaustively what should be done to generate the best possible parameters and to make the best choices depending on the implementation context (in terms of pairing algorithm, ways to build the tower field, $$\mathbb {F}_{p^{12}}$$ arithmetic, groups involved and their generators, system of coordinates). We focus on low level implementations, assuming that $$\mathbb {F}_p$$ additions have a significant cost compared to other $$\mathbb {F}_p$$ operations. However, our results are still valid if $$\mathbb {F}_p$$ additions can be neglected. We also explain why the best choice for the polynomials defining the tower field $$\mathbb {F}_{p^{12}}$$ is only dependent on the value of the BN parameter u mod small integers (like 12 for instance) as a nice application of old elementary arithmetic results. This should allow a faster generation of this parameter. Moreover, we use this opportunity to give some new slight improvements on $$\mathbb {F}_{p^{12}}$$ arithmetic (in a pairing context).
PubDate: 2018-03-01
DOI: 10.1007/s00200-017-0334-y
Issue No: Vol. 29, No. 2 (2018)

• Iterated local transitivity model for signed social networks
• Authors: Deepa Sinha; Deepakshi Sharma
Pages: 149 - 167
Abstract: In this paper, we generalize the iterated local transitivity (ILT) model for online social networks for signed networks. Signed networks focus on the type of relations (friendship or enmity) between the vertices (members of online social networks). The ILT model for signed networks provide an insight into how networks react to the addition of clone vertex. In this model, at each time step t and for already existing vertex x, a new vertex (clone) $$x'$$ is added which joins to x and neighbors of x. The sign of new edge $$yx', \ y \in N[x]$$ neighborhood of x is defined by calculating the number of positive and negative neighbors of x. We also discuss properties such as balance and clusterability, sign-compatibility and C-sign-compatibility.
PubDate: 2018-03-01
DOI: 10.1007/s00200-017-0333-z
Issue No: Vol. 29, No. 2 (2018)

• On the optimality of lattices for the coppersmith technique
• Authors: Yoshinori Aono; Manindra Agrawal; Takakazu Satoh; Osamu Watanabe
Pages: 169 - 195
Abstract: We investigate a method for finding small integer solutions of a univariate modular equation, that was introduced by Coppersmith (Proceedings of Eurocrypt 1996, LNCS, vol 1070, pp 155–165, 1996) and extended by May (New RSA vulnerabilities using lattice reduction methods, Ph.D. thesis, University of Paderborn, 2003). We will refer this method as the Coppersmith technique. This paper provides a way to analyze a general limitations of the lattice construction for the Coppersmith technique. Our analysis upper bounds the possible range of U that is asymptotically equal to the bound given by the original result of Coppersmith and May. This means that they have already given the best lattice construction. In addition, we investigate the optimality for the bivariate equation to solve the small inverse problem, which was inspired by Kunihiro’s (LNCS 7483:55–69, 2012) argument. In particular, we show the optimality for the Boneh–Durfee’s equation (Proceedings of Eurocrypt 1999, LNCS, vol 1592, pp 389–401, 1999) used for RSA cryptoanalysis, To show our results, we establish framework for the technique by following the relation of Howgrave-Graham (Proceedings of cryptography and coding, LNCS, vol 1355, pp 131–142, 1997), and then concretely define the conditions in which the technique succeed and fails. We then provide a way to analyze the range of U that satisfies these conditions. Technically, we show that the original result of Coppersmith achieves the optimal bound for U when constructing a lattice in the standard way. We then provide evidence which indicates that constructing a non-standard lattice is generally difficult.
PubDate: 2018-03-01
DOI: 10.1007/s00200-017-0336-9
Issue No: Vol. 29, No. 2 (2018)

• A class of primitive BCH codes and their weight distribution
• Authors: Haode Yan
Pages: 1 - 11
Abstract: BCH codes, as a special subclass of cyclic codes, are in most cases among the best cyclic codes. Recently, several classes of BCH codes with length $$n=q^m-1$$ and designed distances $$\delta =(q-1)q^{m-1}-1-q^{\lfloor (m-1)/2\rfloor }$$ and $$\delta =(q-1)q^{m-1}-1-q^{\lfloor (m+1)/2\rfloor }$$ were widely studied, where $$m\ge 4$$ is an integer. In this paper, we consider the case $$m=3$$ . The weight distribution of a class of primitive BCH codes with designed distance $$q^3-q^2-q-2$$ is determined, which solves an open problem put forward in Ding et al. (Finite Fields Appl 45:237–263, 2017).
PubDate: 2018-01-01
DOI: 10.1007/s00200-017-0320-4
Issue No: Vol. 29, No. 1 (2018)

• Complete classification of $$(\delta +\alpha u^2)$$ ( δ + α u 2 )
-constacyclic codes over $${\mathbb {F}}_{3^m}[u]/\langle u^4\rangle$$ F
3 m [ u ] / ⟨ u 4 ⟩ of length 3 n
• Authors: Yuan Cao; Yonglin Cao; Li Dong
Pages: 13 - 39
Abstract: Let $${\mathbb {F}}_{3^m}$$ be a finite field of cardinality $$3^m$$ , $$R={\mathbb {F}}_{3^m}[u]/\langle u^4\rangle$$ which is a finite chain ring, and n be a positive integer satisfying $$\mathrm{gcd}(3,n)=1$$ . For any $$\delta ,\alpha \in {\mathbb {F}}_{3^m}^{\times }$$ , an explicit representation for all distinct $$(\delta +\alpha u^2)$$ -constacyclic codes over R of length 3n is given, formulas for the number of all such codes and the number of codewords in each code are provided, respectively. Moreover, the dual code for each of these codes is determined explicitly.
PubDate: 2018-01-01
DOI: 10.1007/s00200-017-0328-9
Issue No: Vol. 29, No. 1 (2018)

• The l -th power Diffie–Hellman problem and the l -th root
Diffie–Hellman problem
• Authors: Dongyoung Roh; I-Yeol Kim; Sang Geun Hahn
Pages: 41 - 57
Abstract: There are many variants of the computational Diffie–Hellman problem that are necessary to provide security of many cryptographic schemes. Two of them are the square Diffie–Hellman problem and the square root Diffie–Hellman problem. Recently, the first and third authors proved that these two problems are polynomial-time equivalent under a certain condition (Roh and Hahn in Des Codes Cryptogr 62(2):179–187, 2011). In this paper, we generalize this result. We introduce the l-th power Diffie–Hellman problem and the l-th root Diffie–Hellman problem and show that these two problems are polynomial-time equivalent for $$l = O (\log p)$$ under a condition similar to that of Roh and Hahn (2011), where p is the order of the underlying group.
PubDate: 2018-01-01
DOI: 10.1007/s00200-017-0321-3
Issue No: Vol. 29, No. 1 (2018)

• Weight enumerators of a class of linear codes
• Authors: Jaehyun Ahn; Dongseok Ka
Pages: 59 - 76
Abstract: Recently, linear codes constructed from defining sets have been studied widely and they have many applications. For an odd prime p, let $$q=p^{m}$$ for a positive integer m and $$\mathrm {Tr}_{m}$$ the trace function from $$\mathbb {F}_{q}$$ onto $$\mathbb {F}_{p}$$ . In this paper, for a positive integer t, let $$D\subset \mathbb {F}^{t}_{q}$$ and $$D=\{(x_{1},x_{2}) \in (\mathbb {F}_{q}^{*})^{2} : \mathrm {Tr}_{m}(x_{1}+x_{2})=0\}$$ , we define a p-ary linear code $$\mathcal {C}_{D}$$ by \begin{aligned} \mathcal {C}_{D}=\left\{ \mathbf {c}(a_{1},a_{2}) : (a_{1},a_{2})\in \mathbb {F}^{2}_{q}\right\} , \end{aligned} where \begin{aligned} \mathbf {c}(a_{1},a_{2})=\left( \mathrm {Tr}_{m}\left( a_{1}x^{2}_{1}+a_{2}x^{2}_{2}\right) \right) _{(x_{1},x_{2})\in D}. \end{aligned} We compute the weight enumerators of the punctured codes $$\mathcal {C}_{D}$$ .
PubDate: 2018-01-01
DOI: 10.1007/s00200-017-0329-8
Issue No: Vol. 29, No. 1 (2018)

• Verifiability-based conversion from CPA to CCA-secure predicate encryption
• Authors: Mridul Nandi; Tapas Pandit
Pages: 77 - 102
Abstract: Predicate encryption (PE), a generalization of attribute-based encryption (ABE), is a versatile tool for providing access control over data. The underlying predicate for a PE is parametrized by an index, called system parameter or simply system-index. A system-index, in general, consists of component(s) from $$\mathbb {N}$$ . Yamada et al. in PKC 2011 proposed a verifiability-based conversion from CPA to CCA-secure ABE. This conversion was generalized by Yamada et al. in PKC 2012 from ABE to PE. In the later conversion, the authors considered the system-index to be a single component. In practice, there are many schemes, e.g., functional encryption for general relations and hierarchical-inner product (HIP) encryption schemes of Okamoto-Takashima in CRYPTO 2010, CANS 2011 and EUROCRYPT 2012, where system-indices consist of more than a single component. Therefore, for these schemes, the conversion of Yamada et al. (in PKC, 2012) is out of scope. In this paper, we revisit the CPA to CCA conversion for PE and propose a new conversion based on verifiability. The proposed conversion works irrespective of the number of components in the system-indices. It generalizes the existing conversion of Yamada et al. (in PKC, 2011) from ABE to PE. The PE schemes which are realized by the conversion of Yamada et al. (2011) are also realized by our conversion. Therefore, the conversion of ours has more scope than the conversion proposed in 2012. We show that all the aforementioned CPA-secure schemes for general relations and HIP relation are easily converted to the corresponding CCA-secure schemes by our conversion. Further, we show a generic conversion from CPA to CCA-secure functional encryption for regular languages which captures the existing PE schemes for regular languages.
PubDate: 2018-01-01
DOI: 10.1007/s00200-017-0330-2
Issue No: Vol. 29, No. 1 (2018)

• Generalized Walsh transforms of symmetric and rotation symmetric Boolean
functions are linear recurrent
• Authors: Francis N. Castro; Luis A. Medina; Pantelimon Stănică
Abstract: Exponential sums of symmetric Boolean functions are linear recurrent with integer coefficients. This was first established by Cai, Green and Thierauf in the mid nineties. Consequences of this result has been used to study the asymptotic behavior of symmetric Boolean functions. Recently, Cusick extended it to rotation symmetric Boolean functions, which are functions with good cryptographic properties. In this article, we put all these results in the general context of Walsh transforms and some of its generalizations (nega–Hadamard transform, for example). Precisely, we show that Walsh transforms, for which exponential sums are just an instance, of symmetric and rotation symmetric Boolean functions satisfy linear recurrences with integer coefficients. We also provide a closed formula for the Walsh transform and nega–Hadamard transform of any symmetric Boolean functions. Moreover, using the techniques presented in this work, we show that some families of rotation symmetric Boolean functions are not bent when the number of variables is sufficiently large and provide asymptotic evidence to a conjecture of Stănică and Maitra.
PubDate: 2018-02-20
DOI: 10.1007/s00200-018-0351-5

• Some classes of permutation polynomials over finite fields with odd
characteristic
• Authors: Qian Liu; Yujuan Sun; WeiGuo Zhang
Abstract: Permutation polynomials have important applications in cryptography, coding theory, combinatorial designs, and other areas of mathematics and engineering. Finding new classes of permutation polynomials is therefore an interesting subject of study. In this paper, for an integer s satisfying $$s=\frac{q^n-1}{2}+q^r$$ , we give six classes of permutation polynomials of the form $$(ax^{q^m}-bx+\delta )^s+L(x)$$ over $$\mathbb {F}_{q^n}$$ , and for s satisfying $$s(p^m-1)\equiv p^m-1\ (mod\ p^n-1)$$ or $$s(p^{{\frac{k}{2}}m}-1)\equiv p^{km}-1 (mod\ p^n-1)$$ , we propose three classes of permutation polynomials of the form $$(aTr_m^n(x)+\delta )^s+L(x)$$ over $$\mathbb {F}_{p^n}$$ , respectively.
PubDate: 2018-01-31
DOI: 10.1007/s00200-018-0350-6

• On division polynomial PIT and supersingularity
• Authors: Javad Doliskani
Abstract: For an elliptic curve E over a finite field $$\mathbb {F}_q$$ , where q is a prime power, we propose new algorithms for testing the supersingularity of E. Our algorithms are based on the polynomial identity testing problem for the p-th division polynomial of E. In particular, an efficient algorithm using points of high order on E is given.
PubDate: 2018-01-16
DOI: 10.1007/s00200-018-0349-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
Pages: 457 - 467
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-12-01
DOI: 10.1007/s00200-017-0315-1
Issue No: Vol. 28, No. 6 (2017)

• Some cyclic codes from some monomials
• Authors: Zohreh Rajabi; Kazem Khashyarmanesh
Pages: 469 - 495
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-12-01
DOI: 10.1007/s00200-017-0317-z
Issue No: Vol. 28, No. 6 (2017)

• Spaces of directed paths on pre-cubical sets
• Authors: Krzysztof Ziemiański
Pages: 497 - 525
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-12-01
DOI: 10.1007/s00200-017-0316-0
Issue No: Vol. 28, No. 6 (2017)

• An improved method for determining the weight distribution of a family of
q -ary cyclic codes
• Authors: Gerardo Vega
Pages: 527 - 533
Abstract: The purpose of this work is to use an already known identity among the weight enumerator polynomials, in order to present an improved method for determining the weight distribution of a family of q-ary reducible cyclic codes, that generalize, in an easier way, the results in Yu and Liu (Des Codes Cryptogr 78:731–745, 2016).
PubDate: 2017-12-01
DOI: 10.1007/s00200-017-0318-y
Issue No: Vol. 28, No. 6 (2017)

• Linear codes from quadratic forms
• Authors: Xiaoni Du; Yunqi Wan
Pages: 535 - 547
Abstract: Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime power q, we present a class of linear codes over finite fields $$F_q$$ with quadratic forms via a general construction and then determine the explicit complete weight enumerators of these linear codes. Our construction covers some related ones via quadratic form functions and the linear codes may have applications in cryptography and secret sharing schemes.
PubDate: 2017-12-01
DOI: 10.1007/s00200-017-0319-x
Issue No: Vol. 28, No. 6 (2017)

• A constructive test for exponential stability of linear time-varying
discrete-time systems
• Authors: Ulrich Oberst
Pages: 437 - 456
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-11-01
DOI: 10.1007/s00200-017-0314-2
Issue No: Vol. 28, No. 5 (2017)

• Natural orders for asymmetric space–time coding: minimizing the
discriminant
• Authors: Amaro Barreal; Capi Corrales Rodrigáñez; Camilla Hollanti
Abstract: Algebraic space–time coding—a powerful technique developed in the context of multiple-input multiple-output (MIMO) wireless communications—has profited tremendously from tools from Class Field Theory and, more concretely, the theory of central simple algebras and their orders. During the last decade, the study of space–time codes for practical applications, and more recently for future generation (5G $$+$$ ) wireless systems, has provided a practical motivation for the consideration of many interesting mathematical problems. One such problem is the explicit computation of orders of central simple algebras with small discriminants. In this article, we consider the most interesting asymmetric MIMO channel setups and, for each treated case, we provide explicit pairs of fields and a corresponding non-norm element giving rise to a cyclic division algebra whose natural order has the minimum possible discriminant.
PubDate: 2017-12-14
DOI: 10.1007/s00200-017-0348-5

• The weight distribution for any irreducible cyclic code of length $$p^m$$
p m
• Authors: Gerardo Vega
Abstract: We generalize and simplify the results of Sharma and Bakshi (Finite Fields Appl 18(1):144–159 2012) on the weight-distributions of irreducible cyclic codes of prime-power length.
PubDate: 2017-11-29
DOI: 10.1007/s00200-017-0347-6

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: 107.22.48.243

About JournalTOCs
API
Help
News (blog, publications)

JournalTOCs © 2009-