Abstract
Let C be the primitive ternary BCH code of length 3m - 1 with designed distance δ. It is shown that, when δ = 8, then the covering radius of C is 7 whenever m ≥ 20 and m is even, and when δ = 14, then the covering radius of C is 13 whenever m ≥ 46. The technique involves Galois-theoretic criteria on the splitting of polynomials over finite fields. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Franken, R., & Cohen, S. D. (2004). The covering radius of some primitive ternary BCH codes. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2948, 166–180. https://doi.org/10.1007/978-3-540-24633-6_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
