February  2011, 5(1): 119-147. doi: 10.3934/amc.2011.5.119

Linear nonbinary covering codes and saturating sets in projective spaces

1. 

Institute for Information Transmission Problems (Kharkevich institute), Russian Academy of Sciences, GSP-4, Moscow, 127994, Russian Federation

2. 

Dipartimento di Matematica e Informatica, Università degli Studi di Perugia, 06123, Perugia, Italy, Italy, Italy

Received  September 2010 Published  February 2011

Let $\mathcal A$R,q denote a family of covering codes, in which the covering radius $R$ and the size $q$ of the underlying Galois field are fixed, while the code length tends to infinity. The construction of families with small asymptotic covering densities is a classical problem in the area of Covering Codes.
   In this paper, infinite sets of families $\mathcal A$R,q, where $R$ is fixed but $q$ ranges over an infinite set of prime powers are considered, and the dependence on $q$ of the asymptotic covering densities of $\mathcal A$R,q is investigated. It turns out that for the upper limit $\mu$q*(R,$\mathcal A$R,q) of the covering density of $\mathcal A$R,q, the best possibility is $\mu$q*(R,$\mathcal A$R,q)=$O(q)$. The main achievement of the present paper is the construction of optimal infinite sets of families $\mathcal A$R,q, that is, sets of families such that relation $\mu$q*(R,$\mathcal A$R,q)=$O(q)$ holds, for any covering radius $R\geq 2$.
   We first showed that for a given $R$, to obtain optimal infinite sets of families it is enough to construct $R$ infinite families $\mathcal A$R,q(0), $\mathcal A$R,q(1), $\ldots$, $\mathcal A$R,q(R-1) such that, for all $u\geq u$0, the family $\mathcal A$R,q($\gamma$) contains codes of codimension $r$u$=Ru + \gamma$ and length $f$q($\gamma$)($r$u) where $f$q($\gamma$)$(r)=O(q$(r-R)/R$)$ and $u$0 is a constant. Then, we were able to construct the necessary families $\mathcal A$R,q($\gamma$) for any covering radius $R\geq 2$, with $q$ ranging over the (infinite) set of $R$-th powers. A result of independent interest is that in each of these families $\mathcal A$R,q($\gamma$), the lower limit of the covering density is bounded from above by a constant independent of $q$.
   The key tool in our investigation is the design of new small saturating sets in projective spaces over finite fields, which are used as the starting point for the $q$m-concatenating constructions of covering codes. A new concept of $N$-fold strong blocking set is introduced. As a result of our investigation, many new asymptotic and finite upper bounds on the length function of covering codes and on the smallest sizes of saturating sets, are also obtained. Updated tables for these upper bounds are provided. An analysis and a survey of the known results are presented.
Citation: Alexander A. Davydov, Massimo Giulietti, Stefano Marcugini, Fernanda Pambianco. Linear nonbinary covering codes and saturating sets in projective spaces. Advances in Mathematics of Communications, 2011, 5 (1) : 119-147. doi: 10.3934/amc.2011.5.119
References:
[1]

S. Aravamuthan and S. Lodha, Covering codes for hats-on-a-line,, Electr. J. Combin., 13 (2006).   Google Scholar

[2]

A. Ashikhmin and A. Barg, Bounds on the covering radius of linear codes,, Des. Codes Crypt., 27 (2002), 261.  doi: 10.1023/A:1019995105405.  Google Scholar

[3]

T. S. Baicheva and E. D. Velikova, Covering radii of ternary linear codes of small dimensions and codimensions,, IEEE Trans. Inform. Theory, 43 (1997), 2057.   Google Scholar

[4]

S. Ball and A. Blokhuis, On the size of a double blocking set in $PG(2,q)$,, Finite Fields Appl., 2 (1996), 125.  doi: 10.1006/ffta.1996.9999.  Google Scholar

[5]

S. Ball and J. W. P. Hirschfeld, Bounds on $(n,r)$-arcs and their application to linear codes,, Finite Fields Appl., 11 (2005), 326.  doi: 10.1016/j.ffa.2005.04.002.  Google Scholar

[6]

J. Bierbrauer, "Introduction to Coding Theory,'', Chapman & Hall/CRC, (2005).   Google Scholar

[7]

