AI Chat AI Image Generator AI Video Text to Speech

On the exponent of cyclic codes

08/30/2022
∙
by   Anuj Kumar Bhagat, et al.
∙
0
∙

We propose an algorithm to find a lower bound for the number of cyclic codes over any finite field with any given exponent. Besides, we give a formula to find the exponent of BCH codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 09/24/2020

Exponent of Cyclic Codes over 𝔽_q

In this article, we introduce and study the concept of the exponent of a...
0 N. Annamalai, et al. ∙
research
∙ 02/22/2019

Skew Constacyclic and LCD Codes over F_q+v F_q

The aim of this paper is to give conditions for the equivalency between ...
0 Ranya D. Boulanouar, et al. ∙
research
∙ 04/20/2016

Decoding Interleaved Gabidulin Codes using Alekhnovich's Algorithm

We prove that Alekhnovich's algorithm can be used for row reduction of s...
0 Sven Puchinger, et al. ∙
research
∙ 06/11/2015

Fractal surfaces from simple arithmetic operations

Fractal surfaces ('patchwork quilts') are shown to arise under most gene...
0 Vladimir Garcia-Morales, et al. ∙
research
∙ 08/21/2002

Winner-Relaxing Self-Organizing Maps

A new family of self-organizing maps, the Winner-Relaxing Kohonen Algori...
0 Jens Christian Claussen, et al. ∙
research
∙ 01/02/2022

A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It

We prove a new lower bound on the field size of locally repairable codes...
0 Han Cai, et al. ∙
research
∙ 05/12/2023

The Critical Theorem for q-Polymatroids

The Critical Theorem, due to Henry Crapo and Gian-Carlo Rota, has been e...
0 Gianira N. Alfarano, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal