RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2020 Volume 56, Issue 4, Pages 10–18 (Mi ppi2325)

This article is cited in 2 papers

Coding Theory

On bases of BCH codes with designed distance $3$ and their extensions

I. Yu. Mogilnykhabc, F. I. Solov'evaab

a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
c Regional Scientific and Educational Mathematical Center, Tomsk State University, Tomsk, Russia

Abstract: We consider narrow-sense BCH codes of length $p^m-1$ over ${{\mathbb{F}}}_{p}$, $m\geqslant3$. We prove that neither such a code with designed distance $\delta=3$ nor its extension for $p\geqslant5$ is generated by the set of its codewords of the minimum nonzero weight. We establish that extended BCH codes with designed distance $\delta=3$ for $p\geqslant3$ are generated by the set of codewords of weight $5$, where basis vectors can be chosen from affine orbits of some codewords.

Keywords: BCH code, cyclic code, affine-invariant code, minimum weight basis, single orbit affine generator.

UDC: 621.391 : 519.725

Received: 10.07.2020
Revised: 26.10.2020
Accepted: 27.10.2020

DOI: 10.31857/S0555292320040026


 English version:
Problems of Information Transmission, 2020, 56:4, 309–316

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025