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 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, January 2017
1 
Zero correlation zone sequence set with intergroup orthogonal and intersubgroup complementary properties
Volume 9, Number 1, Pages: 9  21, 2015
Zhenyu Zhang,
Lijia Ge,
Fanxin Zeng
and Guixin Xuan
Abstract
References
Full Text
Related Articles
In this paper, a novel method for constructing complementary
sequence set with zero correlation zone (ZCZ) is presented by
interleaving and combining three orthogonal matrices. The
constructed set can be divided into multiple sequence groups and
each sequence group can be further divided into multiple sequence
subgroups. In addition to ZCZ properties of sequences from the same
sequence subgroup, sequences from different sequence groups are
orthogonal to each other while sequences from different sequence
subgroups within the same sequence group possess ideal
crosscorrelation properties, that is, the proposed ZCZ sequence set
has intergroup orthogonal (IGO) and intersubgroup complementary
(ISC) properties. Compared with previous methods, the new
construction can provide flexible choice for ZCZ width and set size,
and the resultant sequences which are called IGOISC sequences in
this paper can achieve the theoretical bound on the set size for the
ZCZ width and sequence length.

2 
Ideal forms of Coppersmith's theorem and GuruswamiSudan list decoding
Volume 9, Number 3, Pages: 311  339, 2015
Henry Cohn
and Nadia Heninger
Abstract
References
Full Text
Related Articles
We develop a framework for solving polynomial equations with size
constraints on solutions. We obtain our results by showing how to apply a
technique of Coppersmith for finding small solutions of polynomial
equations modulo integers to analogous problems over polynomial rings,
number fields, and function fields. This gives us a unified view of several
problems arising naturally in cryptography, coding theory, and the study of
lattices. We give (1) a polynomialtime algorithm for finding small
solutions of polynomial equations modulo ideals over algebraic number
fields, (2) a faster variant of the GuruswamiSudan algorithm for list
decoding of ReedSolomon codes, and (3) an algorithm for list decoding of
algebraicgeometric codes that handles both singlepoint and multipoint
codes. Coppersmith's algorithm uses lattice basis reduction to find a
short vector in a carefully constructed lattice; powerful analogies from
algebraic number theory allow us to identify the appropriate analogue of a
lattice in each application and provide efficient algorithms to find a
suitably short vector, thus allowing us to give completely parallel proofs
of the above theorems.

3 
The weight distributions of some irreducible cyclic codes of length $p^n$ and $2p^n$
Volume 9, Number 3, Pages: 277  289, 2015
Pankaj Kumar,
Monika Sangwan
and Suresh Kumar Arora
Abstract
References
Full Text
Related Articles
In this paper, an algorithm is given for computing the weight distributions of all irreducible cyclic
codes of dimension $p^jd$ generated by $x^{p^j}1$, where $p$ is an
odd prime, $j\geq 0 $ and $d > 1$. Then the weight distributions of
all irreducible cyclic codes of length $p^n$ and $ 2p^n $ over
$F_q$, where $n$ is a positive integer, $p$, $q$ are distinct odd
primes and $q$ is primitive root modulo $ p^n$, are obtained. The
weight distributions of all the irreducible cyclic codes of length
$3^{n+1}$ over $F_5$ are also determined explicitly.

4 
On weighted minihypers in finite projective spaces of square order
Volume 9, Number 3, Pages: 291  309, 2015
Linda Beukemann,
Klaus Metsch
and Leo Storme
Abstract
References
Full Text
Related Articles
In [11], weighted $\{\delta(q+1),\delta;k1,q\}$minihypers, $q$ square, were characterized as a sum of lines and Baer subgeometries $PG(3,\sqrt{q})$ provided $\delta$ is sufficiently small. We extend this result to a new characterization result on weighted $\{\delta v_{\mu+1},\delta v_{\mu};k1,q\}$minihypers. We prove that such minihypers are sums of $\mu$dimensional subspaces and of (projected) $(2\mu+1)$dimensional Baer subgeometries.

5 
Highrate spacetime block codes from twisted Laurent series rings
Volume 9, Number 3, Pages: 255  275, 2015
Hassan Khodaiemehr
and Dariush Kiani
Abstract
References
Full Text
Related Articles
We construct fulldiversity, arbitrary rate STBCs for specific number of transmit
antennas over an apriori specified signal set using twisted Laurent series rings. Constructing fulldiversity spacetime block codes from algebraic constructions like division algebras
has been done by Shashidhar et al. Constructing STBCs from crossed product algebras arises this question in mind that besides these constructions, which one of the wellknown division algebras are appropriate for constructing spacetime block codes.
This paper deals with twisted Laurent series rings and their subrings twisted function fields, to construct STBCs. First, we introduce twisted Laurent series rings over field extensions of $\mathbb{Q}$. Then, we generalize this construction to the case that coefficients come from a division algebra.
Finally, we use an algorithm to construct twisted function fields, which are noncrossed product division algebras, and we propose a method for constructing STBC from them.

