The minimal covering radius t(15,6) of a six-dimensional binary linear code of length 15 is equal to 4

1988 ◽  
Vol 34 (5) ◽  
pp. 1344-1345 ◽  
Author(s):  
J. Simonis
Keyword(s):  
Linear Code ◽  
Covering Radius ◽  
Minimal Covering ◽  
Binary Linear Code

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.

Representations of Code Vertex Operator Superalgebras

2015 ◽  
Vol 22 (02) ◽  
pp. 233-250
Author(s):  
Wei Jiang
Keyword(s):  
Vertex Operator ◽  
Linear Code ◽  
Central Charge ◽  
Hamming Code ◽  
Binary Linear Code ◽  
Vertex Operator Superalgebra

We study the representations of code vertex operator superalgebras resulting from a binary linear code which contains codewords of odd weight. We also show that there exists only one set of seven mutually orthogonal conformal vectors with central charge 1/2 in the Hamming code vertex operator superalgebra [Formula: see text]. Furthermore, we classify all the irreducible weak [Formula: see text]-modules.

scholarly journals Upper bounds on the length function for covering codes with covering radius $ R $ and codimension $ tR+1 $

2022 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Alexander A. Davydov ◽  
Stefano Marcugini ◽  
Fernanda Pambianco
Keyword(s):  
Projective Space ◽  
Linear Code ◽  
Prime Power ◽  
Upper Bounds ◽  
Covering Radius ◽  
Length Function ◽  
Covering Codes ◽  
New Construction ◽  
One To One ◽  
Better Than

<p style='text-indent:20px;'>The length function <inline-formula><tex-math id="M3">\begin{document}$ \ell_q(r,R) $\end{document}</tex-math></inline-formula> is the smallest length of a <inline-formula><tex-math id="M4">\begin{document}$ q $\end{document}</tex-math></inline-formula>-ary linear code with codimension (redundancy) <inline-formula><tex-math id="M5">\begin{document}$ r $\end{document}</tex-math></inline-formula> and covering radius <inline-formula><tex-math id="M6">\begin{document}$ R $\end{document}</tex-math></inline-formula>. In this work, new upper bounds on <inline-formula><tex-math id="M7">\begin{document}$ \ell_q(tR+1,R) $\end{document}</tex-math></inline-formula> are obtained in the following forms:</p><p style='text-indent:20px;'><disp-formula> <label/> <tex-math id="FE1"> \begin{document}$ \begin{equation*} \begin{split} &amp;(a)\; \ell_q(r,R)\le cq^{(r-R)/R}\cdot\sqrt[R]{\ln q},\; R\ge3,\; r = tR+1,\; t\ge1,\\ &amp;\phantom{(a)\; } q\;{\rm{ is \;an\; arbitrary \;prime\; power}},\; c{\rm{ \;is\; independent \;of\; }}q. \end{split} \end{equation*} $\end{document} </tex-math></disp-formula></p><p style='text-indent:20px;'><disp-formula> <label/> <tex-math id="FE2"> \begin{document}$ \begin{equation*} \begin{split} &amp;(b)\; \ell_q(r,R)&lt; 3.43Rq^{(r-R)/R}\cdot\sqrt[R]{\ln q},\; R\ge3,\; r = tR+1,\; t\ge1,\\ &amp;\phantom{(b)\; } q\;{\rm{ is \;an\; arbitrary\; prime \;power}},\; q\;{\rm{ is \;large\; enough}}. \end{split} \end{equation*} $\end{document} </tex-math></disp-formula></p><p style='text-indent:20px;'>In the literature, for <inline-formula><tex-math id="M8">\begin{document}$ q = (q')^R $\end{document}</tex-math></inline-formula> with <inline-formula><tex-math id="M9">\begin{document}$ q' $\end{document}</tex-math></inline-formula> a prime power, smaller upper bounds are known; however, when <inline-formula><tex-math id="M10">\begin{document}$ q $\end{document}</tex-math></inline-formula> is an arbitrary prime power, the bounds of this paper are better than the known ones.</p><p style='text-indent:20px;'>For <inline-formula><tex-math id="M11">\begin{document}$ t = 1 $\end{document}</tex-math></inline-formula>, we use a one-to-one correspondence between <inline-formula><tex-math id="M12">\begin{document}$ [n,n-(R+1)]_qR $\end{document}</tex-math></inline-formula> codes and <inline-formula><tex-math id="M13">\begin{document}$ (R-1) $\end{document}</tex-math></inline-formula>-saturating <inline-formula><tex-math id="M14">\begin{document}$ n $\end{document}</tex-math></inline-formula>-sets in the projective space <inline-formula><tex-math id="M15">\begin{document}$ \mathrm{PG}(R,q) $\end{document}</tex-math></inline-formula>. A new construction of such saturating sets providing sets of small size is proposed. Then the <inline-formula><tex-math id="M16">\begin{document}$ [n,n-(R+1)]_qR $\end{document}</tex-math></inline-formula> codes, obtained by geometrical methods, are taken as the starting ones in the lift-constructions (so-called "<inline-formula><tex-math id="M17">\begin{document}$ q^m $\end{document}</tex-math></inline-formula>-concatenating constructions") for covering codes to obtain infinite families of codes with growing codimension <inline-formula><tex-math id="M18">\begin{document}$ r = tR+1 $\end{document}</tex-math></inline-formula>, <inline-formula><tex-math id="M19">\begin{document}$ t\ge1 $\end{document}</tex-math></inline-formula>.</p>

scholarly journals Construction of strongly optimal binary linear code with sets representation

2021 ◽  
Author(s):  
Putranto Hadi Utomo ◽  
Sugi Guritman ◽  
Teduh Wulandari Mas’oed ◽  
Hadi Sumarno
Keyword(s):  
Linear Code ◽  
Binary Linear Code
Sign in / Sign up

Export Citation Format

Share Document