AI Chat AI Image Generator AI Video Text to Speech

Dihedral codes with prescribed minimum distance

03/24/2020

∙

by Martino Borello, et al.

∙

∙

Dihedral codes, particular cases of quasi-cyclic codes, have a nice algebraic structure which allows to store them efficiently. In this paper, we investigate it and prove some lower bounds on their dimension and minimum distance, in analogy with the theory of BCH codes. This allows us to construct dihedral codes with prescribed minimum distance. In the binary case, we present some examples of optimal dihedral codes obtained by this construction.

Martino Borello
20 publications
Abdelillah Jamous
1 publication

page 1

page 2

page 3

page 4

research

∙ 07/30/2020

Quasi-Cyclic Codes

Quasi-cyclic codes form an important class of algebraic codes that inclu...

0 Cem Güneri, et al. ∙

research

∙ 05/27/2018

Minimum Distance of New Generalizations of the Punctured Binary Reed-Muller Codes

Motivated by applications in combinatorial design theory and constructin...

0 Liqin Hu, et al. ∙

research

∙ 12/11/2019

Distance Distributions of Cyclic Orbit Codes

The distance distribution of a code is the vector whose i^th entry is th...

0 Heide Gluesing-Luerssen, et al. ∙

research

∙ 05/28/2023

Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes

We present O(m^3) algorithms for specifying the support of minimum-weigh...

0 Amit Berman, et al. ∙

research

∙ 06/25/2019

On The Dimension of The Subfield Subcodes of 1-Point Hermitian Codes

Subfield subcodes of algebraic-geometric codes are good candidates for t...

0 Sabira El Khalfaoui, et al. ∙

research

∙ 06/12/2019

Spectral Bounds for Quasi-Twisted Codes

New lower bounds on the minimum distance of quasi-twisted codes over fin...

0 Martianus Frederic Ezerman, et al. ∙

research

∙ 12/18/2020

A Comparison of Distance Bounds for Quasi-Twisted Codes

Spectral bounds on the minimum distance of quasi-twisted codes over fini...

0 Martianus Frederic Ezerman, et al. ∙