On symbol-pair weight distribution of MDS codes and simplex codes over finite fields

Author(s):  
Junru Ma ◽  
Jinquan Luo
Author(s):  
J. Prabu ◽  
J. Mahalakshmi ◽  
C. Durairajan ◽  
S. Santhakumar

In this paper, we have constructed some new codes from [Formula: see text]-Simplex code called unit [Formula: see text]-Simplex code. In particular, we find the parameters of these codes and have proved that it is a [Formula: see text] [Formula: see text]-linear code, where [Formula: see text] and [Formula: see text] is a smallest prime divisor of [Formula: see text]. When rank [Formula: see text] and [Formula: see text] is a prime power, we have given the weight distribution of unit [Formula: see text]-Simplex code. For the rank [Formula: see text] we obtain the partial weight distribution of unit [Formula: see text]-Simplex code when [Formula: see text] is a prime power. Further, we derive the weight distribution of unit [Formula: see text]-Simplex code for the rank [Formula: see text] [Formula: see text].


2020 ◽  
Vol 59 (10) ◽  
pp. 3043-3078
Author(s):  
Hai Q. Dinh ◽  
Ramy Taki ElDin ◽  
Bac T. Nguyen ◽  
Roengchai Tansuchat

2015 ◽  
Vol 07 (03) ◽  
pp. 1550030
Author(s):  
C. Durairajan ◽  
J. Mahalakshmi ◽  
P. Chella Pandian

In this paper, we have defined ℤq-linear code and constructed some new codes. In particular, we have introduced the concept of ℤq-Simplex codes and proved that it is a [Formula: see text]-linear code for any integer q ≥ 2 and k ≥ 3 where p is the least order element in ℤq. We have given the weight distribution of ℤq-Simplex codes of dimension 2 when q is a prime power and when q is a product of distinct primes.


2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Can Xiang ◽  
Jinquan Luo

<p style='text-indent:20px;'>Subfield codes of linear codes over finite fields have recently received a lot of attention, as some of these codes are optimal and have applications in secrete sharing, authentication codes and association schemes. In this paper, a class of binary subfield codes is constructed from a special family of MDS codes, and their parameters are explicitly determined. The parameters of their dual codes are also studied. Some of the codes presented in this paper are optimal or almost optimal.</p>


2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Amita Sahni ◽  
Poonam Trama Sehgal

Necessary and sufficient conditions for the existence of Hermitian self-orthogonal constacyclic codes of length n over a finite field Fq2, n coprime to q, are found. The defining sets and corresponding generator polynomials of these codes are also characterised. A formula for the number of Hermitian self-orthogonal constacyclic codes of length n over a finite field Fq2 is obtained. Conditions for the existence of numerous MDS Hermitian self-orthogonal constacyclic codes are obtained. The defining set and the number of such MDS codes are also found.


COMBINATORICA ◽  
1990 ◽  
Vol 10 (1) ◽  
pp. 103-105 ◽  
Author(s):  
P. G. Bonneau

2013 ◽  
Vol 91 (5) ◽  
pp. 863-871
Author(s):  
Qunying Liao ◽  
Huan Liao
Keyword(s):  

2021 ◽  
pp. 4019-4031
Author(s):  
Emad Bakr Al-Zangana ◽  
Elaf Abdul Satar Shehab

The aim of the paper is to compute projective maximum distance separable codes, -MDS of two and three dimensions with certain lengths and Hamming weight distribution from the arcs in the projective line and plane over the finite field of order twenty-five. Also, the linear codes generated by an incidence matrix of points and lines of  were studied over different finite fields.  


2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Yan Liu ◽  
Xiwang Cao ◽  
Wei Lu

<p style='text-indent:20px;'>Due to their wide applications in consumer electronics, data storage systems and communication systems, cyclic codes have been an interesting subject of study in recent years. The construction of optimal cyclic codes over finite fields is important as they have maximal minimum distance once the length and dimension are given. In this paper, we present two classes of new optimal ternary cyclic codes <inline-formula><tex-math id="M1">\begin{document}$ \mathcal{C}_{(2,v)} $\end{document}</tex-math></inline-formula> by using monomials <inline-formula><tex-math id="M2">\begin{document}$ x^2 $\end{document}</tex-math></inline-formula> and <inline-formula><tex-math id="M3">\begin{document}$ x^v $\end{document}</tex-math></inline-formula> for some suitable <inline-formula><tex-math id="M4">\begin{document}$ v $\end{document}</tex-math></inline-formula> and explain the novelty of the codes. Furthermore, the weight distribution of <inline-formula><tex-math id="M5">\begin{document}$ \mathcal{C}_{(2,v)}^{\perp} $\end{document}</tex-math></inline-formula> for <inline-formula><tex-math id="M6">\begin{document}$ v = \frac{3^{m}-1}{2}+2(3^{k}+1) $\end{document}</tex-math></inline-formula> is determined.</p>


Sign in / Sign up

Export Citation Format

Share Document