scholarly journals Characteristic vector and weight distribution of a linear code

2020 ◽  
Author(s):  
Iliya Bouyukliev ◽  
Stefka Bouyuklieva ◽  
Tatsuya Maruta ◽  
Paskal Piperkov
Keyword(s):  
Weight Distribution ◽  
Linear Code ◽  
Characteristic Vector

On some punctured codes of ℤq-Simplex codes

2021 ◽  
pp. 2250012
Author(s):  
J. Prabu ◽  
J. Mahalakshmi ◽  
C. Durairajan ◽  
S. Santhakumar
Keyword(s):  
Prime Divisor ◽  
Weight Distribution ◽  
Linear Code ◽  
Prime Power ◽  
Punctured Codes ◽  
New Codes ◽  
Simplex Codes ◽  
Simplex Code ◽  
Partial Weight ◽  
Unit Formula

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].

On the ℤq-Simplex codes and its weight distribution for dimension 2

2015 ◽  
Vol 07 (03) ◽  
pp. 1550030
Author(s):  
C. Durairajan ◽  
J. Mahalakshmi ◽  
P. Chella Pandian
Keyword(s):  
Weight Distribution ◽  
Linear Code ◽  
Prime Power ◽  
Dimension 2 ◽  
New Codes ◽  
Simplex Codes ◽  
Order Element

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.

scholarly journals Weight Distribution of Some Codewords of 3-ary Linear Code over GF(27)‎

2020 ◽  
Vol 31 (4) ◽  
pp. 101
Author(s):  
Maha Majeed Ibrahim ◽  
Emad Bakr Al-Zangana
Keyword(s):  
Weight Distribution ◽  
Linear Code ◽  
Linear Codes ◽  
Generator Matrix ◽  
Weight Distributions

This paper is devoted to introduce the structure of the p-ary linear codes C(n,q) of points and lines of PG(n,q),q=p^h prime. When p=3, the linear code C(2,27) is given with its generator matrix and also, some of weight distributions are calculated.

NOTE ON SUPPORT WEIGHT DISTRIBUTION OF LINEAR CODES OVER

2015 ◽  
Vol 91 (2) ◽  
pp. 345-350 ◽  
Author(s):  
JIAN GAO
Keyword(s):  
Weight Distribution ◽  
Linear Code ◽  
Linear Codes ◽  
Dual Code ◽  
Support Weight

AbstractLet $R=\mathbb{F}_{p}+u\mathbb{F}_{p}$, where $u^{2}=u$. A relation between the support weight distribution of a linear code $\mathscr{C}$ of type $p^{2k}$ over $R$ and its dual code $\mathscr{C}^{\bot }$ is established.

scholarly journals Computing coset leaders and leader codewords of binary codes

2015 ◽  
Vol 14 (08) ◽  
pp. 1550128 ◽  
Author(s):  
M. Borges-Quintana ◽  
M. A. Borges-Trenard ◽  
I. Márquez-Corbella ◽  
E. Martínez-Moro
Keyword(s):  
Weight Distribution ◽  
Linear Code ◽  
Covering Radius ◽  
Efficient Algorithms ◽  
Binary Codes ◽  
Decoding Algorithm ◽  
Test Set ◽  
Binary Linear Code

In this paper we use the Gröbner representation of a binary linear code [Formula: see text] to give efficient algorithms for computing the whole set of coset leaders, denoted by [Formula: see text] and the set of leader codewords, denoted by [Formula: see text]. The first algorithm could be adapted to provide not only the Newton and the covering radius of [Formula: see text] but also to determine the coset leader weight distribution. Moreover, providing the set of leader codewords we have a test-set for decoding by a gradient-like decoding algorithm. Another contribution of this article is the relation established between zero neighbors and leader codewords.

ON THE SUPPORT WEIGHT DISTRIBUTION OF LINEAR CODES OVER THE RING

2016 ◽  
Vol 95 (1) ◽  
pp. 157-163 ◽  
Author(s):  
MINJIA SHI ◽  
JIAQI FENG ◽  
JIAN GAO ◽  
ADEL ALAHMADI ◽  
PATRICK SOLÉ
Keyword(s):  
Weight Distribution ◽  
Linear Code ◽  
Linear Codes ◽  
Dual Code ◽  
Support Weight

Let $R=\mathbb{F}_{p}+u\mathbb{F}_{p}+u^{2}\mathbb{F}_{p}+\cdots +u^{d-1}\mathbb{F}_{p}$, where $u^{d}=u$ and $p$ is a prime with $d-1$ dividing $p-1$. A relation between the support weight distribution of a linear code $\mathscr{C}$ of type $p^{dk}$ over $R$ and the dual code $\mathscr{C}^{\bot }$ is established.

scholarly journals DUAL CODE AND MACWILLIAMS IDENTITY ON ADDITIVE CODE

2019 ◽  
Vol 1 (1) ◽  
Author(s):  
Miftah Yuliati ◽  
Sri Wahyuni ◽  
Indah Emilia Wijayanti
Keyword(s):  
Weight Distribution ◽  
Linear Code ◽  
Hamming Distance ◽  
Finite Abelian Group ◽  
Dual Code ◽  
Inner Product ◽  
Dual Codes ◽  
Macwilliams Identity ◽  
Homogeneous Weight ◽  
Distance Hamming

Additive code is a generalization of linear code. It is defined as subgroup of a finite Abelian group. The definitions of Hamming distance, Hamming weight, weight distribution, and homogeneous weight distribution in additive code are similar with the definitions in linear code. Different with linear code where the dual code is defined using inner product, additive code using theories in group to define its dual code because in group theory we do not have term of inner product. So, by this thesis, the definitions of dual code in additive code will be discussed. Then, this thesis discuss about a familiar theorem in dual code theory, that is MacWilliams Identity. Next, this thesis discuss about how to proof of MacWilliams Identity on adiitive code using dual codes which are defined.

Sign in / Sign up

Export Citation Format

Share Document