Forthcoming articles

 


International Journal of Information and Coding Theory

 

These articles have been peer-reviewed and accepted for publication in IJICoT, but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.

 

Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.

 

Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.

 

Articles marked with this Open Access icon are freely available and openly accessible to all without any restriction except the ones stated in their respective CC licenses.

 

Register for our alerting service, which notifies you by email when new issues of IJICoT are published online.

 

We also offer RSS feeds which provide timely updates of tables of contents, newly published articles and calls for papers.

 

International Journal of Information and Coding Theory (2 papers in press)

 

Regular Issues

 

  • $\mathbb{Z}_p\mathbb{Z}_p[u]$-Additive cyclic codes   Order a copy of this article
    by Lingyu Diao, Jian Gao 
    Abstract: Additive cyclic codes of length $(\alpha,\beta)$ over $\mathbb{Z}_p\mathbb{Z}_p[u]$ can be viewed as $\mathbb{Z}_p[u][x]$-submodules of $\mathbb{Z}_p[x]/(x^\alpha-1)\times \mathbb{Z}_p[u][x]/(x^\beta-1)$, where $\mathbb{Z}_p[u]=\mathbb{Z}_p+u\mathbb{Z}_p$, $u^2=0$. In this paper, we determine the generator polynomials and the minimal generating sets of this family of codes as $\mathbb{Z}_p[u]$-submodules of $\mathbb{Z}_p[x]/(x^\alpha-1)\times \mathbb{Z}_p[u][x]/(x^\beta-1)$. Further, we also determine the generator polynomials of the dual codes of $\mathbb{Z}_p\mathbb{Z}_p[u]$-additive cyclic codes. Moreover, some binary quantum codes are constructed by additive cyclic codes over $\mathbb{Z}_2\mathbb{Z}_2[u]$.
    Keywords: additive cyclic codes; minimal generating sets; binary quantum codes.

  • A deterministic algorithm for the distance and weight distribution of binary nonlinear codes   Order a copy of this article
    by Emanuele Bellini, Massimiliano Sala 
    Abstract: Given a binary nonlinear code, we provide a deterministic algorithm to compute its weight and distance distribution, rnand in particular its minimum weight and its minimum distance,rnwhich takes advantage of fast Fourier techniques.rnThis algorithm's performance is similar to that of best-known algorithms for the average case, rnwhile it is especially efficient for codes with low information rate. rnWe provide complexity estimates for several cases of interest.
    Keywords: Distance distribution; minimum distance; weight distribution; minimum weight; nonlinear code.