A construction of two-weight codes and its applications
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
It is well-known that there exists a constant-weight $[s \theta_{k-1},k, $ $ sq^{k-1}]_q$ code for any positive integer $s$, which is an $s$-fold simplex code, where $\theta_{j}=(q^{j+1}-1)/(q-1)$. This gives an upper bound $n_q(k, s q^{k-1}+d) \le s \theta_{k-1} + n_q(k,d)$ for any positive integer $d$, where $n_q(k,d)$ is the minimum length $n$ for which an $[n,k,d]_q$ code exists. We construct a two-weight $[s \theta_{k-1}+1,k, s q^{k-1}]_q$ code for $1 \le s \le k-3$, which gives a better upper bound $n_q(k, s q^{k-1}+d) \le s \theta_{k-1} +1 + n_q(k-1,d)$ for $1 \le d \le q^s$. As another application, we prove that $n_q(5,d)=\sum_{i=0}^{4}{\left\lceil{{d}/{q^i}}\right\rceil}$ for $q^{4}+1 \le d \le q^4+q$ for any prime power $q$.
Abstract
It is well-known that there exists a constant-weight $[s \theta_{k-1},k, $ $ sq^{k-1}]_q$ code for any positive integer $s$, which is an $s$-fold simplex code, where $\theta_{j}=(q^{j+1}-1)/(q-1)$. This gives an upper bound $n_q(k, s q^{k-1}+d) \le s \theta_{k-1} + n_q(k,d)$ for any positive integer $d$, where $n_q(k,d)$ is the minimum length $n$ for which an $[n,k,d]_q$ code exists. We construct a two-weight $[s \theta_{k-1}+1,k, s q^{k-1}]_q$ code for $1 \le s \le k-3$, which gives a better upper bound $n_q(k, s q^{k-1}+d) \le s \theta_{k-1} +1 + n_q(k-1,d)$ for $1 \le d \le q^s$. As another application, we prove that $n_q(5,d)=\sum_{i=0}^{4}{\left\lceil{{d}/{q^i}}\right\rceil}$ for $q^{4}+1 \le d \le q^4+q$ for any prime power $q$.
참고문헌 (10)
- R. Calderbank, "The geometry of two-weight codes", Bull. London Math. Soc, 18(2), pp.97~122 (1986)
- J. H. Griesmer, "A bound for error-correcting codes", IBM J. Res. Develop, 4, pp.532~542 (1960)
- R. Hill, "Cryptography and coding, II", pp.75~104 (1992), Oxford Univ. Press
- R. Hill, "Combinatorial Designs and their Applications", pp.1999, Chapman Hall
- R. Hill, "Optimal ternary linear codes", Des. Codes Cryptogr, 2(2), pp.137~157 (1992)
- J. W. P. Hirschfeld, "Projective Geometries over Finite Fields" (1998), Clarendon Press
- Y. Kageyama, "On the construction of Griesmer codes of dimension 5", Des. Codes Cryptogr, 75(2), pp.277~280 (2016)
- F. J. MacWilliams, "The Theory of Error-Correcting Codes" (1977), North-Holland
- "Griesmer bound for linear codes over finite fields"[URL]
- G. Solomon, "Algebraically punctured cyclic codes", Inform. and Control, 8(2), pp.170~179 (1965)