All Issues

Volume 13, 2019

Volume 12, 2018

Volume 11, 2017

Volume 10, 2016

Volume 9, 2015

Volume 8, 2014

Volume 7, 2013

Volume 6, 2012

Volume 5, 2011

Volume 4, 2010

Volume 3, 2009

Volume 2, 2008

Volume 1, 2007

Advances in Mathematics of Communications (AMC) publishes original research papers of the highest quality in all areas of mathematics and computer science which are relevant to applications in communications technology. For this reason, submissions from many areas of mathematics are invited, provided these show a high level of originality, new techniques, an innovative approach, novel methodologies, or otherwise a high level of depth and sophistication. Any work that does not conform to these standards will be rejected.

Areas covered include coding theory, cryptology, combinatorics, finite geometry, algebra and number theory, but are not restricted to these. This journal also aims to cover the algorithmic and computational aspects of these disciplines. Hence, all mathematics and computer science contributions of appropriate depth and relevance to the above mentioned applications in communications technology are welcome.

More detailed indication of the journal's scope is given by the subject interests of the members of the board of editors.

All papers will undergo a thorough peer reviewing process unless the subject matter of the paper does not fit the journal; in this case, the author will be informed promptly. Every effort will be made to secure a decision in three months and to publish accepted papers within six months.

  • AIMS is a member of COPE. All AIMS journals adhere to the publication ethics and malpractice policies outlined by COPE.
  • Publishes 4 issues a year in February, May, August and November.
  • Publishes online only.
  • Indexed in Science Citation Index E, CompuMath Citation Index, Current Contents/Physics, Chemical, & Earth Sciences, INSPEC, Mathematical Reviews, MathSciNet, PASCAL/CNRS, Scopus, Web of Science, Zentralblatt MATH and dblp: computer science bibliography.
  • Archived in Portico and CLOCKSS.
  • Shandong University is a founding institution of AMC.
  • AMC is a publication of the American Institute of Mathematical Sciences. All rights reserved.

Note: “Most Cited” is by Cross-Ref , and “Most Downloaded” is based on available data in the new website.

Select all articles


