Algorithms for computing parameters of graph-based extensions of BCH codes
Journal of Discrete Algorithms
An Algorithm for BCH Codes Extended with Finite State Automata
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
An Algorithm for BCH Codes Extended with Finite State Automata
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
| Hi-index | 754.84 |
Motivated by the paper of Calderbank, McGuire, Kumar, and Helleseth (see ibid., vol.42, no.1, p.217-26, Jan. 1996) we prove the following result: for any given positive integer l⩾3, the minimum Lee weights of Hensel lifts (to Z4) of binary primitive BCH codes of length 2m-1 and designed distance 2l-1 is just 2l-1 when (a) m can be divided by l or (b) m is sufficiently large. For Hensel lifts of binary primitive BCH codes of arbitrary designed distance δ⩾4, we also prove that their minimum Lee weight dL⩽2([log2δ]+1)-1 when m is sufficiently large. Moreover, a result about minimum Lee weights of certain Z4 codes defined by Galois rings, which is similar to the result in Calderbank et al., is proved