On the dual distance and the gap of a binary code
نویسندگان
چکیده
The coset graph of a nondegenerate cyclic code is orbital regular. This yields a lower bound on its average distance, a parameter which measures the average distortion of a code used in data compression. Using results of Shahrokhi and Sz&kely we generalize this bound to binary codes with a transitive automorphism group. @ 1998 Elsevier Scienc B.V. All rights reserved
منابع مشابه
DETERMINATION OF OPTIMAL DISTANCE BETWEEN TWO ADJACENT STEEL FRAMES CONSIDERING STRUCTURE-SOIL-STRUCTURE INTERACTION EFFECTS USING PSO
This paper aims to obtain the optimal distance between the adjacent structures using Particle Swarm Optimization (PSO) algorithm considering structure-soil-structure systems; The optimization algorithm has been prepared in MATLAB software and connected into OpenSees software (where the structure-soil-structure system has been analyzed by the direct approach). To this end, a series of adjacent s...
متن کاملComparative study of ultrasonic vibrations assisted EDM and magnetic field assisted EDM processes
In this investigation, the material removal rate, tool wear rate and surface integrity obtained by EDM, ultrasonic vibrations assisted EDM and magnetic field assisted EDM were studied and compared with together to show the quality of the effects of applying each of ultrasonic vibrations to tool and magnetic field around gap distance of EDM process on material removal rate, tool wear rate, and s...
متن کاملEulerian Lagrangian Simulation of Particle Capture and Dendrite Formation on Binary Fibers
The capture efficiency of the small aerosol particle is strongly influenced by the structure of fibrous layers. This study presents particle deposition and dendrite formation on different arrangements of binary fibers. 2-D numerical simulation is performed using the open source software of OpenFOAM. In the instantaneous filtration of a single fiber, obtained results are in good agreement with th...
متن کاملConstruction of Linear Codes Having Prescribed Primal-dual Minimum Distance with Applications in Cryptography
A method is given for the construction of linear codes with prescribed minimum distance and also prescribed minimum distance of the dual code. This works for codes over arbitrary finite fields. In the case of binary codes Matsumoto et al. showed how such codes can be used to construct cryptographic Boolean functions. This new method allows to compute new bounds on the size of such codes, extend...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 192 شماره
صفحات -
تاریخ انتشار 1998