pith. sign in

arxiv: 1904.04333 · v1 · pith:CYIN42Y7new · submitted 2019-04-08 · 💻 cs.IT · math.IT

Polynomial Invariant Theory and Shape Enumerator of Self-Dual Codes in the NRT-Metric

classification 💻 cs.IT math.IT
keywords self-dualmathbbdescribeenumeratorinvariantnrt-codesshapecodes
0
0 comments X
read the original abstract

In this paper we consider self-dual NRT-codes, that is, self-dual codes in the metric space endowed with the Niederreiter-Rosenbloom-Tsfasman (NRT-metric). We use polynomial invariant theory to describe the shape enumerator of a binary self-dual, doubly even self-dual, and doubly-doubly even self dual NRT-code $C\subseteq M_{n,2}(\mathbb{F}_{2})$. Motivated by these results we describe the number of invariant polinomials that we must find to describe the shape enumerator of a self-dual NRT-code of $M_{n,s}(\mathbb{F}_{2})$. We define the ordered flip of a matrix $A\in M_{k,ns}(\mathbb{F}_{q})$ and present some constructions of self-dual NRT-codes over $\mathbb{F}_{q}$. We further give an application of ordered flip to the classification of bidimensional self-dual NRT-codes.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.