DeepAI AI Chat
Log In Sign Up

On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and their Consequences

by   Qi Liu, et al.
Michigan Technological University
Université Paris 8
NetEase, Inc
The Hong Kong University of Science and Technology

The Bose-Chaudhuri-Hocquenghem (BCH) codes are a well-studied subclass of cyclic codes that have found numerous applications in error correction and notably in quantum information processing. A subclass of attractive BCH codes is the narrow-sense BCH codes over the Galois field GF(q) with length q+1, which are closely related to the action of the projective general linear group of degree two on the projective line. This paper aims to study some of the codes within this class and specifically narrow-sense antiprimitive BCH codes (these codes are also linear complementary duals (LCD) codes that have interesting practical recent applications in cryptography, among other benefits). We shall use tools and combine arguments from algebraic coding theory, combinatorial designs, and group theory (group actions, representation theory of finite groups, etc.) to investigate narrow-sense antiprimitive BCH Codes and extend results from the recent literature. Notably, the dimension, the minimum distance of some q-ary BCH codes with length q+1, and their duals are determined in this paper. The dual codes of the narrow-sense antiprimitive BCH codes derived in this paper include almost MDS codes. Furthermore, the classification of PGL (2, p^m)-invariant codes over GF (p^h) is completed. As an application of this result, the p-ranks of all incidence structures invariant under the projective general linear group PGL (2, p^m) are determined. Furthermore, infinite families of narrow-sense BCH codes admitting a 3-transitive automorphism group are obtained. Via these BCH codes, a coding-theory approach to constructing the Witt spherical geometry designs is presented. The BCH codes proposed in this paper are good candidates for permutation decoding, as they have a relatively large group of automorphisms.


page 1

page 2

page 3

page 4


A Class of Narrow-Sense BCH Codes

BCH codes are an important class of cyclic codes which have applications...

Infinite families of linear codes supporting more t-designs

Tang and Ding [IEEE IT 67 (2021) 244-254] studied the class of narrow-se...

The Projective General Linear Group PGL_2(GF(2^m)) and Linear Codes of Length 2^m+1

The projective general linear group PGL_2(GF(2^m)) acts as a 3-transitiv...

Capacity-achieving codes: a review on double transitivity

Recently it was proved that if a linear code is invariant under the acti...

Infinite families of 3-designs from APN functions

Combinatorial t-designs have nice applications in coding theory, finite ...

A class of narrow-sense BCH codes over F_q of length q^m-1/2

BCH codes with efficient encoding and decoding algorithms have many appl...

Quantum Bicyclic Hyperbolic Codes

Bicyclic codes are a generalization of the one dimensional (1D) cyclic c...