Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes

06/25/2020 βˆ™ by Daniel Augot, et al. βˆ™ 0 βˆ™

This paper extends the study of rank-metric codes in extension fields 𝕃 equipped with an arbitrary Galois group G = Gal(𝕃/𝕂). We propose a framework for studying these codes as subspaces of the group algebra 𝕃[G], and we relate this point of view with usual notions of rank-metric codes in 𝕃^N or in 𝕂^NΓ— N, where N = [𝕃 : 𝕂]. We then adapt the notion of error-correcting pairs to this context, in order to provide a non-trivial decoding algorithm for these codes. We then focus on the case where G is abelian, which leads us to see codewords as elements of a multivariate skew polynomial ring. We prove that we can bound the dimension of the vector space of zeroes of these polynomials, depending of their degree. This result can be seen as an analogue of Alon-FΓΌredi theorem – and by means, of Schwartz-Zippel lemma – in the rank metric. Finally, we construct the counterparts of Reed-Muller codes in the rank metric, and we give their parameters. We also show the connection between these codes and classical Reed-Muller codes in the case where 𝕃 is a Kummer extension.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.