J. Bierbrauer and J. Fridrich, Constructing good covering codes for applications in steganography,, in, (2008), 1.  doi: 10.1007/978-3-540-69019-1_1.  Google Scholar

[8]

E. Boros, T. Szőnyi and K. Tichler, On defining sets for projective planes,, Discrete Math., 303 (2005), 17.  doi: 10.1016/j.disc.2004.12.015.  Google Scholar

[9]

R. A. Brualdi, S. Litsyn and V. S. Pless, Covering radius,, in, (1998), 755.   Google Scholar

[10]

R. A. Brualdi, V. S. Pless and R. M. Wilson, Short codes with a given covering radius,, IEEE Trans. Inform. Theory, 35 (1989), 99.  doi: 10.1109/18.42181.  Google Scholar

[11]

G. Cohen, I. Honkala, S. Litsyn and A. Lobstein, "Covering Codes,'', North-Holland, (1997).   Google Scholar

[12]

G. Cohen, M. G. Karpovsky, H. F. Mattson, Jr. and J. R. Shatz, Covering radius - Survey and recent results,, IEEE Trans. Inform. Theory, 31 (1985), 328.  doi: 10.1109/TIT.1985.1057043.  Google Scholar

[13]

G. Cohen and A. Vardy, Duality between packings and coverings of the Hamming space,, Adv. Math. Commun., 1 (2007), 93.  doi: 10.3934/amc.2007.1.93.  Google Scholar

[14]

A. A. Davydov, Construction of linear covering codes,, Problems Inform. Transmiss., 26 (1990), 317.   Google Scholar

[15]

A. A. Davydov, Constructions and families of covering codes and saturated sets of points in projective geometry,, IEEE Trans. Inform. Theory, 41 (1995), 2071.  doi: 10.1109/18.476339.  Google Scholar

[16]

A. A. Davydov, On nonbinary linear codes with covering radius two,, in, (1996), 105.   Google Scholar

[17]

A. A. Davydov, Constructions and families of nonbinary linear codes with covering radius 2,, IEEE Trans. Inform. Theory, 45 (1999), 1679.  doi: 10.1109/18.771244.  Google Scholar

[18]

A. A. Davydov, New constructions of covering codes,, Des. Codes Crypt., 22 (2001), 305.  doi: 10.1023/A:1008302507816.  Google Scholar

[19]

A. A. Davydov and A. Y. Drozhzhina-Labinskaya, Constructions, families and tables of binary linear covering codes,, IEEE Trans. Inform. Theory, 40 (1994), 1270.  doi: 10.1109/18.335937.  Google Scholar

[20]

A. A. Davydov, G. Faina, S. Marcugini and F. Pambianco, Computer search in projective planes for the sizes of complete arcs,, J. Geom., 82 (2005), 50.  doi: 10.1007/s00022-004-1719-1.  Google Scholar

[21]

A. A. Davydov, G. Faina, S. Marcugini and F. Pambianco, Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces,, IEEE Trans. Inform. Theory, 51 (2005), 4378.  doi: 10.1109/TIT.2005.859297.  Google Scholar

[22]

A. A. Davydov, G. Faina, S. Marcugini and F. Pambianco, On sizes of complete arcs in $PG(2,q)$,, preprint , ().   Google Scholar

[23]

A. A. Davydov, M. Giulietti, S. Marcugini and F. Pambianco, Linear covering codes over nonbinary finite fields,, in, (2008), 70.   Google Scholar

[24]

A. A. Davydov, M. Giulietti, S. Marcugini and F. Pambianco, Linear Covering Codes of Radius 2 and 3,, in, (2008), 12.   Google Scholar

[25]

A. A. Davydov, M. Giulietti, S. Marcugini and F. Pambianco, New inductive constructions of complete caps in $PG(N,q)$, $q$ even,, J. Combin. Des., 18 (2010), 176.   Google Scholar

[26]

A. A. Davydov, S. Marcugini and F. Pambianco, On saturating sets in projective spaces,, J. Combin. Theory Ser. A, 103 (2003), 1.  doi: 10.1016/S0097-3165(03)00052-9.  Google Scholar

[27]

A. A. Davydov, S. Marcugini and F. Pambianco, Linear codes with covering radius 2,3 and saturating sets in projective geometry,, IEEE Trans. Inform. Theory, 50 (2004), 537.  doi: 10.1109/TIT.2004.825503.  Google Scholar

