Long binary narrow-sense BCH codes are normal
type: Item
instance of: scholarly article
title: Long binary narrow-sense BCH codes are normal
zbMATH Open document ID: 0870.94045
author: Yrjö Kaipainen
author: Aimo Tietäväinen
author: Iiro Honkala
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 1997-08-03T00:00:00Z
review text: The covering radius of a binary code \(C\) of length \(n\) is the smallest integer \(R\) such that the union of the spheres of radius \(R\) around the codewords covers the whole space \(F_2^n\). Let \(C_a^{(i)}\) denote the set of codewords of \(C\) whose \(i\)th component equals \(a\), \(a=0,1\). The code \(C\) is normal if for some \(i\), \(d(x,D_0^{(i)})+d(x,C_1^{(i)})\leq2R+1\) for all \(x\in F_2^n\) where \(d(x,y)\) denotes the Hamming distance between \(x,y\in F_2^n\). Let \(C\) be a binary narrow-sense BCH code of designed distance \(2t+1\) and length \(n=(2^m-1)/h\) where \(m\) is the order of 2 modulo \(m\). The authors show that this code is normal in the case \(h>1\) if \(2^m\geq4(2th)^{4t+2}\) and in the case \(h=1\) if \(m\geq m_0\), where \(m_0\) only depends on \(t\). The proofs are based upon results on character sums over finite fields.
Mathematics Subject Classification ID: 94B27
Mathematics Subject Classification ID: 94B75
Mathematics Subject Classification ID: 11T24
zbMATH DE Number: 978148
zbMATH Keywords: covering radius
zbMATH Keywords: BCH code
zbMATH Keywords: character sums
reviewed by: Tor Helleseth
MaRDI profile type: Publication
full work available at URL: s002000050052
OpenAlex ID: W3157366187
Wikidata QID: Q112879320
cites work: Covering bounds for codes
cites work: Covering machines
cites work: Further results on the covering radius of codes
cites work: La conjecture de Weil. I
cites work: On the covering radius of codes
cites work: On the covering radius of cyclic linear codes and arithmetic codes
cites work: Lower bounds for binary covering codes
cites work: Modified bounds for covering codes
cites work: On \((p,1)\)-subnormal \(q\)-ary covering codes
cites work: Q4242020
cites work: Number of Points of Varieties in Finite Fields
cites work: Q4146667
cites work: Equations over finite fields. An elementary approach
cites work: Q3137899
cites work: On the covering radius of long binary BCH codes
cites work: An asymptotic bound on the covering radii of binary BCH codes
cites work: Covering radius for long BCH codes
cites work: On Some Exponential Sums
DOI: 10.1007/S002000050052
description: scientific article; zbMATH DE number 978148