default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDApplicable Algebra in Engineering, Communication and Computing, Volume 29
Volume 29, Number 1, January 2018
- Haode Yan:
A class of primitive BCH codes and their weight distribution. 1-11 - Yuan Cao, Yonglin Cao, Li Dong:
Complete classification of (δ + α u2)-constacyclic codes over 𝔽3m[u]<u4> of length 3n. 13-39 - Dongyoung Roh
, I-Yeol Kim, Sang Geun Hahn:
The l-th power Diffie-Hellman problem and the l-th root Diffie-Hellman problem. 41-57 - Jaehyun Ahn, Dongseok Ka:
Weight enumerators of a class of linear codes. 59-76 - Mridul Nandi, Tapas Pandit:
Verifiability-based conversion from CPA to CCA-secure predicate encryption. 77-102
Volume 29, Number 2, March 2018
- Yang Zhang:
Cryptanalysis of a key exchange protocol based on the ring Ep(m). 103-112 - Sylvain Duquesne, Nadia El Mrabet, Safia Haloui, Franck Rondepierre:
Choosing and generating parameters for pairing implementation on BN curves. 113-147 - Deepa Sinha, Deepakshi Sharma:
Iterated local transitivity model for signed social networks. 149-167 - Yoshinori Aono, Manindra Agrawal, Takakazu Satoh, Osamu Watanabe:
On the optimality of lattices for the coppersmith technique. 169-195
Volume 29, Number 3, June 2018
- Chunming Tang, Yanfeng Qi, Zhengchun Zhou, Cuiling Fan:
Two infinite classes of rotation symmetric bent functions with simple representation. 197-208 - Can Xiang, Xianfang Wang, Chunming Tang, Fang-Wei Fu:
Two classes of linear codes and their weight distributions. 209-225 - Jennifer D. Key, Bernardo Gabriel Rodrigues:
LCD codes from adjacency matrices of graphs. 227-244 - Omar Akchiche, Omar Khadir:
Factoring RSA moduli with primes sharing bits in the middle. 245-259 - Dae-Woong Lee:
Near-rings on digital Hopf groups. 261-282
Volume 29, Number 4, August 2018
- Bentolhoda Binaei, Amir Hashemi, Werner M. Seiler:
A Pommaret bases approach to the degree of a polynomial ideal. 283-301 - Pinar Çomak, Jon-Lark Kim, Ferruh Özbudak:
New cubic self-dual codes of length 54, 60 and 66. 303-312 - Susanne Pumplün:
How to obtain lattices from $$(f, \sigma , \delta )$$ ( f , σ , δ ) -codes via a generalization of Construction A. 313-333 - Minjia Shi, Liqin Qian, Patrick Solé:
Few-weight codes from trace codes over a local ring. 335-350 - Pamela E. Harris, Erik Insko, Anthony Simpson:
Computing weight q-multiplicities for the representations of the simple Lie algebras. 351-362 - Gerardo Vega:
The weight distribution for any irreducible cyclic code of length $$p^m$$ p m. 363-370
Volume 29, Number 5, November 2018
- Amaro Barreal, Capi Corrales Rodrigáñez, Camilla Hollanti:
Natural orders for asymmetric space-time coding: minimizing the discriminant. 371-391 - Javad Doliskani:
On division polynomial PIT and supersingularity. 393-407 - Qian Liu, Yujuan Sun, WeiGuo Zhang:
Some classes of permutation polynomials over finite fields with odd characteristic. 409-431 - Francis N. Castro, Luis A. Medina, Pantelimon Stanica:
Generalized Walsh transforms of symmetric and rotation symmetric Boolean functions are linear recurrent. 433-453
Volume 29, Number 6, December 2018
- Yuan Cao, Yonglin Cao, Fang-Wei Fu:
Matrix-product structure of constacyclic codes over finite chain rings 𝔽pm[u]/⟨ue⟩. 455-478 - Yanping Wang, Zhengbang Zha, Weiguo Zhang:
Six new classes of permutation trinomials over 𝔽33k. 479-499 - Fei Li:
A class of cyclotomic linear codes and their generalized Hamming weights. 501-511 - Jacques Wolfmann:
Three-weight codes and near-bent functions from two-weight codes. 513-528 - Yanfeng Qi, Chunming Tang, Dongmei Huang:
Explicit characterization of two classes of regular bent functions. 529-544
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 22:08 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
