ON THE CONSTRUCTION OF OPTIMAL LINEAR CODES OF DIMENSION FOUR
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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 $\bF_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 $\bF_q$ with $q=7,8$, which determine $n_7(4,d)$ for $31$ values of $d$ and $n_8(4,d)$ for $40$ values of $d$.
Abstract
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 $\bF_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 $\bF_q$ with $q=7,8$, which determine $n_7(4,d)$ for $31$ values of $d$ and $n_8(4,d)$ for $40$ values of $d$.
참고문헌 (29)
- "Table of bounds on three dimensional linear codes or (n, r)-arcs in PG(2, q)"[URL]
- B. I. Belov, "Construction of a class of linear binary codes that attain the Varsamov-Griesmer bound", Problemy Peredaci Informacii, 10(3), pp.36~44 (1974)
- J. Bierbrauer, "Introduction to Coding Theory" (2005), Chapman & Hall
- Nanami BONO, "On optimal linear codes of dimension 4", Journal of Algebra Combinatorics Discrete Structures and Applications, 8(2), pp.73~90 (2021), Journal of Algebra Combinatorics Discrete Structures and Applications[DOI]
- Iliya Bouyukliev, "On the minimum length of linear codes over ?5", Discrete Mathematics, 338(6), pp.938~953 (2015), Elsevier BV[DOI]
- A. E. Brouwer, "The correspondence between projective codes and 2-weight codes", Designs, Codes and Cryptography, 11(3), pp.261~266 (1997), Springer Science and Business Media LLC[DOI]
- E. J. Cheon, "On the upper bound of the minimum length of 5-dimensional linear codes", Australas. J. Combin, 37, pp.225~232 (2007)
- Bence Csajbók, "Double blocking sets of size 3q - 1 in PG(2, q)", European Journal of Combinatorics, 78, pp.73~89 (2019), Elsevier BV[DOI]
- S. M. Dodunekov, "Optimal linear codes", Doctor, pp.1985
- "Tables of linear codes and quantum codes"[URL]
- J. H. Griesmer, "A Bound for Error-Correcting Codes", IBM Journal of Research and Development, 4(5), pp.532~542 (1960), IBM[DOI]
- R. Hill, "Optimal linear codes, in Cryptography and coding, II (Cirencester, 1989), 75-104", Inst. Math. Appl. Conf. Ser. New Ser, 33 (1992), Oxford Univ. Press
- R. Hill, "A survey of recent results on optimal linear codes, in Combinatorial designs and their applications (Milton Keynes, 1997), 127-152", Chapman & Hall, 1999, pp.403, ~[DOI]
- J. W. P. Hirschfeld, "Oxford Mathematical Monographs" (1985), The Clarendon Press, Oxford University Press
- W. C. Huffman, "Fundamentals of Error-Correcting Codes" (2003), Cambridge Univ. Press
- Yuto Inoue, "Construction of new Griesmer codes of dimension 5", Finite Fields and Their Applications, 55, pp.231~237 (2019), Elsevier BV[DOI]
- Yuuki Kageyama, "On the geometric constructions of optimal linear codes", Designs, Codes and Cryptography, 81(3), pp.469~480 (2016), Springer Science and Business Media LLC[DOI]
- Kazuki Kumegawa, "Nonexistence of some Griesmer codes over Fq", Discrete Mathematics, 339(2), pp.515~521 (2016), Elsevier BV[DOI]
- Kazuki KUMEGAWA, "Non-existence of some 4-dimensional Griesmer codes over finite fields", Journal of Algebra Combinatorics Discrete Structures and Applications, 5(2), pp.101~116 (2018), Journal of Algebra Combinatorics Discrete Structures and Applications[DOI]
- Kazuki Kumegawa, "On the Minimum Length of Linear Codes over the Field of 9 Elements", The Electronic Journal of Combinatorics, 24(1) (2017), The Electronic Journal of Combinatorics[DOI]
- Ivan N. Landjev, "On the minimum length of quaternary linear codes of dimension five", Discrete Mathematics, 202(1-3), pp.145~161 (1999), Elsevier BV[DOI]
- Tatsuya Maruta, "On the minimum length of q-ary linear codes of dimension four", Discrete Mathematics, 208-209, pp.427~435 (1999), Elsevier BV[DOI]
- T. Maruta, "On the nonexistence of q-ary linear codes of dimension five", Des. Codes Cryptogr, 22, pp.165~177 (2001)
- T. Maruta, "Construction of optimal linear codes by geometric puncturing", Serdica J. Comput, 7(1), pp.73~80 (2013)
- "Griesmer bound for linear codes over finite fields"[URL]
- Yusuke Oya, "On optimal ternary linear codes of dimension 6", Advances in Mathematics of Communications, 5(3), pp.505~520 (2011), American Institute of Mathematical Sciences (AIMS)[DOI]
- Tatsuya Maruta, "Constructing linear codes from some orbits of projectivities", Discrete Mathematics, 308(5-6), pp.832~841 (2008), Elsevier BV[DOI]
- Mito Takenaka, "On optimal non-projective ternary linear codes", Discrete Mathematics, 308(5-6), pp.842~854 (2008), Elsevier BV[DOI]
- Harold N. Ward, "Divisibility of Codes Meeting the Griesmer Bound", Journal of Combinatorial Theory, Series A, 83(1), pp.79~93 (1998), Elsevier BV[DOI]
