ISSN 19305346(print)
ISSN 19305338(online)

Current volume

Journal archive


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, December 2016
1 
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
We call a subset $C$ of vertices of a graph $G$ a $(1,\leq
l)$identifying code if for all subsets $X$ of vertices with size
at most $\ell$, the sets $\{c\in C~~\exists u\in X, d(u,c)\leq 1\}$
are distinct. The concept of identifying codes was introduced in 1998
by Karpovsky, Chakrabarty and Levitin. Identifying codes have been
studied in various grids. In particular, it has been shown that there
exists a $(1,\leq 2)$identifying code in the king grid with density
$\frac{3}{7}$ and that there are no such identifying codes with
density smaller than $\frac{5}{12}$. Using a suitable frame and a
discharging procedure, we improve the lower bound by showing that any
$(1,\leq 2)$identifying code of the king grid has density at least
$\frac{47}{111}$. This reduces the gap between the best known lower
and upper bounds on this problem by more than $56\%$.

2 
Heuristics of the CocksPinch method
Volume 8, Number 1, Pages: 103  118, 2014
Min Sha
Abstract
References
Full Text
Related Articles
We heuristically analyze the CocksPinch method by using the BatemanHorn conjecture. Especially, we present the first known heuristic which suggests that any efficient construction of pairingfriendly elliptic curves can efficiently generate such curves over pairingfriendly fields, naturally including the CocksPinch method. Finally, some numerical evidence is given.

3 
Special bent and nearbent functions
Volume 8, Number 1, Pages: 21  33, 2014
Jacques Wolfmann
Abstract
References
Full Text
Related Articles
Starting from special nearbent functions in dimension $2t1$ we construct bent functions in dimension $2t$
having a specific derivative. We deduce new families of bent functions.

4 
Canonical systematic form for codes in hierarchical poset metrics
Volume 6, Number 3, Pages: 315  328, 2012
Luciano Viana Felix
and Marcelo Firer
Abstract
References
Full Text
Related Articles
In this work we present a canonicalsystematic form of a generator matrix
for linear codes whith respect to a hierarchical poset metric on the
linear space $\mathbb F_q^n$. We show that up to a linear isometry any
such code is equivalent to the direct sum of codes with smaller dimensions.
The canonicalsystematic form enables to exhibit simple expressions for
the generalized minimal weights (in the sense defined by Wei), the packing
radius of the code, characterization of perfect codes and also syndrome
decoding algorithm that has (in general) exponential gain when compared
to usual syndrome decoding.

5 
On $q$analogs of Steiner systems and covering designs
Volume 5, Number 2, Pages: 161  176, 2011
Tuvi Etzion
and Alexander Vardy
Abstract
References
Full Text
Related Articles
The $q$analogs of covering designs, Steiner systems, and Turán designs are studied. It is shown that $q$covering designs and $q$Turán designs are dual notions. A strong necessary condition for the existence of Steiner structures (the $q$analogs of Steiner systems) over $\mathbb F$_{2} is given. No Steiner structures of strength $2$ or more are currently known, and our condition shows that their existence would imply the existence of new Steiner systems of strength $3$. The exact values of the $q$covering numbers $\mathcal C$_{q}$(n,k,1)$ and $\mathcal C$_{q}$(n,n1,r)$ are determined for all $q,n,k,r$. Furthermore, recursive upper and lower bounds on the size of general $q$covering designs and $q$Turán designs are presented. Finally, it is proved that $\mathcal C$_{2}$(5,3,2) = 27$ and $\mathcal C$_{2}$(7,3,2) \leq 399$. Tables of upper and lower bounds on $\mathcal C$_{2}$(n,k,r)$ are given for all $n \leq 8$.

6 
New constructions of optimal frequency hopping sequences with new parameters
Volume 7, Number 1, Pages: 91  101, 2013
Fang Liu,
Daiyuan Peng,
Zhengchun Zhou
and Xiaohu Tang
Abstract
References
Full Text
Related Articles
In this paper, three constructions of frequency hopping sequences
(FHSs) are proposed using a new generalized cyclotomy with respect
to $\textbf{Z}_{p^n}$, where $p$ is an odd prime and $n$ is a
positive integer. Based on some basic properties of the new
generalized cyclotomy, it is shown that all the constructed FHSs are
optimal with respect to the wellknown LempelGreenberger bound.
Furthermore, these FHSs have new parameters which are not reported
in the literature.

