scholarly journals Weight Distribution of Periodic Errors and Optimal/Anti-Optimal Linear Codes

2014 ◽  
Vol 2014 ◽  
pp. 1-5
Author(s):  
Pankaj Kumar Das
Keyword(s):  
Weight Distribution ◽  
Linear Codes ◽  
Parity Check ◽  
Optimal Linear ◽  
Optimal Linear Codes

The paper discusses weight distribution of periodic errors and then the optimal case on bounds of parity check digits for (n=n1+n2,k) linear codes overGF(q)that corrects all periodic errors of orderrin the first block of lengthn1and all periodic errors of ordersin the second block of lengthn2and no others. Further, we extend the study to the case when the errors are in the form of periodic errors of orderr(ands) or more in the two subblocks.

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.

scholarly journals On optimal linear codes over F5

2009 ◽  
Vol 309 (6) ◽  
pp. 1255-1272 ◽  
Author(s):  
Tatsuya Maruta ◽  
Maori Shinohara ◽  
Ayako Kikui
Keyword(s):  
Linear Codes ◽  
Optimal Linear ◽  
Optimal Linear Codes

Triple Cyclic Codes Over 𝔽q + u𝔽q

2021 ◽  
pp. 1-21
Author(s):  
Ting Yao ◽  
Shixin Zhu ◽  
Binbin Pang
Keyword(s):  
Special Class ◽  
Linear Codes ◽  
Cyclic Code ◽  
Cyclic Codes ◽  
Cyclic Shift ◽  
Generating Sets ◽  
Optimal Linear ◽  
Number Formula ◽  
The Relationship ◽  
Optimal Linear Codes

Let [Formula: see text], where [Formula: see text] is a power of a prime number [Formula: see text] and [Formula: see text]. A triple cyclic code of length [Formula: see text] over [Formula: see text] is a set that can be partitioned into three parts that any cyclic shift of the coordinates of the three parts leaves the code invariant. These codes can be viewed as [Formula: see text]-submodules of [Formula: see text]. In this paper, we study the generator polynomials and the minimum generating sets of this kind of codes. Some optimal or almost optimal linear codes are obtained from this family of codes. We present the relationship between the generators of triple cyclic codes and their duals. As a special class of triple cyclic codes, separable codes over [Formula: see text] are discussed briefly in the end.

Optimal Linear Codes From Matrix Groups

2005 ◽  
Vol 51 (12) ◽  
pp. 4247-4251 ◽  
Author(s):  
M. Braun ◽  
A. Kohnert ◽  
A. Wassermann
Keyword(s):  
Linear Codes ◽  
Matrix Groups ◽  
Optimal Linear ◽  
Optimal Linear Codes
Sign in / Sign up

Export Citation Format

Share Document