scholarly journals New classes of few-weight ternary codes from simplicial complexes

2021 ◽  
Vol 7 (3) ◽  
pp. 4315-4325
Author(s):  
Yang Pan ◽  
◽  
Yan Liu ◽  
Keyword(s):  
Weight Distribution ◽  
Linear Codes ◽  
Minimum Weight ◽  
Simplicial Complexes ◽  
Mathematical Objects ◽  
First Order ◽  
Ternary Codes

<abstract><p>In this article, we describe two classes of few-weight ternary codes, compute their minimum weight and weight distribution from mathematical objects called simplicial complexes. One class of codes described here has the same parameters with the binary first-order Reed-Muller codes. A class of (optimal) minimal linear codes is also obtained in this correspondence.</p></abstract>

Linear codes from simplicial complexes

2017 ◽  
Vol 86 (10) ◽  
pp. 2167-2181 ◽  
Author(s):  
Seunghwan Chang ◽  
Jong Yoon Hyun
Keyword(s):  
Linear Codes ◽  
Simplicial Complexes

scholarly journals Projection Decoding of Some Binary Optimal Linear Codes of Lengths 36 and 40

Mathematics ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 15
Author(s):  
Lucky Galvez ◽  
Jon-Lark Kim
Keyword(s):  
Linear Codes ◽  
Cyclic Codes ◽  
Minimum Weight ◽  
Error Correcting Codes ◽  
Decoding Algorithm ◽  
Decoding Algorithms ◽  
Syndrome Decoding ◽  
Optimal Linear ◽  
Optimal Linear Codes ◽  
Efficient Decoding

Practically good error-correcting codes should have good parameters and efficient decoding algorithms. Some algebraically defined good codes, such as cyclic codes, Reed–Solomon codes, and Reed–Muller codes, have nice decoding algorithms. However, many optimal linear codes do not have an efficient decoding algorithm except for the general syndrome decoding which requires a lot of memory. Therefore, a natural question to ask is which optimal linear codes have an efficient decoding. We show that two binary optimal [ 36 , 19 , 8 ] linear codes and two binary optimal [ 40 , 22 , 8 ] codes have an efficient decoding algorithm. There was no known efficient decoding algorithm for the binary optimal [ 36 , 19 , 8 ] and [ 40 , 22 , 8 ] codes. We project them onto the much shorter length linear [ 9 , 5 , 4 ] and [ 10 , 6 , 4 ] codes over G F ( 4 ) , respectively. This decoding algorithm, called projection decoding, can correct errors of weight up to 3. These [ 36 , 19 , 8 ] and [ 40 , 22 , 8 ] codes respectively have more codewords than any optimal self-dual [ 36 , 18 , 8 ] and [ 40 , 20 , 8 ] codes for given length and minimum weight, implying that these codes are more practical.

New extremal Type II ℤ4-codes of length 32 obtained from Hadamard matrices

2019 ◽  
Vol 11 (05) ◽  
pp. 1950057
Author(s):  
Sara Ban ◽  
Dean Crnković ◽  
Matteo Mravić ◽  
Sanja Rukavina
Keyword(s):  
Incidence Matrix ◽  
Linear Codes ◽  
Minimum Weight ◽  
Hadamard Matrices ◽  
Binary Codes ◽  
Type Ii ◽  
Hadamard Design ◽  
Binary Linear Codes ◽  
Type Formula ◽  
Hadamard Designs

For every Hadamard design with parameters [Formula: see text]-[Formula: see text] having a skew-symmetric incidence matrix we give a construction of 54 Hadamard designs with parameters [Formula: see text]-[Formula: see text]. Moreover, for the case [Formula: see text] we construct doubly-even self-orthogonal binary linear codes from the corresponding Hadamard matrices of order 32. From these binary codes we construct five new extremal Type II [Formula: see text]-codes of length 32. The constructed codes are the first examples of extremal Type II [Formula: see text]-codes of length 32 and type [Formula: see text], [Formula: see text], whose residue codes have minimum weight 8. Further, correcting the results from the literature we construct 5147 extremal Type II [Formula: see text]-codes of length 32 and type [Formula: see text].

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.

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.

scholarly journals Sphere Constraint Based Enumeration Methods to Analyze the Minimum Weight Distribution of Polar Codes

2020 ◽  
Vol 69 (10) ◽  
pp. 11557-11569
Author(s):  
Jinnan Piao ◽  
Kai Niu ◽  
Jincheng Dai ◽  
Chao Dong
Keyword(s):  
Weight Distribution ◽  
Minimum Weight ◽  
Polar Codes
Sign in / Sign up

Export Citation Format

Share Document