WebRecently, some infinite families of optimal binary linear codes are constructed from simplicial complexes. Afterwards, the construction method was extended to using … WebOPTIMAL MINIMAL LINEAR CODES FROM POSETS JONG YOON HYUN, HYUN KWANG KIM, YANSHENG WU, AND QIN YUE Abstract. Recently, some infinite families of minimal and …

Optimal minimal Linear codes from posets Papers With Code

WebRecently, some infinite families of minimal and optimal binary linear codes were constructed from simplicial complexes by Hyun et al. We extend this construction method to arbitrary posets. Especially, anti-chains are corresponded to simplicial complexes. WebIn this paper, based on a generic construction of linear codes, we obtain four classes of optimal binary linear codes by using the posets of two chains. Two of them induce Griesmer codes which are not equivalent to the linear codes constructed by Belov. ... J. Y. Hyun, H. K. Kim, Y. Wu and Q. Yue, Optimal minimal linear codes from posets, Des ... newest and best foscam cameras

New classes of binary few weight codes from trace codes over

WebSep 3, 2024 · (2) We present some optimal binary linear codes (Corollary 1), and we find some necessary and sufficient conditions for the binary linear codes constructed from … WebA result in LFSR sequences is used to illustrate the relation of the weights of codewords in two special codes obtained from simplical complexes and then determin the parameters of these codes. In this article we mainly study linear codes over $\mathbb{F}_{2^n}$ and their binary subfield codes. We construct linear codes over $\mathbb{F}_{2^n}$ whose defining … Webbinary optimal linear codes. Index Terms—Optimal codes, posets, weight distribution, Griesmer codes. I. INTRODUCTION L ET F 2be the finite field with two elements and let Fn be a vector space over F2. A linear code C of length n over F2 is a subspace of Fn 2 of dimension k. If C has minimal Hamming distance d, then C is called an [n,k,d]-code newest and best android phone