[28]

A. A. Davydov and P. R. J. Östergård, New linear codes with covering radius 2 and odd basis,, Des. Codes Crypt., 16 (1999), 29.  doi: 10.1023/A:1008370224461.  Google Scholar

[29]

A. A. Davydov and P. R. J. Östergård, New quaternary linear codes with covering radius 2,, Finite Fields Appl., 6 (2000), 164.  doi: 10.1006/ffta.1999.0271.  Google Scholar

[30]

A. A. Davydov and P. R. J. Östergård, On saturating sets in small projective geometries,, European J. Combin., 21 (2000), 563.  doi: 10.1006/eujc.1999.0373.  Google Scholar

[31]

A. A. Davydov and P. R. J. Östergård, Linear codes with covering radius $R=2,3$ and codimension $tR$,, IEEE Trans. Inform. Theory, 47 (2001), 416.  doi: 10.1109/18.904551.  Google Scholar

[32]

A. A. Davydov and P. R. J. Östergård, Linear codes with covering radius 3,, Des. Codes Crypt., 54 (2010), 253.  doi: 10.1007/s10623-009-9322-y.  Google Scholar

[33]

T. Etzion and B. Mounits, Quasi-perfect codes with small distance,, IEEE Trans. Inform. Theory, 51 (2005), 3938.  doi: 10.1109/TIT.2005.856944.  Google Scholar

[34]

G. Exoo, V. Junnila, T. Laihonen and S. Ranto, Constructions for identifying codes,, in, (2008), 92.   Google Scholar

[35]

E. M. Gabidulin and T. Kløve, On the Newton and covering radii of linear codes,, IEEE Trans. Inform. Theory, 45 (1999), 2534.  doi: 10.1109/18.796399.  Google Scholar

[36]

F. Galand and G. Kabatiansky, Information hiding by coverings,, in, (2003), 151.   Google Scholar

[37]

M. Giulietti, On small dense sets in Galois planes,, Electr. J. Combin., 14 (2007).   Google Scholar

[38]

M. Giulietti, Small complete caps in $PG(N,q)$, $q$ even,, J. Combin. Des., 15 (2007), 420.  doi: 10.1002/jcd.20131.  Google Scholar

[39]

M. Giulietti, G. Korchmáros, S. Marcugini and F. Pambianco, Arcs in $PG(2,q)$ left invariant by $A_6$,, in preparation., ().   Google Scholar

[40]

M. Giulietti and F. Torres, On dense sets related to plane algebraic curves,, Ars. Combin., 72 (2004), 33.   Google Scholar

[41]

R. L. Graham and N. J. A. Sloane, On the covering radius of codes,, IEEE Trans. Inform. Theory, 31 (1985), 385.  doi: 10.1109/TIT.1985.1057039.  Google Scholar

[42]

J. W. P. Hirschfeld, "Projective Geometries over Finite Fields,'' $2^{nd}$ edition,, Oxford University Press, (1998).   Google Scholar

[43]

J. W. P. Hirschfeld and L. Storme, The packing problem in statistics, coding theory and finite projective spaces,, J. Statist. Planning Infer., 72 (1998), 355.  doi: 10.1016/S0378-3758(98)00043-3.  Google Scholar

[44]

C. T. Ho, J. Bruck and R. Agrawal, Partial-sum queries in OLAP data cubes using covering codes,, IEEE Trans. Computers, 47 (1998), 1326.  doi: 10.1109/12.737680.  Google Scholar

[45]

I. S. Honkala, On lengthening of covering codes,, Discrete Math., 106/107 (1992), 291.  doi: 10.1016/0012-365X(92)90556-U.  Google Scholar

[46]

G. A. Kabatyansky and V. I. Panchenko, Unit sphere packings and coverings of the Hamming space,, Problems Inform. Transmiss., 24 (1988), 261.   Google Scholar

[47]

G. Kiss, I. Kovács, K. Kutnar, J. Ruff and P. Šparl, A note on a geometric construction of large Cayley graphs of given degree and diameter,, Studia Univ. Babeş-Bolyai Math., 54 (2009), 77.   Google Scholar

[48]

S. J. Kovács, Small saturated sets in finite projective planes,, Rend. Mat. Ser. VII, 12 (1992), 157.   Google Scholar

