• Bulletin of the Korean Mathematical Society
• /
• v.60 no.5
• /
• pp.1237-1252
• /
• 2023

A fundamental problem in coding theory is to find n_q(k, d), the minimum length n for which an [n, k, d]_q code exists. We show that some q-divisible optimal linear codes of dimension 4 over 𝔽_q, which are not of Belov type, can be constructed geometrically using hyperbolic quadrics in PG(3, q). We also construct some new linear codes over 𝔽_q with q = 7, 8, which determine n₇(4, d) for 31 values of d and n₈(4, d) for 40 values of d.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.2
• /
• pp.156-163
• /
• 2013

The use of an error-correcting code is essential in communication systems where the channel is noisy. When channel coding parameters are unknown at a receiver side, decoding becomes difficult. To perform decoding without the channel coding information, we should estimate the parameters. In this paper, we introduce a method to reconstruct the generator polynomial of BCH(Bose-Chaudhuri-Hocquenghem) codes based on the idea that the generator polynomial is compose of minimal polynomials and BCH code is cyclic code. We present a probability compensation method to improve the reconstruction performance. This is based on the concept that a random data pattern can also be divisible by a minimal polynomial of the generator polynomial. And we confirm the performance improvement through an intensive computer simulation.