Construction of n variable codes
type: Item
instance of: scholarly article
title: Construction of n variable codes
zbMATH Open document ID: 0581.94021
DOI: 10.1016/0012-365X(85)90034-2
author: C. Rigoni
published in: Discrete Mathematics
publication date: 1985-01-01T00:00:00Z
review text: In this paper we study the construction of codes in algebras of the following form: \[ A={\mathbb{F}}_ p[X_ 1,...,X_ n]/(t_ 1(X_ 1),...,t_ n(X_ N)), \] where every \(t_ i(X_ i)\) is a polynomial in \({\mathbb{F}}_ p[X_ i]\) (p prime). We construct these codes by using the decomposition of A in principal ideals \((g_ i)\) [\textit{A. Poli}, Codes dans certaines algèbres modulaires, Thèse d'état, Univ. P. Sabatier, Toulouse (1978)]. The construction of the polynomials \(g_ i\) requires two polynomial factorizations. We demonstrate some proofs for the construction of the polynomials \(g_ i\). A consequence of these proofs is that we deduce all the irreducible factors in \({\mathbb{F}}_ q[X]\) of an irreducible polynomial in \({\mathbb{F}}_ p[X]\), from one factor, where \(q=p^ r\). These proofs improve the computation time for a constructing algorithm of n variable codes. We present this algorithm and we give results obtained from a program written at the AAECC group on a Burroughs 6700 in Fortran IV.
Mathematics Subject Classification ID: 94B99
Mathematics Subject Classification ID: 11T06
Mathematics Subject Classification ID: 12E05
zbMATH DE Number: 3930897
zbMATH Keywords: factorization of polynomials over finite fields
zbMATH Keywords: principal ideals
zbMATH Keywords: irreducible polynomial
zbMATH Keywords: algorithm
MaRDI profile type: Publication
cites work: Q5598073
cites work: Q3345782
cites work: Q3735626
cites work: Q4745754
description: scientific article; zbMATH DE number 3930897