[49]

I. N. Landjev, Linear codes over finite fields and finite projective geometries,, Discrete Math., 213 (2000), 211.  doi: 10.1016/S0012-365X(99)00183-1.  Google Scholar

[50]

A. Lobstein, Covering radius,, a bibliography, ().   Google Scholar

[51]

F. J. MacWilliams and N. J. A. Sloane, "The Theory of Error-Correcting Codes,'', North-Holland, (1977).   Google Scholar

[52]

S. Marcugini and F. Pambianco, Minimal 1-saturating sets in $PG(2,q)$, $q\leq 16$,, Australas. J. Combin., 28 (2003), 161.   Google Scholar

[53]

P. R. J. Östergård, New constructions for $q$-ary covering codes,, Ars Combin., 52 (1999), 51.   Google Scholar

[54]

V. S. Pless, W. C. Huffman and R. A. Brualdi, An introduction to algebraic codes,, in, (1998), 3.   Google Scholar

[55]

R. Struik, "Covering Codes,'', Ph.D thesis, (1994).   Google Scholar

[56]

E. Ughi, Saturated configurations of points in projective Galois spaces,, European J. Combin., 8 (1987), 325.   Google Scholar

show all references

References:
[1]

S. Aravamuthan and S. Lodha, Covering codes for hats-on-a-line,, Electr. J. Combin., 13 (2006).   Google Scholar

[2]

A. Ashikhmin and A. Barg, Bounds on the covering radius of linear codes,, Des. Codes Crypt., 27 (2002), 261.  doi: 10.1023/A:1019995105405.  Google Scholar

[3]

T. S. Baicheva and E. D. Velikova, Covering radii of ternary linear codes of small dimensions and codimensions,, IEEE Trans. Inform. Theory, 43 (1997), 2057.   Google Scholar

[4]

S. Ball and A. Blokhuis, On the size of a double blocking set in $PG(2,q)$,, Finite Fields Appl., 2 (1996), 125.  doi: 10.1006/ffta.1996.9999.  Google Scholar

[5]

S. Ball and J. W. P. Hirschfeld, Bounds on $(n,r)$-arcs and their application to linear codes,, Finite Fields Appl., 11 (2005), 326.  doi: 10.1016/j.ffa.2005.04.002.  Google Scholar

[6]

J. Bierbrauer, "Introduction to Coding Theory,'', Chapman & Hall/CRC, (2005).   Google Scholar

[7]

J. Bierbrauer and J. Fridrich, Constructing good covering codes for applications in steganography,, in, (2008), 1.  doi: 10.1007/978-3-540-69019-1_1.  Google Scholar

[8]

E. Boros, T. Szőnyi and K. Tichler, On defining sets for projective planes,, Discrete Math., 303 (2005), 17.  doi: 10.1016/j.disc.2004.12.015.  Google Scholar

[9]

R. A. Brualdi, S. Litsyn and V. S. Pless, Covering radius,, in, (1998), 755.   Google Scholar

[10]

R. A. Brualdi, V. S. Pless and R. M. Wilson, Short codes with a given covering radius,, IEEE Trans. Inform. Theory, 35 (1989), 99.  doi: 10.1109/18.42181.  Google Scholar

[11]

G. Cohen, I. Honkala, S. Litsyn and A. Lobstein, "Covering Codes,'', North-Holland, (1997).   Google Scholar

[12]

G. Cohen, M. G. Karpovsky, H. F. Mattson, Jr. and J. R. Shatz, Covering radius - Survey and recent results,, IEEE Trans. Inform. Theory, 31 (1985), 328.  doi: 10.1109/TIT.1985.1057043.  Google Scholar

[13]

G. Cohen and A. Vardy, Duality between packings and coverings of the Hamming space,, Adv. Math. Commun., 1 (2007), 93.  doi: 10.3934/amc.2007.1.93.  Google Scholar

[14]

A. A. Davydov, Construction of linear covering codes,, Problems Inform. Transmiss., 26 (1990), 317.   Google Scholar

[15]

A. A. Davydov, Constructions and families of covering codes and saturated sets of points in projective geometry,, IEEE Trans. Inform. Theory, 41 (1995), 2071.  doi: 10.1109/18.476339.  Google Scholar

[16]

