On mobile sets in the binary hypercube

نویسندگان

  • Yuriy Vasil'ev
  • Sergey V. Avgustinovich
  • Denis S. Krotov
چکیده

If two distance-3 codes have the same neighborhood, then each of them is called a mobile set. In the (4k + 3)-dimensional binary hypercube, there exists a mobile set of cardinality 2 · 6 that cannot be split into mobile sets of smaller cardinalities or represented as a natural extension of a mobile set in a hypercube of

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

ثبت نام

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

منابع مشابه

DyVSoR: dynamic malware detection based on extracting patterns from value sets of registers

To control the exponential growth of malware files, security analysts pursue dynamic approaches that automatically identify and analyze malicious software samples. Obfuscation and polymorphism employed by malwares make it difficult for signature-based systems to detect sophisticated malware files. The dynamic analysis or run-time behavior provides a better technique to identify the threat. In t...

متن کامل

A New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure

The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...

متن کامل

Bernoulli Mixture Models for Markov Blanket Filtering and Classification

This paper presents the use of Bernoulli mixture models for Markov blanket filtering and classification of binary data. Bernoulli mixture models can be seen as a tool for partitioning an n-dimensional hypercube, identifying regions of high data density on the corners of the hypercube. Once Bernoulli mixture models are computed from a training dataset we use them for determining the Markov blank...

متن کامل

On the $k$-error linear complexity for $p^n$-periodic binary sequences via hypercube theory

The linear complexity and the k-error linear complexity of a sequence are important security measures for key stream strength. By studying sequences with minimum Hamming weight, a new tool called hypercube theory is developed for p-periodic binary sequences. In fact, hypercube theory is very important in investigating critical error linear complexity spectrum proposed by Etzion et al. To demons...

متن کامل

Fuzzy number-valued fuzzy ‎relation

It is well known fact that binary relations are generalized mathematical functions. Contrary to functions from domain to range, binary relations may assign to each element of domain two or more elements of range. Some basic operations on functions such as the inverse and composition are applicable to binary relations as well. Depending on the domain or range or both are fuzzy value fuzzy set, i...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • CoRR

دوره abs/0802.0003  شماره 

صفحات  -

تاریخ انتشار 2008