Optimal minimal linear codes from posets
Webfamilies of binary optimal and minimal linear codes via simplicial complexes. Then Wu, Hyun, and Yue [9] extended the construction of linear codes to posets. Inspired by their work, we focus on the construction of quaternary codes via the posets of the disjoint union of two chains in this short letter. Let n be a positive integer and L be a ... WebUpload an image to customize your repository’s social media preview. Images should be at least 640×320px (1280×640px for best display).
Optimal minimal linear codes from posets
Did you know?
WebAug 17, 2024 · Recently, some infinite families of minimal and optimal binary linear codes were constructed from simplicial complexes by Hyun et al. We extend this construction … WebMar 10, 2024 · Moreover, we present an infinite family of minimal quaternary linear codes, which also meet the Griesmer bound. ... Y. S. Wu, Q. Yue, Optimal minimal linear codes from posets, Des. Codes Cryptogr., 88 (2024), 2475-2492. doi: 10.1007/s10623-020-00793-0 [9] J. Y. Hyun, J. Lee, Y. Lee, Infinite families of optimal linear codes ...
WebAug 17, 2024 · Recently, some infinite families of minimal and optimal binary linear codes are constructed from simplicial complexes by Hyun et al. We extend this construction … 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 ...
WebJun 28, 2024 · Based on generic constructions of linear codes, Chang and Hyun constructed binary optimal and minimal linear codes via some simplicial complexes. The main idea of this letter is obtaining some binary optimal codes by employing posets of the disjoint union of two chains. Especially, anti-chains are corresponded to simplicial complexes. 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 …
Web11 rows · Sep 11, 2024 · In this paper, we focus on constructions of distance-optimal binary (minimal) linear codes ... dynamic seating systemWebDec 1, 2024 · Recently, some infinite families ofminimal and optimal binary linear codes were constructed from simplicial complexes by Hyun et al. We extend this construction … dynamic search box in excelWebpresent two constructions of binary linear codes from hierarchical posets of two levels. In particular, we determine the weight distributions of binary linear codes associated with … dynamic seating nxtWebRecently, some infinite families of optimal binary linear codes are constructed from simplicial complexes. Afterwards, the construction method was extended to using … dynamics eceWebRecently, 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 … crystlee hotmail.comWebAug 17, 2024 · In this paper, we present two constructions of binary linear codes from hierarchical posets of two levels. In particular, we determine the weight distributions of … dynamic seating wheelchairWebIn this paper, we present two constructions of binary linear codes from hierarchical posets of two levels. In particular, we determine the weight distributions of binary linear codes … dynamic security enabled printer