A. A. Davydov, On nonbinary linear codes with covering radius two,, in, (1996), 105.   Google Scholar

[17]

A. A. Davydov, Constructions and families of nonbinary linear codes with covering radius 2,, IEEE Trans. Inform. Theory, 45 (1999), 1679.  doi: 10.1109/18.771244.  Google Scholar

[18]

A. A. Davydov, New constructions of covering codes,, Des. Codes Crypt., 22 (2001), 305.  doi: 10.1023/A:1008302507816.  Google Scholar

[19]

A. A. Davydov and A. Y. Drozhzhina-Labinskaya, Constructions, families and tables of binary linear covering codes,, IEEE Trans. Inform. Theory, 40 (1994), 1270.  doi: 10.1109/18.335937.  Google Scholar

[20]

A. A. Davydov, G. Faina, S. Marcugini and F. Pambianco, Computer search in projective planes for the sizes of complete arcs,, J. Geom., 82 (2005), 50.  doi: 10.1007/s00022-004-1719-1.  Google Scholar

[21]

A. A. Davydov, G. Faina, S. Marcugini and F. Pambianco, Locally optimal (nonshortening) linear covering codes and minimal saturating sets in projective spaces,, IEEE Trans. Inform. Theory, 51 (2005), 4378.  doi: 10.1109/TIT.2005.859297.  Google Scholar

[22]

A. A. Davydov, G. Faina, S. Marcugini and F. Pambianco, On sizes of complete arcs in $PG(2,q)$,, preprint , ().   Google Scholar

[23]

A. A. Davydov, M. Giulietti, S. Marcugini and F. Pambianco, Linear covering codes over nonbinary finite fields,, in, (2008), 70.   Google Scholar

[24]

A. A. Davydov, M. Giulietti, S. Marcugini and F. Pambianco, Linear Covering Codes of Radius 2 and 3,, in, (2008), 12.   Google Scholar

[25]

A. A. Davydov, M. Giulietti, S. Marcugini and F. Pambianco, New inductive constructions of complete caps in $PG(N,q)$, $q$ even,, J. Combin. Des., 18 (2010), 176.   Google Scholar

[26]

A. A. Davydov, S. Marcugini and F. Pambianco, On saturating sets in projective spaces,, J. Combin. Theory Ser. A, 103 (2003), 1.  doi: 10.1016/S0097-3165(03)00052-9.  Google Scholar

[27]

A. A. Davydov, S. Marcugini and F. Pambianco, Linear codes with covering radius 2,3 and saturating sets in projective geometry,, IEEE Trans. Inform. Theory, 50 (2004), 537.  doi: 10.1109/TIT.2004.825503.  Google Scholar

[28]

A. A. Davydov and P. R. J. Östergård, New linear codes with covering radius 2 and odd basis,, Des. Codes Crypt., 16 (1999), 29.  doi: 10.1023/A:1008370224461.  Google Scholar

[29]

A. A. Davydov and P. R. J. Östergård, New quaternary linear codes with covering radius 2,, Finite Fields Appl., 6 (2000), 164.  doi: 10.1006/ffta.1999.0271.  Google Scholar

[30]

A. A. Davydov and P. R. J. Östergård, On saturating sets in small projective geometries,, European J. Combin., 21 (2000), 563.  doi: 10.1006/eujc.1999.0373.  Google Scholar

[31]

A. A. Davydov and P. R. J. Östergård, Linear codes with covering radius $R=2,3$ and codimension $tR$,, IEEE Trans. Inform. Theory, 47 (2001), 416.  doi: 10.1109/18.904551.  Google Scholar

[32]

A. A. Davydov and P. R. J. Östergård, Linear codes with covering radius 3,, Des. Codes Crypt., 54 (2010), 253.  doi: 10.1007/s10623-009-9322-y.  Google Scholar

[33]

T. Etzion and B. Mounits, Quasi-perfect codes with small distance,, IEEE Trans. Inform. Theory, 51 (2005), 3938.  doi: 10.1109/TIT.2005.856944.  Google Scholar

[34]

G. Exoo, V. Junnila, T. Laihonen and S. Ranto, Constructions for identifying codes,, in, (2008), 92.   Google Scholar

[35]

E. M. Gabidulin and T. Kløve, On the Newton and covering radii of linear codes,, IEEE Trans. Inform. Theory, 45 (1999), 2534.  doi: 10.1109/18.796399.  Google Scholar

