On the structure of repeated-root polycyclic codes over local rings

07/31/2022
by   Maryam Bajalan, et al.
0

This paper provides the Generalized Mattson Solomon polynomial for repeated-root polycyclic codes over local rings that gives an explicit decomposition of them in terms of idempotents that completes the single root study. It also states some structural properties of repeated-root polycyclic codes over finite fields in terms of matrix product codes. Both approaches provide a description of the ⊥_0-dual code of a given polycyclic code.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/28/2022

One-Sided Repeated-Root Two-Dimensional Cyclic and Constacyclic Codes

In this paper, we study some repeated-root two-dimensional cyclic and co...
research
08/12/2021

A coefficient related to splay-to-root traversal, correct to thousands of decimal places

This paper takes another look at the cost of traversing a binary tree us...
research
05/15/2018

A class of repeated-root constacyclic codes over F_p^m[u]/〈 u^e〉 of Type 2

Let F_p^m be a finite field of cardinality p^m where p is an odd prime, ...
research
11/18/2019

On the Hamming distances of repeated-root cyclic codes of length 5p^s

Due to the wide applications in consumer electronics, data storage syste...
research
04/06/2021

Constrained Parameterization of Reduced Rank and Co-integrated Vector Autoregression

The paper provides a parametrization of Vector Autoregression (VAR) that...
research
12/07/2018

Continuous Performance Benchmarking Framework for ROOT

Foundational software libraries such as ROOT are under intense pressure ...
research
09/29/2020

Quadratic Extensions in ACL2

Given a field K, a quadratic extension field L is an extension of K that...

Please sign up or login with your details

Forgot password? Click here to reset