Binary optimal linear codes from posets of the disjoint union of two chains
Abstract
Recently, Chang and Hyun obtained some classes of binary optimal codes via simplicial complexes. In this letter, we utilize posets of the disjoint union of two chains to construct binary optimal linear codes.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.