Embedding linear codes into self-orthogonal codes and their optimal minimum distances

02/05/2020
by   Jon-Lark Kim, et al.
0

We obtain a characterization on self-orthogonality for a given binary linear code in terms of the number of column vectors in its generator matrix, which extends the result of Bouyukliev et al. (2006). As an application, we give an algorithmic method to embed a given binary k-dimensional linear code C (k = 2,3,4) into a self-orthogonal code of the shortest length which has the same dimension k and minimum distance d' > d(C). For k > 4, we suggest a recursive method to embed a k-dimensional linear code to a self-orthogonal code. We also give new explicit formulas for the minimum distances of optimal self-orthogonal codes for any length n with dimension 4 and any length n ≢6,13,14,21,22,28,29 31 with dimension 5. We determine the exact optimal minimum distances of [n,4] self-orthogonal codes which were left open by Li-Xu-Zhao (2008) when n ≡ 0,3,4,5,10,11,12 15. Then, using MAGMA, we observe that our embedding sends an optimal linear code to an optimal self-orthogonal code.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/24/2021

Self-orthogonality matrix and Reed-Muller code

Kim et al. (2021) gave a method to embed a given binary [n,k] code 𝒞 (k ...
03/17/2020

Binary LCD Codes and Self-orthogonal Codes via Simplicial Complexes

Due to some practical applications, linear complementary dual (LCD) code...
06/18/2021

Determining when a truncated generalised Reed-Solomon code is Hermitian self-orthogonal

We prove that there is a Hermitian self-orthogonal k-dimensional truncat...
06/06/2019

The [46,9,20]_2 code is unique

The minimum distance of all binary linear codes with dimension at most e...
08/18/2021

The geometry of Hermitian self-orthogonal codes

We prove that if n >k^2 then a k-dimensional linear code of length n ove...
05/17/2021

Construction and enumeration of left dihedral codes satisfying certain duality properties

Let 𝔽_q be the finite field of q elements and let D_2n=⟨ x,y| x^n=1, y^2...
03/03/2021

A Study of the Separating Property in Reed-Solomon Codes by Bounding the Minimum Distance

According to their strength, the tracing properties of a code can be cat...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.