A class of narrow-sense BCH codes over F_q of length q^m-12

DOI10.1007/S10623-019-00691-0MaRDI QIDQ2291669zbMATH OpenOpenAlexFDO

Authors Xin Ling, Sihem Mesnager, Yanfeng Qi, Chun-Ming Tang

Publication date 31 January 2020

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1903.06779

association scheme BCH code linear code quadratic form the weight distribution

Association schemes, strongly regular graphs (05E30) Quadratic and bilinear forms, inner products (15A63) Linear codes (general theory) (94B05) Cyclic codes (94B15)

Abstract: BCH codes with efficient encoding and decoding algorithms have many applications in communications, cryptography and combinatorics design. This paper studies a class of linear codes of length

f r a c q^{m} - 1 2

over

m a t h b b F_{q}

with special trace representation, where

q

is an odd prime power. With the help of the inner distributions of some subsets of association schemes from bilinear forms associated with quadratic forms, we determine the weight enumerators of these codes. From determining some cyclotomic coset leaders

d e l t a_{i}

of cyclotomic cosets modulo

f r a c q^{m} - 1 2

, we prove that narrow-sense BCH codes of length

f r a c q^{m} - 1 2

with designed distance

d e l t a_{i} = f r a c q^{m} - q^{m - 1} 2 - 1 - f r a c q^{l f l o o r f r a c m - 3 2 f l o o r + i} - 1 2

have the corresponding trace representation, and have the minimal distance

d = d e l t a_{i}

and the Bose distance

d_{B} = d e l t a_{i}

, where

1 l e q i l e q l f l o o r f r a c m + 3 4 f l o o r

.

Recommendations

Cites work

Cited in

(19)

This page was built for publication: A class of narrow-sense BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m-1}{2} \)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2291669)