All Issues

Volume 16, 2022

Volume 15, 2021

Volume 14, 2020

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

May 2016 , Volume 10 , Issue 2

Select all articles


On codes over FFN$(1,q)$-projective varieties
Jesús Carrillo-Pacheco and Felipe Zaldivar
2016, 10(2): 209-220 doi: 10.3934/amc.2016001 +[Abstract](3881) +[PDF](377.6KB)
For projective varieties defined over a finite field ${\mathbb F}_q$ we show that they contain a unique subvariety that satisfies the Finite Field Nullstellensatz property [1,2], for homogeneous linear polynomials over ${\mathbb F}_q$. Using these subvarieties we construct linear codes and estimate some of their parameters.
On tameness of Matsumoto-Imai central maps in three variables over the finite field $\mathbb F_2$
Keisuke Hakuta, Hisayoshi Sato and Tsuyoshi Takagi
2016, 10(2): 221-228 doi: 10.3934/amc.2016002 +[Abstract](3805) +[PDF](531.3KB)
Triangular transformation method (TTM) is one of the multivariate public key cryptosystems (MPKC) based on the intractability of tame decomposition problem. In TTM, a special class of tame automorphisms are used to construct encryption schemes. However, because of the specificity of such tame automorphisms, it is important to evaluate the computational complexity of the tame decomposition problem for secure use of MPKC. In this paper, as the first step for security evaluations, we focus on Matsumoto-Imai cryptosystems. We shall prove that the Matsumoto-Imai central maps in three variables over $\mathbb{F}_{2}$ is tame, and we describe the tame decompositions of the Matsumoto-Imai central maps.
On the ideal associated to a linear code
Irene Márquez-Corbella, Edgar Martínez-Moro and Emilio Suárez-Canedo
2016, 10(2): 229-254 doi: 10.3934/amc.2016003 +[Abstract](4404) +[PDF](564.0KB)
This article aims to explore the bridge between the algebraic structure of a linear code and the complete decoding process. To this end, we associate a specific binomial ideal $I_+(\mathcal C)$ to an arbitrary linear code. The binomials involved in the reduced Gröbner basis of such an ideal relative to a degree-compatible ordering induce a uniquely defined test-set for the code, and this allows the description of a Hamming metric decoding procedure. Moreover, the binomials involved in the Graver basis of $I_+(\mathcal C)$ provide a universal test-set which turns out to be a set containing the set of codewords of minimal support of the code.
On self-dual cyclic codes of length $p^a$ over $GR(p^2,s)$
Somphong Jitman, San Ling and Ekkasit Sangwisut
2016, 10(2): 255-273 doi: 10.3934/amc.2016004 +[Abstract](3624) +[PDF](473.1KB)
In this paper, cyclic codes over the Galois ring ${\rm GR}({p^2},s)$ are studied. The main result is the characterization and enumeration of Hermitian self-dual cyclic codes of length $p^a$ over ${\rm GR}({p^2},s)$. Combining with some known results and the standard Discrete Fourier Transform decomposition, we arrive at the characterization and enumeration of Euclidean self-dual cyclic codes of any length over ${\rm GR}({p^2},s)$.
Constructing strongly-MDS convolutional codes with maximum distance profile
Diego Napp and Roxana Smarandache
2016, 10(2): 275-290 doi: 10.3934/amc.2016005 +[Abstract](3906) +[PDF](413.8KB)
This paper revisits strongly-MDS convolutional codes with maximum distance profile (MDP). These are (non-binary) convolutional codes that have an optimum sequence of column distances and attains the generalized Singleton bound at the earliest possible time frame. These properties make these convolutional codes applicable over the erasure channel, since they are able to correct a large number of erasures per time interval. The existence of these codes have been shown only for some specific cases. This paper shows by construction the existence of convolutional codes that are both strongly-MDS and MDP for all choices of parameters.
Constructing commutative semifields of square order
Stephen M. Gagola III and Joanne L. Hall
2016, 10(2): 291-306 doi: 10.3934/amc.2016006 +[Abstract](3079) +[PDF](459.0KB)
The projection construction has been used to construct semifields of odd characteristic using a field and a twisted semifield [Commutative semifields from projection mappings, Designs, Codes and Cryptography, 61 (2011), 187--196]. We generalize this idea to a projection construction using two twisted semifields to construct semifields of odd characteristic. Planar functions and semifields have a strong connection so this also constructs new planar functions.
Decoding of differential AG codes
Kwankyu Lee
2016, 10(2): 307-319 doi: 10.3934/amc.2016007 +[Abstract](3531) +[PDF](381.0KB)
The interpolation-based decoding that was developed for general evaluation AG codes is shown to be equally applicable to general differential AG codes. A performance analysis of the decoding algorithm, which is parallel to that of its companion algorithm, is reported. In particular, the decoding capacities of evaluation AG codes and differential AG codes are seen to be interrelated symmetrically. As an interesting special case, a decoding algorithm for classical Goppa codes is presented.
On $\omega$-cyclic-conjugated-perfect quaternary GDJ sequences
Yang Yang, Guang Gong and Xiaohu Tang
2016, 10(2): 321-331 doi: 10.3934/amc.2016008 +[Abstract](3445) +[PDF](394.0KB)
A sequence is called perfect if its autocorrelation function is a delta function. In this paper, we give a new definition of autocorrelation function: $\omega$-cyclic-conjugated autocorrelation. As a result, we present several classes of $\omega$-cyclic-conjugated-perfect quaternary Golay sequences, where $\omega=\pm 1$. We also considered such perfect property for $4^q$-QAM Golay sequences, $q\ge 2$ being an integer.
Arbitrarily varying multiple access channels with conferencing encoders: List decoding and finite coordination resources
Holger Boche and Rafael F. Schaefer
2016, 10(2): 333-354 doi: 10.3934/amc.2016009 +[Abstract](3876) +[PDF](448.1KB)
Communication over channels that may vary in an arbitrary and unknown manner from channel use to channel use is studied. Such channels fall in the framework of arbitrarily varying channels (AVCs), for which it has been shown that the classical deterministic approaches with pre-specified encoder and decoder fail if the AVC is symmetrizable. However, more sophisticated strategies such as common randomness (CR) assisted codes or list decoding are capable to resolve the ambiguity induced by symmetrizable AVCs. AVCs further serve as the indispensable basis for modeling adversarial attacks such as jamming in information theoretic security related communication problems. In this paper, we study the arbitrarily varying multiple access channel (AVMAC) with conferencing encoders, which models the communication scenario with two cooperating transmitters and one receiver. This can be motivated for example by cooperating base stations or access points in future systems. The capacity region of the AVMAC with conferencing encoders is established and it is shown that list decoding allows for reliable communication also for symmetrizable AVMACs. The list capacity region equals the CR-assisted capacity region for large enough list size. Finally, for fixed probability of decoding error the amount of resources, i.e., CR or list size, is quantified and shown to be finite.
Bounds on the number of rational points of algebraic hypersurfaces over finite fields, with applications to projective Reed-Muller codes
Daniele Bartoli, Adnen Sboui and Leo Storme
2016, 10(2): 355-365 doi: 10.3934/amc.2016010 +[Abstract](4297) +[PDF](332.3KB)
We present bounds on the number of points in algebraic curves and algebraic hypersurfaces in $\mathbb{P}^n(\mathbb{F}_q)$ of small degree $d$, depending on the number of linear components contained in such curves and hypersurfaces. The obtained results have applications to the weight distribution of the projective Reed-Muller codes PRM$(q,d,n)$ over the finite field $\mathbb{F}_q$.
The geometric structure of relative one-weight codes
Zihui Liu and Xiangyong Zeng
2016, 10(2): 367-377 doi: 10.3934/amc.2016011 +[Abstract](3193) +[PDF](316.8KB)
The geometric structure of any relative one-weight code is determined, and by using this geometric structure, the support weight distribution of subcodes of any relative one-weight code is presented. An application of relative one-weight codes to the wire-tap channel of type II with multiple users is given, and certain kinds of relative one-weight codes all of whose nonzero codewords are minimal are determined.
Codes over local rings of order 16 and binary codes
Steven T. Dougherty, Esengül Saltürk and Steve Szabo
2016, 10(2): 379-391 doi: 10.3934/amc.2016012 +[Abstract](4051) +[PDF](350.1KB)
We study codes over the commutative local Frobenius rings of order 16 with maximal ideals of size 8. We define a weight preserving Gray map and study the images of these codes as binary codes. We study self-dual codes and determine when they exist.
Non-existence of a ternary constant weight $(16,5,15;2048)$ diameter perfect code
Denis S. Krotov, Patric R. J.  Östergård and Olli Pottonen
2016, 10(2): 393-399 doi: 10.3934/amc.2016013 +[Abstract](4485) +[PDF](321.8KB)
Ternary constant weight codes of length $n=2^m$, weight $n-1$, cardinality $2^n$ and distance $5$ are known to exist for every $m$ for which there exists an APN permutation of order $2^m$, that is, at least for all odd $m \geq 3$ and for $m=6$. We show the non-existence of such codes for $m=4$ and prove that any codes with the parameters above are diameter perfect.
Nearly perfect sequences with arbitrary out-of-phase autocorrelation
Oǧuz Yayla
2016, 10(2): 401-411 doi: 10.3934/amc.2016014 +[Abstract](3224) +[PDF](387.3KB)
A sequence of period $n$ is called a nearly perfect sequence of type $\gamma$ if all out-of-phase autocorrelation coefficients are a constant $\gamma$. In this paper we study nearly perfect sequences (NPS) via their connection to direct product difference sets (DPDS). We prove the connection between a $p$-ary NPS of period $n$ and type $\gamma$ and a cyclic $(n,p,n,\frac{n-\gamma}{p}+\gamma,0,\frac{n-\gamma}{p})$-DPDS for an arbitrary integer $\gamma$. Next, we present the necessary conditions for the existence of a $p$-ary NPS of type $\gamma$. We apply this result for excluding the existence of some $p$-ary NPS of period $n$ and type $\gamma$ for $n \leq 100$ and $\vert \gamma \vert \leq 2$. We also prove the similar results for an almost $p$-ary NPS of type $\gamma$. Finally, we show the non-existence of some almost $p$-ary perfect sequences by showing the non-existence of equivalent cyclic relative difference sets by using the notion of multipliers.
On the error distance of extended Reed-Solomon codes
Yujuan Li and Guizhen Zhu
2016, 10(2): 413-427 doi: 10.3934/amc.2016015 +[Abstract](4253) +[PDF](358.3KB)
It is well known that the main problem of decoding the extended Reed-Solomon codes is computing the error distance of a word. Using some algebraic constructions, we are able to determine the error distance of words whose degrees are $k+1$ and $k+2$ to the extended Reed-Solomon codes. As a corollary, we can simply get the results of Zhang-Fu-Liao on the deep hole problem of Reed-Solomon codes.
Coherence of sensing matrices coming from algebraic-geometric codes
Seungkook Park
2016, 10(2): 429-436 doi: 10.3934/amc.2016016 +[Abstract](3281) +[PDF](279.9KB)
Compressed sensing is a technique which is to used to reconstruct a sparse signal given few measurements of the signal. One of the main problems in compressed sensing is the deterministic construction of the sensing matrix. Li et al. introduced a new deterministic construction via algebraic-geometric codes (AG codes) and gave an upper bound for the coherence of the sensing matrices coming from AG codes. In this paper, we give the exact value of the coherence of the sensing matrices coming from AG codes in terms of the minimum distance of AG codes and deduce the upper bound given by Li et al. We also give formulas for the coherence of the sensing matrices coming from Hermitian two-point codes.
A class of $p$-ary cyclic codes and their weight enumerators
Long Yu and Hongwei Liu
2016, 10(2): 437-457 doi: 10.3934/amc.2016017 +[Abstract](3721) +[PDF](481.4KB)
Let $\mathbb{F}_{p^m}$ be a finite field with $p^m$ elements, where $p$ is an odd prime, and $m$ is a positive integer. Let $h_1(x)$ and $h_2(x)$ be minimal polynomials of $-\pi^{-1}$ and $\pi^{-\frac{p^k+1}{2}}$ over $\mathbb{F}_p$, respectively, where $\pi $ is a primitive element of $\mathbb{F}_{p^m}$, and $k$ is a positive integer such that $\frac{m}{\gcd(m,k)}\geq 3$. In [23], Zhou et al. obtained the weight distribution of a class of cyclic codes over $\mathbb{F}_p$ with parity-check polynomial $h_1(x)h_2(x)$ in the following two cases:
    • $k$ is even and $\gcd(m,k)$ is odd;
    • $\frac{m}{\gcd(m,k)}$ and $\frac{k}{\gcd(m,k)}$ are both odd. In this paper, we further investigate this class of cyclic codes over $\mathbb{F}_p$ in other cases. We determine the weight distribution of this class of cyclic codes.
Cyclic and BCH codes whose minimum distance equals their maximum BCH bound
José Joaquín Bernal, Diana H. Bueno-Carreño and Juan Jacobo Simón
2016, 10(2): 459-474 doi: 10.3934/amc.2016018 +[Abstract](3612) +[PDF](423.1KB)
In this paper we study the family of cyclic codes such that its minimum distance reaches the maximum of its BCH bounds. We also show a way to construct cyclic codes with that property by means of computations of some divisors of a polynomial of the form $x^n-1$. We apply our results to the study of those BCH codes $C$, with designed distance $\delta$, that have minimum distance $d(C)=\delta$. Finally, we present some examples of new binary BCH codes satisfying that condition. To do this, we make use of two related tools: the discrete Fourier transform and the notion of apparent distance of a code, originally defined for multivariate abelian codes.

2021 Impact Factor: 1.015
5 Year Impact Factor: 1.078
2021 CiteScore: 1.8




Email Alert

[Back to Top]