Binary linear complementary dual codes
نویسندگان
چکیده
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 ≤ k ≤ n ≤ 16.
منابع مشابه
On the classification of linear complementary dual codes
We give a complete classification of binary linear complementary dual codes of lengths up to 13 and ternary linear complementary dual codes of lengths up to 10.
متن کاملClassification of the extremal formally self-dual even codes of length 30
Throughout this paper all codes are assumed to be binary. A linear code C is formally self-dual (fsd) if C and its dual C have the same weight enumerator. While self-dual codes contain only even weight vectors, formally self-dual codes may contain odd weight codewords as well. Many authors consider only even formally self-dual codes because their weight enumerators are combinations of Gleason p...
متن کاملQuasi-Cyclic Codes from Cyclic-Structured Designs with Good Properties
Quasi-cyclic Codes from Cyclic-Structured Designs with Good Properties Dimitris E. Simos and Christos Koukouvinos Department of Mathematics National Technical University of Athens Zografou 15773, Athens, Greece {dsimos,ckoukouv}@math.ntua.gr Quasi-cyclic (QC) codes form an important class of linear codes, which contains the well-known class of cyclic codes. A linear code with a complementary du...
متن کاملLinear codes with complementary duals related to the complement of the Higman-Sims graph
In this paper we study codes $C_p(overline{{rm HiS}})$ where $p =3,7, 11$ defined by the 3- 7- and 11-modular representations of the simple sporadic group ${rm HS}$ of Higman and Sims of degree 100. With exception of $p=11$ the codes are those defined by the row span of the adjacency matrix of the complement of the Higman-Sims graph over $GF(3)$ and $GF(7).$ We show that these codes ha...
متن کاملThe combinatorics of LCD codes: linear programming bound and orthogonal matrices
Linear Complementary Dual codes (LCD) are binary linear codes that meet their dual trivially. We construct LCD codes using orthogonal matrices, self-dual codes, combinatorial designs and Gray map from codes over the family of rings Rk. We give a linear programming bound on the largest size of an LCD code of given length and minimum distance. We make a table of lower bounds for this combinatoria...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1802.06985 شماره
صفحات -
تاریخ انتشار 2018