[36]

F. Galand and G. Kabatiansky, Information hiding by coverings,, in, (2003), 151.   Google Scholar

[37]

M. Giulietti, On small dense sets in Galois planes,, Electr. J. Combin., 14 (2007).   Google Scholar

[38]

M. Giulietti, Small complete caps in $PG(N,q)$, $q$ even,, J. Combin. Des., 15 (2007), 420.  doi: 10.1002/jcd.20131.  Google Scholar

[39]

M. Giulietti, G. Korchmáros, S. Marcugini and F. Pambianco, Arcs in $PG(2,q)$ left invariant by $A_6$,, in preparation., ().   Google Scholar

[40]

M. Giulietti and F. Torres, On dense sets related to plane algebraic curves,, Ars. Combin., 72 (2004), 33.   Google Scholar

[41]

R. L. Graham and N. J. A. Sloane, On the covering radius of codes,, IEEE Trans. Inform. Theory, 31 (1985), 385.  doi: 10.1109/TIT.1985.1057039.  Google Scholar

[42]

J. W. P. Hirschfeld, "Projective Geometries over Finite Fields,'' $2^{nd}$ edition,, Oxford University Press, (1998).   Google Scholar

[43]

J. W. P. Hirschfeld and L. Storme, The packing problem in statistics, coding theory and finite projective spaces,, J. Statist. Planning Infer., 72 (1998), 355.  doi: 10.1016/S0378-3758(98)00043-3.  Google Scholar

[44]

C. T. Ho, J. Bruck and R. Agrawal, Partial-sum queries in OLAP data cubes using covering codes,, IEEE Trans. Computers, 47 (1998), 1326.  doi: 10.1109/12.737680.  Google Scholar

[45]

I. S. Honkala, On lengthening of covering codes,, Discrete Math., 106/107 (1992), 291.  doi: 10.1016/0012-365X(92)90556-U.  Google Scholar

[46]

G. A. Kabatyansky and V. I. Panchenko, Unit sphere packings and coverings of the Hamming space,, Problems Inform. Transmiss., 24 (1988), 261.   Google Scholar

[47]

G. Kiss, I. Kovács, K. Kutnar, J. Ruff and P. Šparl, A note on a geometric construction of large Cayley graphs of given degree and diameter,, Studia Univ. Babeş-Bolyai Math., 54 (2009), 77.   Google Scholar

[48]

S. J. Kovács, Small saturated sets in finite projective planes,, Rend. Mat. Ser. VII, 12 (1992), 157.   Google Scholar

[49]

I. N. Landjev, Linear codes over finite fields and finite projective geometries,, Discrete Math., 213 (2000), 211.  doi: 10.1016/S0012-365X(99)00183-1.  Google Scholar

[50]

A. Lobstein, Covering radius,, a bibliography, ().   Google Scholar

[51]

F. J. MacWilliams and N. J. A. Sloane, "The Theory of Error-Correcting Codes,'', North-Holland, (1977).   Google Scholar

[52]

S. Marcugini and F. Pambianco, Minimal 1-saturating sets in $PG(2,q)$, $q\leq 16$,, Australas. J. Combin., 28 (2003), 161.   Google Scholar

[53]

P. R. J. Östergård, New constructions for $q$-ary covering codes,, Ars Combin., 52 (1999), 51.   Google Scholar

[54]

V. S. Pless, W. C. Huffman and R. A. Brualdi, An introduction to algebraic codes,, in, (1998), 3.   Google Scholar

[55]

R. Struik, "Covering Codes,'', Ph.D thesis, (1994).   Google Scholar

[56]

E. Ughi, Saturated configurations of points in projective Galois spaces,, European J. Combin., 8 (1987), 325.   Google Scholar

[1]

Manish K. Gupta, Chinnappillai Durairajan. On the covering radius of some modular codes. Advances in Mathematics of Communications, 2014, 8 (2) : 129-137. doi: 10.3934/amc.2014.8.129

[2]

Tsonka Baicheva, Iliya Bouyukliev. On the least covering radius of binary linear codes of dimension 6. Advances in Mathematics of Communications, 2010, 4 (3) : 399-404. doi: 10.3934/amc.2010.4.399

[3]

