On linear equivalence and Phelps codes. Addendum

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

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

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

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

منابع مشابه

SQS-graphs of Solov'eva-Phelps codes

A binary extended 1-perfect code C folds over its kernel via the Steiner quadruple systems associated with its codewords. The resulting folding, proposed as a graph invariant for C, distinguishes among the 361 nonlinear codes C of kernel dimension κ obtained via Solov’eva-Phelps doubling construction, where 9 ≥ κ ≥ 5. Each of the 361 resulting graphs has most of its nonloop edges expressible in...

متن کامل

SQS-graph of Solov'eva-Phelps codes

A binary extended 1-perfect code C folds over its kernel via the Steiner quadruple systems associated with its codewords. The resulting folding, proposed as a graph invariant for C, distinguishes among the 361 nonlinear codes C of kernel dimension κ obtained via Solov’eva-Phelps doubling construction, where 9 ≥ κ ≥ 5. Each of the 361 resulting graphs has most of its nonloop edges expressible in...

متن کامل

Addendum to "On the Generalized Linear Equivalence of Functions over Finite Fields"

In this paper we discuss the example of APN permutation introduced in the paper “On the Generalized Linear Equivalence of Functions over Finite Fields” [1], presented at Asiacrypt 2004. We show that, although the method used to derive the function is correct, the permutation given in [1] is classically linearly equivalent to a power monomial. We therefore use the same method here to generate ot...

متن کامل

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


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

ژورنال

عنوان ژورنال: Advances in Mathematics of Communications

سال: 2011

ISSN: 1930-5346

DOI: 10.3934/amc.2011.5.543