23 resultados para Linear Codes over Finite Fields


Relevância:

100.00% 100.00%

Publicador:

Resumo:

This work was presented in part at the 8th International Conference on Finite Fields and Applications Fq^8 , Melbourne, Australia, 9-13 July, 2007.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

We denoted by nq(k, d), the smallest value of n for which an [n, k, d]q code exists for given q, k, d. Since nq(k, d) = gq(k, d) for all d ≥ dk + 1 for q ≥ k ≥ 3, it is a natural question whether the Griesmer bound is attained or not for d = dk , where gq(k, d) = ∑[d/q^i], i=0,...,k-1, dk = (k − 2)q^(k−1) − (k − 1)q^(k−2). It was shown by Dodunekov [2] and Maruta [9], [10] that there is no [gq(k, dk ), k, dk ]q code for q ≥ k, k = 3, 4, 5 and for q ≥ 2k − 3, k ≥ 6. The purpose of this paper is to determine nq(k, d) for d = dk as nq(k, d) = gq(k, d) + 1 for q ≥ k with 3 ≤ k ≤ 8 except for (k, q) = (7, 7), (8, 8), (8, 9).

Relevância:

100.00% 100.00%

Publicador:

Resumo:

ACM Computing Classification System (1998): E.4.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 12F12, 15A66.

Relevância:

50.00% 50.00%

Publicador:

Resumo:

AMS subject classification: 90C05, 90A14.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

In 2002, van der Geer and van der Vlugt gave explicit equations for an asymptotically good tower of curves over the field F8. In this paper, we will present a method for constructing Goppa codes from these curves as well as explicit constructions for the third level of the tower. The approach is to find an associated plane curve for each curve in the tower and then to use the algorithms of Haché and Le Brigand to find the corresponding Goppa codes.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Mathematics Subject Classification: 26A33, 74B20, 74D10, 74L15

Relevância:

40.00% 40.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 11S31 12E15 12F10 12J20.