


default search action
Applicable Algebra in Engineering, Communication and Computing, Volume 30
Volume 30, Number 1, January 2019
- Shanding Xu, Xiwang Cao, Guangkui Xu, Chunming Tang:

Two classes of optimal frequency-hopping sequences with new parameters. 1-16 - Joris van der Hoeven

:
Computing with D-algebraic power series. 17-49 - Krzysztof Ziemianski

:
Directed path spaces via discrete vector fields. 51-74 - Xiaoqiang Wang, Dabin Zheng, Hongwei Liu:

Several classes of linear codes and their weight distributions. 75-92
Volume 30, Number 2, March 2019
- Fei Li, Yang Yan, Qiuyan Wang, Tongjiang Yan:

Several classes of binary linear codes and their weight enumerators. 93-106 - Duc-Phong Le

, Nadia El Mrabet
, Safia Haloui, Chik How Tan:
On the near prime-order MNT curves. 107-125 - Chimere S. Anabanti:

Three questions of Bertram on locally maximal sum-free sets. 127-134 - Gook Hwa Cho, Byeonghwan Go, Chang Heon Kim, Namhun Koo

, Soonhak Kwon:
On the Cipolla-Lehmer type algorithms in finite fields. 135-145 - Ahmed Mameri, Amar Aissani

:
Orthogonal matrix and its application in Bloom's threshold scheme. 147-160 - Yun Gao, Jian Gao, Fang-Wei Fu:

Quantum codes from cyclic codes over the ring 𝔽q + v1𝔽q + ⋯ + vr 𝔽q. 161-174 - Wenqin Zhang, Haode Yan, Honglei Wei:

Four families of minimal binary linear codes with wmin/wmax ≤ 1/2. 175-184
Volume 30, Number 3, June 2019
- Nuh Aydin:

Some new linear codes from skew cyclic codes and computer algebra challenges. 185-191 - Steven T. Dougherty, Esengül Saltürk

, Steve Szabo:
On codes over Frobenius rings: generating characters, MacWilliams identities and generator matrices. 193-206 - Nabil Bennenni, Kenza Guenda, Thomas Aaron Gulliver:

Greedy construction of DNA codes and new bounds. 207-216 - Zhifan Ye

, Pinhui Ke, Chenhuang Wu:
A further study of the linear complexity of new binary cyclotomic sequence of length pr. 217-231 - Peter Beelen

:
A note on the generalized Hamming weights of Reed-Muller codes. 233-242 - Joris van der Hoeven

:
From implicit to recursive equations. 243-262 - Angelina Y. M. Chin

, Huey Voon Chen:
Complete decompositions of finite abelian groups. 263-274
Volume 30, Number 4, August 2019
- Koji Chinen:

Extremal invariant polynomials not satisfying the Riemann hypothesis. 275-284 - Nurettin Bagirmaz

:
Near approximations in groups. 285-297 - Mustafa Uçkun, Ebubekir Inan

:
Approximately Γ -semigroups in proximal relator spaces. 299-311 - Kondwani Magamba, John A. Ryan:

Counting extended irreducible Goppa codes. 313-331 - Dongmei Huang, Chunming Tang, Yanfeng Qi, Maozhi Xu:

New quadratic bent functions in polynomial forms with coefficients in extension fields. 333-347 - Sayaka Ishizuki, Michio Oyamaguchi, Masahiko Sakai

:
Conditions for confluence of innermost terminating term rewriting systems. 349-360
Volume 30, Number 5, November 2019
- Giorgos Kapetanakis

:
A Swan-like note for a family of binary pentanomials. 361-372 - T. L. Alderson

:
n-dimensional optical orthogonal codes, bounds and optimal constructions. 373-386 - Pantelimon Stanica

, Bimal Mandal, Subhamoy Maitra:
The connection between quadratic bent-negabent functions and the Kerdock code. 387-401 - T. Aaron Gulliver, Masaaki Harada:

On extremal double circulant self-dual codes of lengths 90-96. 403-415 - Kaitlyn Chubb, Daniel Panario

, Qiang Wang:
Fixed points of rational functions satisfying the Carlitz property. 417-439 - Gerardo Vega:

A characterization of all semiprimitive irreducible cyclic codes in terms of their lengths. 441-452
Volume 30, Number 6, December 2019
- Wenjuan Yin, Can Xiang, Fang-Wei Fu:

A further construction of asymptotically optimal codebooks with multiplicative characters. 453-469 - Amit Sharma

, Maheshanand Bhaintwal
:
A class of 2D skew-cyclic codes over 𝔽q + u𝔽q. 471-490 - Graham H. Norton:

On the annihilator ideal of an inverse form: addendum. 491-507 - Joris van der Hoeven

, Robin Larrieu:
Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals. 509-539

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