7 
Sets of zerodifference balanced functions and their applications
Volume 8, Number 1, Pages: 83  101, 2014
Qi Wang
and Yue Zhou
Abstract
References
Full Text
Related Articles
Zerodifference balanced (ZDB) functions can be employed in many applications, e.g., optimal constant composition codes, optimal and perfect difference systems of sets, optimal frequency hopping sequences, etc. In this paper, two results are summarized to characterize ZDB functions, among which a lower bound is used to achieve optimality in applications and determine the size of preimage sets of ZDB functions. As the main contribution, a generic construction of ZDB functions is presented, and many new classes of ZDB functions can be generated. This construction is then extended to construct a set of ZDB functions, in which any two ZDB functions are related uniformly. Furthermore, some applications of such sets of ZDB functions are also introduced.

8 
A new almost perfect nonlinear function which is not quadratic
Volume 3, Number 1, Pages: 59  81, 2009
Yves Edel
and Alexander Pott
Abstract
Full Text
Related Articles
Following an example in [12],
we show how to change one coordinate function of an
almost perfect nonlinear
(APN) function in order to obtain new examples. It turns out that
this is a very powerful method to construct new
APN functions. In particular, we show that our approach can
be used to construct a ''nonquadratic'' APN function.
This new example
is in remarkable contrast to all recently constructed functions which
have all been quadratic.
An equivalent function has been found
independently
by Brinkmann and Leander [8]. However, they
claimed that their function is CCZ equivalent to a quadratic one. In this
paper we give several reasons
why this new function is not equivalent to a quadratic one.

9 
Selfdual [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
This paper studies and classifies all binary selfdual $[62, 31, 12]$ and $[64, 32, 12]$ codes having
an automorphism of order 7 with 8 cycles. This classification is done by applying a method for
constructing binary selfdual codes with an automorphism of odd prime order $p$.
There are exactly 8 inequivalent binary selfdual $[62, 31, 12]$ codes with an automorphism of
type $7(8,6)$. As for binary $[64,32,12]$ selfdual codes with an automorphism of type $7(8,8)$ there
are 44465 doublyeven and 557 singlyeven such codes. Some of the constructed singlyeven codes for both lengths
have weight enumerators for which the existence was not known before.

10 
On multitrial ForneyKovalev 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
A concatenated code $\mathcal{C} $ based on an inner code with Hamming distance $d^i$ and an outer code with Hamming distance $d^o$ is considered. An outer
decoder that corrects $\varepsilon$ errors and $\theta$
erasures with high probability if $\lambda \varepsilon + \theta \le d^o  1,$ where a real number
$1<\lambda\le 2$ is the tradeoff rate between errors and erasures
for this decoder is used. In particular, an outer $l$punctured RS code, i.e., a code over the field $\mathbb{F}_{q^{l }}$ of length $n^{o} < q$ with locators taken from the subfield $\mathbb{F}_{q}$, where $l\in \{1,2,\ldots\}$ is considered. In this case, the tradeoff is given by $\lambda=1+1/l$. An $m$trial decoder, where after inner decoding, in each trial we erase an incremental number of symbols and decode using the outer decoder is proposed. The optimal erasing strategy and the error correcting radii of both fixed and adaptive erasing decoders are given.
Our approach extends results of Forney and Kovalev (obtained for
$\lambda=2$) to the whole given range of $\lambda$. For the fixed
erasing strategy the error correcting radius approaches
$\rho_F\approx\frac{d^i d^o}{2}(1\frac{l^{m}}{2})$ for large $d^o$. For the adaptive erasing strategy, the error correcting radius
$\rho_A\approx\frac{d^i d^o}{2}(1l^{2m})$ quickly approaches $d^i d^o/2$ if $l$ or $m$ grows. The minimum number of trials required to reach an
error correcting radius $d^i d^o/2$ is $m_A=\frac{1}{2}\left(\log_ld+1\right)$. This means that $2$ or $3$ trials are sufficient in many practical cases if $l>1$.

Go to top