Rafael Arce-Nazario, Francis N. Castro, Jose Ortiz-Ubarri. On the covering radius of some binary cyclic codes. Advances in Mathematics of Communications, 2017, 11 (2) : 329-338. doi: 10.3934/amc.2017025

[4]

Otávio J. N. T. N. dos Santos, Emerson L. Monte Carmelo. A connection between sumsets and covering codes of a module. Advances in Mathematics of Communications, 2018, 12 (3) : 595-605. doi: 10.3934/amc.2018035

[5]

Masaaki Harada, Akihiro Munemasa. On the covering radii of extremal doubly even self-dual codes. Advances in Mathematics of Communications, 2007, 1 (2) : 251-256. doi: 10.3934/amc.2007.1.251

[6]

Maciej J. Capiński. Covering relations and the existence of topologically normally hyperbolic invariant sets. Discrete & Continuous Dynamical Systems - A, 2009, 23 (3) : 705-725. doi: 10.3934/dcds.2009.23.705

[7]

Jesús Carrillo-Pacheco, Felipe Zaldivar. On codes over FFN$(1,q)$-projective varieties. Advances in Mathematics of Communications, 2016, 10 (2) : 209-220. doi: 10.3934/amc.2016001

[8]

Christine Bachoc, Alberto Passuello, Frank Vallentin. Bounds for projective codes from semidefinite programming. Advances in Mathematics of Communications, 2013, 7 (2) : 127-145. doi: 10.3934/amc.2013.7.127

[9]

Olof Heden, Martin Hessler. On linear equivalence and Phelps codes. Advances in Mathematics of Communications, 2010, 4 (1) : 69-81. doi: 10.3934/amc.2010.4.69

[10]

Jop Briët, Assaf Naor, Oded Regev. Locally decodable codes and the failure of cotype for projective tensor products. Electronic Research Announcements, 2012, 19: 120-130. doi: 10.3934/era.2012.19.120

[11]

Tuvi Etzion, Alexander Vardy. On $q$-analogs of Steiner systems and covering designs. Advances in Mathematics of Communications, 2011, 5 (2) : 161-176. doi: 10.3934/amc.2011.5.161

[12]

Maciej J. Capiński, Piotr Zgliczyński. Covering relations and non-autonomous perturbations of ODEs. Discrete & Continuous Dynamical Systems - A, 2006, 14 (2) : 281-293. doi: 10.3934/dcds.2006.14.281

[13]

Petr Lisoněk, Layla Trummer. Algorithms for the minimum weight of linear codes. Advances in Mathematics of Communications, 2016, 10 (1) : 195-207. doi: 10.3934/amc.2016.10.195

[14]

Jean Creignou, Hervé Diet. Linear programming bounds for unitary codes. Advances in Mathematics of Communications, 2010, 4 (3) : 323-344. doi: 10.3934/amc.2010.4.323

[15]

B. K. Dass, Namita Sharma, Rashmi Verma. Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces. Advances in Mathematics of Communications, 2018, 12 (4) : 629-639. doi: 10.3934/amc.2018037

[16]

Fernando Hernando, Diego Ruano. New linear codes from matrix-product codes with polynomial units. Advances in Mathematics of Communications, 2010, 4 (3) : 363-367. doi: 10.3934/amc.2010.4.363

[17]

Daniel Heinlein, Sascha Kurz. Binary subspace codes in small ambient spaces. Advances in Mathematics of Communications, 2018, 12 (4) : 817-839. doi: 10.3934/amc.2018048

[18]

Roland Hildebrand. Barriers on projective convex sets. Conference Publications, 2011, 2011 (Special) : 672-683. doi: 10.3934/proc.2011.2011.672

[19]

Nuh Aydin, Nicholas Connolly, Markus Grassl. Some results on the structure of constacyclic codes and new linear codes over GF(7) from quasi-twisted codes. Advances in Mathematics of Communications, 2017, 11 (1) : 245-258. doi: 10.3934/amc.2017016

[20]

John Sheekey. A new family of linear maximum rank distance codes. Advances in Mathematics of Communications, 2016, 10 (3) : 475-488. doi: 10.3934/amc.2016019

2018 Impact Factor: 0.879

Metrics

  • PDF downloads (7)
  • HTML views (0)
  • Cited by (15)

[Back to Top]