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

November 2009 , Volume 3 , Issue 4

Select all articles


New extremal formally self-dual even codes of length 30
Masaaki Harada and Katsushi Waki
2009, 3(4): 311-316 doi: 10.3934/amc.2009.3.311 +[Abstract](3249) +[PDF](111.5KB)
There are extremal formally self-dual even codes which are not selfdual only for lengths 6, 10, 12, 14, 18, 20, 22, 28 and 30. The only length for which the classification has not been done yet is 30. In this note, new extremal formally self-dual even codes of length 30 are constructed using symmetric matrices.
Generalized AG convolutional codes
José Ignacio Iglesias Curto
2009, 3(4): 317-328 doi: 10.3934/amc.2009.3.317 +[Abstract](3494) +[PDF](195.8KB)
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.
Graph-based classification of self-dual additive codes over finite fields
Lars Eirik Danielsen
2009, 3(4): 329-348 doi: 10.3934/amc.2009.3.329 +[Abstract](4127) +[PDF](272.4KB)
Quantum stabilizer states over Fm can be represented as self-dual additive codes over Fm2. These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operation correspond to equivalence classes of codes. We have previously used this fact to classify self-dual additive codes over F4. In this paper we classify selfdual additive codes over F9, F16, and F25. Assuming that the classical MDS conjecture holds, we are able to classify all self-dual additive MDS codes over F9 by using an extension technique. We prove that the minimum distance of a self-dual additive code is related to the minimum vertex degree in the associated graph orbit. Circulant graph codes are introduced, and a computer search reveals that this set contains many strong codes. We show that some of these codes have highly regular graph representations.
MDS and near-MDS self-dual codes over large prime fields
Ilias S. Kotsireas, Christos Koukouvinos and Dimitris E. Simos
2009, 3(4): 349-361 doi: 10.3934/amc.2009.3.349 +[Abstract](3426) +[PDF](194.6KB)
In this paper, we are interested in the construction of maximum distance separable (MDS) self-dual codes over large prime fields that arise from the solutions of systems of diophantine equations. Using this method we con- struct many self-dualMDS (or near-MDS) codes of lengths up to 16 over various prime fields $GF(p)$, where $p$ = 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 53, 61, 73, 89, 97, 101, 109, 113, 137, 149, 157, 173, 181, 193 and 197. In addition, a number of optimal codes are presented for many lengths up to 40 over small prime fields $GF(p)$. Furthermore, our results on the minimum weight of self-dual codes over prime fields give a better bound than the Pless-Pierce bound obtained from a modified Gilbert-Varshamov bound.
The automorphism groups of linear codes and canonical representatives of their semilinear isometry classes
Thomas Feulner
2009, 3(4): 363-383 doi: 10.3934/amc.2009.3.363 +[Abstract](4632) +[PDF](283.1KB)
The main aim of the classification of linear codes is the evaluation of complete lists of representatives of the isometry classes. These classes are mostly defined with respect to linear isometry, but it is well known that there is also the more general definition of semilinear isometry taking the field automorphisms into account. This notion leads to bigger classes so the data becomes smaller. Hence we describe an algorithm that gives canonical representatives of these bigger classes by calculating a unique generator matrix to a given linear code, in a well defined manner.
    The algorithm is based on the partitioning and refinement idea which is also used to calculate the canonical labeling of a graph [12] and it similarly returns the automorphism group of the given linear code. The time needed by the implementation of the algorithm is comparable to Leon's program [10] for the calculation of the linear automorphism group of a linear code, but it additionally provides a unique representative and the automorphism group with respect to the more general notion of semilinear equivalence. The program can be used online under
Partitions of $\mathbb F$n into non-parallel Hamming codes
Olof Heden and Faina I. Solov’eva
2009, 3(4): 385-397 doi: 10.3934/amc.2009.3.385 +[Abstract](2955) +[PDF](190.0KB)
We investigate partitions of the set $\mathbb F$n of all binary vectors of length $n$ into cosets of pairwise distinct linear Hamming codes (''non-parallel Hamming codes'') of length $n$. We present several constructions of partitions of $\mathbb F$n into non-parallel Hamming codes of length $n$ and discuss a lower bound on the number of different such partitions.
Castle curves and codes
Carlos Munuera, Alonso Sepúlveda and Fernando Torres
2009, 3(4): 399-408 doi: 10.3934/amc.2009.3.399 +[Abstract](3033) +[PDF](181.9KB)
We introduce two types of curves of interest for coding theory purposes: the so-called Castle and weak Castle curves. We study the main properties of codes arising from these curves.
On the Hamming weight of repeated root cyclic and negacyclic codes over Galois rings
Sergio R. López-Permouth and Steve Szabo
2009, 3(4): 409-420 doi: 10.3934/amc.2009.3.409 +[Abstract](3511) +[PDF](180.0KB)
Repeated root Cyclic and Negacyclic codes over Galois rings have been studied much less than their simple root counterparts. This situation is beginning to change. For example, repeated root codes of length ps, where $p$ is the characteristic of the alphabet ring, have been studied under some additional hypotheses. In each one of those cases, the ambient space for the codes has turned out to be a chain ring. In this paper, all remaining cases of cyclic and negacyclic codes of length ps over a Galois ring alphabet are considered. In these cases the ambient space is a local ring with simple socle but not a chain ring. Nonetheless, by reducing the problem to one dealing with uniserial subambients, a method for computing the Hamming distance of these codes is provided.
A generalized construction of OFDM $M$-QAM sequences with low peak-to-average power ratio
Zilong Wang, Guang Gong and Rongquan Feng
2009, 3(4): 421-428 doi: 10.3934/amc.2009.3.421 +[Abstract](3130) +[PDF](146.7KB)
A construction of 22n-QAM sequences is given and an upper bound of the peak-to-mean envelope power ratio (PMEPR) is determined. Some former work can be viewed as special cases of this construction.
David Auger, Irène Charon, Iiro Honkala, Olivier Hudry and Antoine Lobstein
2009, 3(4): 429-430 doi: 10.3934/amc.2009.3.429 +[Abstract](3280) +[PDF](44.6KB)
Erratum to ''Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs'' (Advances in Mathematics of Communications, Vol. 3, no. 1, 2009, 97–114).

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




Email Alert

[Back to Top]