2000 character limit reached
Binary optimal linear codes from posets of the disjoint union of two chains (1906.12017v1)
Published 28 Jun 2019 in cs.IT, math.CO, and math.IT
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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.