2000 character limit reached
Binary linear complementary dual codes
Published 20 Feb 2018 in math.CO, cs.IT, and math.IT | (1802.06985v4)
Abstract: Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual $[n,k]$ codes with the largest minimum weight among all binary linear complementary dual $[n,k]$ codes. We characterize binary linear complementary dual codes with the largest minimum weight for small dimensions. A complete classification of binary linear complementary dual $[n,k]$ codes with the largest minimum weight is also given for $1 \le k \le n \le 16$.
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.