Binary linear complementary dual codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

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 ...

متن کامل

On linear complementary-dual multinegacirculant codes

Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivially. Multinegacirculant codes of index 2 that are LCD are characterized algebraically and some good codes are found in this family. Exact enumeration is performed for indices 2 and 3, and for all indices t for a special case of the co-index by using their concatenated structure. Asymptotic existenc...

متن کامل

Complementary Dual Subfield Linear Codes Over Finite Fields

Two families of complementary codes over finite fields q are studied, where 2 = q r is square: i) Hermitian complementary dual linear codes, and ii) trace Hermitian complementary dual subfield linear codes. Necessary and sufficient conditions for a linear code (resp., a subfield linear code) to be Hermitian complementary dual (resp., trace Hermitian complementary dual) are determined. Construct...

متن کامل

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.

متن کامل

Formally self-dual linear binary codes from circulant graphs

In 2002, Tonchev first constructed some linear binary codes defined by the adjacency matrices of undirected graphs. So graph is an important tool for searching optimum code. In this paper, we introduce a new method of searching (proposed) optimum formally self-dual linear binary codes from circulant graphs. AMS Subject Classification 2010: 94B05, 05C50, 05C25.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cryptography and Communications

سال: 2018

ISSN: 1936-2447,1936-2455

DOI: 10.1007/s12095-018-0319-0