z-logo
open-access-imgOpen Access
On BCH split metacyclic codes
Author(s) -
Angelot Behajaina
Publication year - 2023
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2021045
Subject(s) - bch code , mathematics , dimension (graph theory) , discrete mathematics , combinatorics , dihedral group , group (periodic table) , algorithm , decoding methods , chemistry , organic chemistry
Recently, Borello and Jamous have investigated some lower bounds on the dimension and minimum distance for dihedral codes, in analogy with the theory of BCH codes. In this paper, we extend some of their results to split metacyclic codes, that is, codes over semidirect products of cyclic groups.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here