Embedding Linear Codes Into Self-Orthogonal Codes and Their Optimal Minimum Distances

DOI10.1109/TIT.2021.3066599MaRDI QIDQ5001751zbMATH OpenOpenAlexFDO

Authors Jon-Lark Kim, Young-Hun Kim, Nari Lee

Publication date 23 July 2021

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2002.01643

zbMATH Keywords

binary linear codeexplicit formulas for minimum distancesoptimal self-orthogonal codesself-orthogonality

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: 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 $mathcalC$ ($k=2,3,4$) into a self-orthogonal code of the shortest length which has the same dimension $k$ and minimum distance $d^{\prime }ged(mathcalC)$. 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 $notequiv6,13,14,21,22,28,29pmod31$ 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 $nequiv0,3,4,5,10,11,12pmod15$. Then, using MAGMA, we observe that our embedding sends an optimal linear code to an optimal self-orthogonal code.

Cited in

(11)

• Galois self-orthogonal constacyclic codes over finite fields
• Several classes of Galois self-orthogonal MDS codes and related applications
• On construction of ternary optimal self-orthogonal codes
• Construction of binary self-orthogonal codes
• Self-orthogonal cyclic codes with good parameters
• New ternary self-orthogonal codes and related LCD codes from weakly regular plateaued functions
• On general self-orthogonal matrix-product codes associated with Toeplitz matrices
• Binary self-orthogonal codes which meet the Griesmer bound or have optimal minimum distances
• Construction of linear codes with various Hermitian hull dimensions and related EAQECCs
• Expanding self-orthogonal codes over a ring \(\mathbb{Z}_4\) to self-dual codes and unimodular lattices
• A new construction of self-orthogonal cyclic codes

This page was built for publication: Embedding Linear Codes Into Self-Orthogonal Codes and Their Optimal Minimum Distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5001751)