منابع مشابه
A Note on Weight Enumerators of Linear Self-dual Codes
A partial description of (complete) weight enumerators of linear self-dual codes is given. 0. Let F = Z/pZ, where p is a prime number. If C is a linear code on F of length n, i.e., a linear subspace in Fn, then its (complete) weight enumerator WC is defined to be
متن کاملOn self-dual MRD codes
We determine the automorphism group of Gabidulin codes of full length and characterise when these codes are equivalent to self-dual codes.
متن کاملOn involutions in extremal self-dual codes and the dual distance of semi self-dual codes
A classical result of Conway and Pless is that a natural projection of the xed code of an automorphism of odd prime order of a self-dual binary linear code is self-dual [13]. In this paper we prove that the same holds for involutions under some (quite strong) conditions on the codes. In order to prove it, we introduce a new family of binary codes: the semi self-dual codes. A binary self-orthogo...
متن کامل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.
متن کاملLinear programming bounds for doubly-even self-dual codes
We give a new proof of the Mallows-Sloane bound on the minimum distance of doubly-even self-dual codes. The proof avoids using the Gleason theorem and invariant theory. It is based on a special choice of the polynomial in the conventional linear programming approach.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Sciences and Applications E-Notes
سال: 2017
ISSN: 2147-6268
DOI: 10.36753/mathenot.421738