Advances in Mathematics of Communications (AMC)

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

Current volume


Journal archive


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 2017 in February, May, August and November and is a joint publication of the American Institute of Mathematical Sciences and Shandong University.

Archived in Portico and CLOCKSS

TOP 10 Most Read Articles in AMC, May 2017


A survey of perfect codes
Volume 2, Number 2,  Pages: 223 - 247,  2008

Olof Heden

 Abstract       Full Text      Related Articles


Double circulant codes from two class association schemes
Volume 1, Number 1,  Pages: 45 - 64,  2007

Steven T. Dougherty, Jon-Lark Kim and Patrick Solé

 Abstract       Full Text      Related Articles


Linear programming bounds for unitary codes
Volume 4, Number 3,  Pages: 323 - 344,  2010

Jean Creignou and Hervé Diet

 Abstract       Full Text      Related Articles


Relations between arithmetic geometry and public key cryptography
Volume 4, Number 2,  Pages: 281 - 305,  2010

Gerhard Frey

 Abstract       Full Text      Related Articles


Characterization results on weighted minihypers and on linear codes meeting the Griesmer bound
Volume 2, Number 3,  Pages: 261 - 272,  2008

J. De Beule, K. Metsch and L. Storme

 Abstract       Full Text      Related Articles


Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves
Volume 4, Number 2,  Pages: 215 - 235,  2010

Anton Stolbunov

 Abstract       Full Text      Related Articles


Linear nonbinary covering codes and saturating sets in projective spaces
Volume 5, Number 1,  Pages: 119 - 147,  2011

Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini and Fernanda Pambianco

 Abstract       References       Full Text      Related Articles


Cryptanalysis of the CFVZ cryptosystem
Volume 1, Number 1,  Pages: 1 - 11,  2007

Joan-Josep Climent, Elisa Gorla and Joachim Rosenthal

 Abstract       Full Text      Related Articles


On $q$-ary linear completely regular codes with $\rho=2$ and antipodal dual
Volume 4, Number 4,  Pages: 567 - 578,  2010

Joaquim Borges, Josep Rifà and Victor A. Zinoviev

 Abstract       References       Full Text      Related Articles


Gilbert-Varshamov type bounds for linear codes over finite chain rings
Volume 1, Number 1,  Pages: 99 - 109,  2007

Ferruh Özbudak and Patrick Solé

 Abstract       Full Text      Related Articles

Go to top