6 
Weight distributions of a class of cyclic codes from $\Bbb F_l$conjugates
Volume 9, Number 3, Pages: 341  352, 2015
Chengju Li,
Qin Yue
and Ziling Heng
Abstract
References
Full Text
Related Articles
Let $\Bbb F_{q^k}$ be a finite field and $\alpha$ a primitive element of $\Bbb F_{q^k}$, where $q=l^f$,
$l$ is a prime power, and $f$ is a positive integer.
Suppose that $N$ is a positive integer and $m_{g^{l^u}}(x)$ is the minimal polynomial of $g^{l^u}$ over $\Bbb F_q$
for $u=0, 1, \ldots, f1$, where $g=\alpha^{N}$.
Let $\mathcal C$ be a cyclic code over $\Bbb F_q$ with check polynomial $$m_g(x)m_{g^l}(x) \cdots m_{g^{l^{f1}}}(x).$$
In this paper, we shall present a method to determine the weight distribution of the cyclic code $\mathcal C$ in two cases: (1) $\gcd(\frac {q^k1} {l1}, N)=1$; (2) $l=2$ and $f=2$.
Moreover, we will obtain a class of twoweight cyclic codes and a class of new threeweight cyclic codes.

7 
Additive cyclic codes over $\mathbb F_4$
Volume 2, Number 3, Pages: 309  343, 2008
W. Cary Huffman
Abstract
Full Text
Related Articles
In this paper we find a canonical form decomposition for additive cyclic codes of even length over $\mathbb F_4$. This decomposition is used to count the number of such codes. We also prove that each code is the $\mathbb F_2$span of at most two codewords and their cyclic shifts. We examine the construction of additive cyclic selfdual codes of even length and apply these results to those codes of length 24.

8 
An improved certificateless strong keyinsulated signature scheme in the standard model
Volume 9, Number 3, Pages: 353  373, 2015
Yang Lu,
Quanling Zhang
and Jiguo Li
Abstract
References
Full Text
Related Articles
Exposure of secret keys may be the most devastating attack on a public key cryptographic scheme since such that security is entirely lost. The keyinsulated security provides a promising approach to deal with this threat since it can effectively mitigate the damage caused by the secret key exposure. To eliminate the cumbersome certificate management in traditional PKIsupported keyinsulated signature while overcoming the key escrow problem in identitybased keyinsulated signature, two certificateless keyinsulated signature schemes without random oracles have been proposed so far. However, both of them suffer from some security drawbacks and do not achieve existential unforgeability. In this paper, we propose a new certificateless strong keyinsulated signature scheme that is proven secure in the standard model. Compared with the previous certificateless strong proxy signature scheme, the proposed scheme offers stronger security and enjoys higher computational efficiency and shorter public parameters.

9 
Additive cyclic codes over $\mathbb F_4$
Volume 1, Number 4, Pages: 427  459, 2007
W. Cary Huffman
Abstract
Full Text
Related Articles
In this paper we find a canonical form decomposition for additive cyclic codes of odd length over $\mathbb F_4$. This decomposition is used to count the number of such codes. We also reprove that each code is the $\mathbb F_2$span of at
most two codewords and their cyclic shifts, a fact first proved in [2]. A count is given for the number of codes that are the $\mathbb F_2$span of one codeword and its cyclic shifts. We can examine this decomposition to see precisely when the code is selforthogonal or selfdual under the trace inner product. Using this, a count is presented for the number of selforthogonal and selfdual additive cyclic codes of odd length. We also provide a count of the additive cyclic and additive cyclic selforthogonal codes as a function of their
$\mathbb F_2$dimension.

10 
Generalized AG convolutional codes
Volume 3, Number 4, Pages: 317  328, 2009
José Ignacio Iglesias Curto
Abstract
Full Text
Related Articles
We present the family of generalized AG convolutional codes, constructed
by using algebraic geometric tools. This construction extends block
generalized AG codes on the one hand and several algebraic constructions of
convolutional codes on the other. The tools employed to define these codes
are also used to obtain information about their parameters and to determine
conditions such that the resulting codes have optimal free distance.

Go to top

