scholarly journals Certain Types of Linear Codes over the Finite Field of Order Twenty-Five

2021 ◽  
pp. 4019-4031
Author(s):  
Emad Bakr Al-Zangana ◽  
Elaf Abdul Satar Shehab
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Weight Distribution ◽  
Incidence Matrix ◽  
Linear Codes ◽  
Projective Line ◽  
Three Dimensions ◽  
Hamming Weight ◽  
Maximum Distance Separable ◽  
Maximum Distance Separable Codes

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.  

scholarly journals Enumeration of self-dual cyclic codes of some specific lengths over finite fields

2018 ◽  
Vol 10 (03) ◽  
pp. 1850031 ◽  
Author(s):  
Supawadee Prugsapitak ◽  
Somphong Jitman
Keyword(s):  
Characteristic Function ◽  
Finite Field ◽  
Finite Fields ◽  
Linear Codes ◽  
Cyclic Code ◽  
Cyclic Codes ◽  
Efficient Algorithms ◽  
Important Class ◽  
Field Characteristic ◽  
Positive Integers

Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length [Formula: see text] over a finite field if and only if [Formula: see text] and the field characteristic are even. The enumeration of such codes has been given under both the Euclidean and Hermitian products. However, in each case, the formula for self-dual cyclic codes of length [Formula: see text] over a finite field contains a characteristic function which is not easily computed. In this paper, we focus on more efficient ways to enumerate self-dual cyclic codes of lengths [Formula: see text] and [Formula: see text], where [Formula: see text], [Formula: see text], and [Formula: see text] are positive integers. Some number theoretical tools are established. Based on these results, alternative formulas and efficient algorithms to determine the number of self-dual cyclic codes of such lengths are provided.

scholarly journals Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions

2021 ◽  
pp. 1-15
Author(s):  
Rong Wang ◽  
Xiaoni Du ◽  
Cuiling Fan ◽  
Zhihua Niu
Keyword(s):  
Finite Field ◽  
Weight Distribution ◽  
Coding Theory ◽  
Exponential Sums ◽  
Linear Codes ◽  
Cyclic Codes ◽  
Research Interest ◽  
Combinatorial Formula ◽  
Text Design ◽  
Fixed Weight

Due to their important applications to coding theory, cryptography, communications and statistics, combinatorial [Formula: see text]-designs have attracted lots of research interest for decades. The interplay between coding theory and [Formula: see text]-designs started many years ago. It is generally known that [Formula: see text]-designs can be used to derive linear codes over any finite field, and that the supports of all codewords with a fixed weight in a code also may hold a [Formula: see text]-design. In this paper, we first construct a class of linear codes from cyclic codes related to Dembowski-Ostrom functions. By using exponential sums, we then determine the weight distribution of the linear codes. Finally, we obtain infinite families of [Formula: see text]-designs from the supports of all codewords with a fixed weight in these codes. Furthermore, the parameters of [Formula: see text]-designs are calculated explicitly.

New LCD MDS codes constructed from generalized Reed–Solomon codes

2019 ◽  
Vol 18 (08) ◽  
pp. 1950150 ◽  
Author(s):  
Xueying Shi ◽  
Qin Yue ◽  
Shudi Yang
Keyword(s):  
Finite Field ◽  
Coding Theory ◽  
Theory And Practice ◽  
Maximum Distance ◽  
Mds Codes ◽  
Reed Solomon Codes ◽  
Maximum Distance Separable ◽  
Maximum Distance Separable Codes ◽  
Invertible Matrices

Maximum distance separable codes with complementary duals (LCD MDS codes) are very important in coding theory and practice, and have attracted a lot of attention. In this paper, we focus on LCD MDS codes constructed from generalized Reed–Solomon (GRS) codes over a finite field with odd characteristic. We detail two constructions of new LCD MDS codes, using invertible matrices and the roots of three classes of polynomials, respectively.

Maximum Distance Separable Hankel Rhotrices over Finite Fields

2018 ◽  
Vol 43 (1-4) ◽  
pp. 13-45
Author(s):  
Prof. P. L. Sharma ◽  
◽  
Mr. Arun Kumar ◽  
Mrs. Shalini Gupta ◽  
◽  
...  
Keyword(s):  
Finite Fields ◽  
Maximum Distance ◽  
Maximum Distance Separable

Hamming weight distributions of multi-twisted codes over finite fields

2021 ◽  
Author(s):  
Varsha Chauhan ◽  
Anuradha Sharma ◽  
Sandeep Sharma ◽  
Monika Yadav
Keyword(s):  
Finite Fields ◽  
Hamming Weight ◽  
Weight Distributions

scholarly journals Shortened Linear Codes over Finite Fields

2021 ◽  
pp. 1-1
Author(s):  
Yang Liu ◽  
Cunsheng Ding ◽  
Chunming Tang
Keyword(s):  
Finite Fields ◽  
Linear Codes

Maximal Sets of Pairwise Orthogonal Vectors in Finite Fields

2012 ◽  
Vol 55 (2) ◽  
pp. 418-423 ◽  
Author(s):  
Le Anh Vinh
Keyword(s):  
Positive Integer ◽  
Finite Field ◽  
Finite Fields ◽  
Bilinear Form ◽  
Symmetric Bilinear Form

AbstractGiven a positive integern, a finite fieldofqelements (qodd), and a non-degenerate symmetric bilinear formBon, we determine the largest possible cardinality of pairwiseB-orthogonal subsets, that is, for any two vectorsx,y∈ Ε, one hasB(x,y) = 0.

Sign in / Sign up

Export Citation Format

Share Document