On Perfect-Like Binary and Non-Binary Linear Codes – A Brief Survey
نویسندگان
چکیده
This work presents a brief survey on codes (with respect to Hamming metric) which are perfect-like i.e. codes which are capable to correct a given set of error vectors and no others. Several kinds of such codes which exist in the literature have been discussed and possibilities of the existence of such codes in some cases have been explored. 2000 Mathematics Subject Classification: 94B25, 94B60, 94-02
منابع مشابه
The (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملOn Z2k-Dual Binary Codes
A new generalization of the Gray map is introduced. The new generalization Φ : Z 2 → Z k−1 n 2 is connected with the known generalized Gray map φ in the following way: if we take two dual linear Z2k -codes and construct binary codes from them using the generalizations φ and Φ of the Gray map, then the weight enumerators of the binary codes obtained will satisfy the MacWilliams identity. The cla...
متن کاملThe partial order of perfect codes associated to a perfect code
It is clarified whether or not “full rank perfect 1-error correcting binary codes act like primes in the family of all perfect 1-error correcting binary codes”. Thereby the well known connection between perfect 1-error correcting binary codes and tilings will be discussed and used.
متن کاملZ4-Linear Perfect Codes
For every n = 2 k ≥ 16 there exist exactly ⌊(k + 1)/2⌋ mutually nonequiv-alent Z 4-linear extended perfect codes with distance 4. All these codes have different ranks. Codes represented in such a manner are called Z 4-linear. In [5] it is shown that the extended Golay code and the extended Hamming (n, 2 n−log 2 n−1 , 4)-codes (of length n and cardinality 2 n−log 2 n−1 , with distance 4) for eve...
متن کاملBinary and ternary quasi-perfect codes with small dimensions
The aim of this work is a systematic investigation of the possible parameters of quasi-perfect (QP) binary and ternary linear codes of small dimensions and preparing a complete classification of all such codes. First we give a list of infinite families of QP codes which includes all binary, ternary and quaternary codes known to is. We continue further with a list of sporadic examples of binary ...
متن کامل