More cyclotomic constructions of optimal frequency-hopping sequences
Shanding Xu, Xiwang Cao, Jiafu Mi and Chunming Tang
2019, 13(3) : 373-391 doi: 10.3934/amc.2019024 +[Abstract](657) +[HTML](219) +[PDF](439.02KB)
Optimal subspace codes in $ {{\rm{PG}}}(4,q) $
Antonio Cossidente, Francesco Pavese and Leo Storme
2019, 13(3) : 393-404 doi: 10.3934/amc.2019025 +[Abstract](636) +[HTML](196) +[PDF](345.17KB)
Exponential generalised network descriptors
Suzana Antunović, Tonči Kokan, Tanja Vojković and Damir Vukičević
2019, 13(3) : 405-420 doi: 10.3934/amc.2019026 +[Abstract](526) +[HTML](197) +[PDF](380.25KB)
New non-binary quantum codes from constacyclic codes over $ \mathbb{F}_q[u,v]/\langle u^{2}-1, v^{2}-v, uv-vu\rangle $
Fanghui Ma, Jian Gao and Fang-Wei Fu
2019, 13(3) : 421-434 doi: 10.3934/amc.2019027 +[Abstract](620) +[HTML](245) +[PDF](408.33KB)
A unified polynomial selection method for the (tower) number field sieve algorithm
Palash Sarkar and Shashank Singh
2019, 13(3) : 435-455 doi: 10.3934/amc.2019028 +[Abstract](746) +[HTML](273) +[PDF](712.38KB)
A subspace code of size $ \bf{333} $ in the setting of a binary $ \bf{q} $-analog of the Fano plane
Daniel Heinlein, Michael Kiermaier, Sascha Kurz and Alfred Wassermann
2019, 13(3) : 457-475 doi: 10.3934/amc.2019029 +[Abstract](593) +[HTML](207) +[PDF](455.08KB)
A spectral characterisation of $ t $-designs and its applications
Eun-Kyung Cho, Cunsheng Ding and Jong Yoon Hyun
2019, 13(3) : 477-503 doi: 10.3934/amc.2019030 +[Abstract](546) +[HTML](177) +[PDF](509.18KB)
A conjecture on permutation trinomials over finite fields of characteristic two
Nian Li and Qiaoyu Hu
2019, 13(3) : 505-512 doi: 10.3934/amc.2019031 +[Abstract](614) +[HTML](208) +[PDF](313.01KB)
Galois extensions, positive involutions and an application to unitary space-time coding
Vincent Astier and Thomas Unger
2019, 13(3) : 513-516 doi: 10.3934/amc.2019032 +[Abstract](569) +[HTML](186) +[PDF](234.89KB)
A new almost perfect nonlinear function which is not quadratic
Yves Edel and Alexander Pott
2009, 3(1) : 59-81 doi: 10.3934/amc.2009.3.59 +[Abstract](2059) +[PDF](288.3KB) Cited By(42)
Skew constacyclic codes over Galois rings
Delphine Boucher, Patrick Solé and Felix Ulmer
2008, 2(3) : 273-292 doi: 10.3934/amc.2008.2.273 +[Abstract](1991) +[PDF](247.3KB) Cited By(28)
A survey of perfect codes
Olof Heden
2008, 2(2) : 223-247 doi: 10.3934/amc.2008.2.223 +[Abstract](2323) +[PDF](323.1KB) Cited By(24)
A review of the available construction methods for Golomb rulers
Konstantinos Drakakis
2009, 3(3) : 235-250 doi: 10.3934/amc.2009.3.235 +[Abstract](1836) +[PDF](218.2KB) Cited By(22)
Public key cryptography based on semigroup actions
Gérard Maze, Chris Monico and Joachim Rosenthal
2007, 1(4) : 489-507 doi: 10.3934/amc.2007.1.489 +[Abstract](2296) +[PDF](248.6KB) Cited By(22)
A new family of linear maximum rank distance codes
John Sheekey
2016, 10(3) : 475-488 doi: 10.3934/amc.2016019 +[Abstract](2632) +[PDF](390.1KB) Cited By(19)
On the order bounds for one-point AG codes
Olav Geil, Carlos Munuera, Diego Ruano and Fernando Torres
2011, 5(3) : 489-504 doi: 10.3934/amc.2011.5.489 +[Abstract](1904) +[PDF](378.6KB) Cited By(18)
Efficient implementation of elliptic curve cryptography in wireless sensors
Diego F. Aranha, Ricardo Dahab, Julio López and Leonardo B. Oliveira
2010, 4(2) : 169-187 doi: 10.3934/amc.2010.4.169 +[Abstract](2378) +[PDF](304.4KB) Cited By(17)
Geometric constructions of optimal optical orthogonal codes
T. L. Alderson and K. E. Mellinger
2008, 2(4) : 451-467 doi: 10.3934/amc.2008.2.451 +[Abstract](1905) +[PDF](239.2KB) Cited By(16)
Linear nonbinary covering codes and saturating sets in projective spaces
Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini and Fernanda Pambianco
2011, 5(1) : 119-147 doi: 10.3934/amc.2011.5.119 +[Abstract](2469) +[PDF](566.6KB) Cited By(15)
\begin{document}$np^s$\end{document} over \begin{document}$\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$\end{document}" >Constacyclic codes of length $np^s$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$
Yonglin Cao, Yuan Cao, Hai Q. Dinh, Fang-Wei Fu, Jian Gao and Songsak Sriboonchitta
2018, 12(2) : 231-262 doi: 10.3934/amc.2018016 +[Abstract](2424) +[HTML](369) +[PDF](555.31KB) PDF Downloads(182)
New families of strictly optimal frequency hopping sequence sets
Jingjun Bao
2018, 12(2) : 387-413 doi: 10.3934/amc.2018024 +[Abstract](2491) +[HTML](248) +[PDF](613.0KB) PDF Downloads(179)
Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces
B. K. Dass, Namita Sharma and Rashmi Verma
2018, 12(4) : 629-639 doi: 10.3934/amc.2018037 +[Abstract](1663) +[HTML](340) +[PDF](366.18KB) PDF Downloads(152)
Strongly secure quantum ramp secret sharing constructed from algebraic curves over finite fields
Ryutaroh Matsumoto
2019, 13(1) : 1-10 doi: 10.3934/amc.2019001 +[Abstract](1400) +[HTML](394) +[PDF](344.95KB) PDF Downloads(141)
Self-dual additive $ \mathbb{F}_4 $-codes of lengths up to 40 represented by circulant graphs
Ken Saito
2019, 13(2) : 213-220 doi: 10.3934/amc.2019014 +[Abstract](761) +[HTML](359) +[PDF](295.67KB) PDF Downloads(137)
\begin{document}$ {{\mathbb{Z}}_{2}}{{\mathbb{Z}}_{2}}{{\mathbb{Z}}_{4}}$\end{document}-additive cyclic codes" >$ {{\mathbb{Z}}_{2}}{{\mathbb{Z}}_{2}}{{\mathbb{Z}}_{4}}$-additive cyclic codes
Tingting Wu, Jian Gao, Yun Gao and Fang-Wei Fu
2018, 12(4) : 641-657 doi: 10.3934/amc.2018038 +[Abstract](1596) +[HTML](341) +[PDF](409.5KB) PDF Downloads(122)
Some new constructions of isodual and LCD codes over finite fields
Fatma-Zohra Benahmed, Kenza Guenda, Aicha Batoul and Thomas Aaron Gulliver
2019, 13(2) : 281-296 doi: 10.3934/amc.2019019 +[Abstract](910) +[HTML](323) +[PDF](410.75KB) PDF Downloads(121)
Some classes of LCD codes and self-orthogonal codes over finite fields
Xia Li, Feng Cheng, Chunming Tang and Zhengchun Zhou
2019, 13(2) : 267-280 doi: 10.3934/amc.2019018 +[Abstract](979) +[HTML](292) +[PDF](417.6KB) PDF Downloads(112)
Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme
Konstantinos A. Draziotis and Anastasia Papadopoulou
2018, 12(3) : 429-449 doi: 10.3934/amc.2018026 +[Abstract](1808) +[HTML](194) +[PDF](543.19KB) PDF Downloads(112)
Some two-weight and three-weight linear codes
Chengju Li, Sunghan Bae and Shudi Yang
2019, 13(1) : 195-211 doi: 10.3934/amc.2019013 +[Abstract](1062) +[HTML](324) +[PDF](412.73KB) PDF Downloads(111)

2017  Impact Factor: 0.564




Email Alert

[Back to Top]