`a`
Advances in Mathematics of Communications (AMC)
 

ISSN 1930-5346(print)
ISSN 1930-5338(online)

Current volume

Go

Journal archive

Go


Advanced Search

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.

AMC publishes four issues in 2016 in February, May, August and November and is a joint publication of the American Institute of Mathematical Sciences and Shandong University.

Archived in Portico

TOP 10 Most Read Articles in AMC, August 2016

1

Heuristics of the Cocks-Pinch method
Volume 8, Number 1,  Pages: 103 - 118,  2014

Min Sha

 Abstract       References       Full Text      Related Articles

2

On multi-trial Forney-Kovalev decoding of concatenated codes
Volume 8, Number 1,  Pages: 1 - 20,  2014

Anas Chaaban, Vladimir Sidorenko and Christian Senger

 Abstract       References       Full Text      Related Articles

3

Weierstrass semigroup and codes over the curve $y^q + y = x^{q^r + 1}$
Volume 8, Number 1,  Pages: 67 - 72,  2014

Alonso Sepúlveda and Guilherme Tizziotti

 Abstract       References       Full Text      Related Articles

4

Self-dual [62, 31, 12] and [64, 32, 12] codes with an automorphism of order 7
Volume 8, Number 1,  Pages: 73 - 81,  2014

Nikolay Yankov

 Abstract       References       Full Text      Related Articles

5

Sets of zero-difference balanced functions and their applications
Volume 8, Number 1,  Pages: 83 - 101,  2014

Qi Wang and Yue Zhou

 Abstract       References       Full Text      Related Articles

6

Special bent and near-bent functions
Volume 8, Number 1,  Pages: 21 - 33,  2014

Jacques Wolfmann

 Abstract       References       Full Text      Related Articles

7

Unified combinatorial constructions of optimal optical orthogonal codes
Volume 8, Number 1,  Pages: 53 - 66,  2014

Cuiling Fan and Koji Momihara

 Abstract       References       Full Text      Related Articles

8

An improved lower bound for $(1,\leq 2)$-identifying codes in the king grid
Volume 8, Number 1,  Pages: 35 - 52,  2014

Florent Foucaud, Tero Laihonen and Aline Parreau

 Abstract       References       Full Text      Related Articles

9

LDPC codes associated with linear representations of geometries
Volume 4, Number 3,  Pages: 405 - 417,  2010

Peter Vandendriessche

 Abstract       Full Text      Related Articles

10

The cross-correlation distribution of a $p$-ary $m$-sequence of period $p^{2k}-1$ and its decimated sequence by $\frac{(p^{k}+1)^{2}}{2(p^{e}+1)}$
Volume 7, Number 4,  Pages: 409 - 424,  2013

Yuhua Sun, Zilong Wang, Hui Li and Tongjiang Yan

 Abstract       References       Full Text      Related Articles

Go to top