Binary non-antipodal completely regular codes are characterized. Using the result on nonexistence of nontrivial binary perfect codes, it is concluded that there are no unknown nontrivial non-antipodal completely regular binary codes with minimum distance d ≥ 3. The only such codes are halves and punctered halves of known binary perfect codes. Thus, new such codes with covering radiuses ρ = 2, 3...

with M (which is expected). However, as M increases beyond Ahstrart -Some new lower bounds are given for A(n,4, IV), the maximum number of codewords in a binary code of length n, min imum distance 4, and constant weight IV. In a number of cases the results significantly 1.0 improve on the best bounds previously known. h=O 1 .

A weighted Hamming metric is introduced in [4] and it showed that the binary generalized Goppa code is a perfect code in some weighted Hamming metric. In this paper, we study the weight structures which admit the binary Hamming code and the extended binary Hamming code to be perfect codes in the weighted Hamming metric. And, we also give some structures of a 2-perfect code and how to construct ...

The d i m m e drctrrbutron of a binary code C' is the sequence ( F ! ):lo defined as follows: Let B, ( u t ) he the number of codewords at distance J from the codeword U , and let B, be the average of B, ( I I ) over all n' in C. In this correspondence we study the distance distribution for codes of length t i and minimal distance h n , with h > 0 fixed and n X. Our main aim is to relate the si...

Let ( ) denote the maximum possible number of codewords in an ( ) binary code. We establish four new bounds on ( ), namely, (21 4) 43 689, (22 4) 87 378, (22 6) 6941, and (23 4) 173 491. Furthermore, using recent upper bounds on the size of constant-weight binary codes, we reapply known methods to generate a table of bounds on ( ) for all 28. This table extends the range of parameters compared ...

A program is outlined for the enumeration of unital 2-(28,4,1) designs that uses tactical decompositions de1ned by vectors of certain weight in the dual binary code of a design. A class of designs with a spread that covers a codeword of weight 12 is studied in detail. A total of 909 nonisomorphic designs are constructed that include the classical hermitian and Ree unitals, as well as many other...

We derive new asymptotic upper bounds on the generalized weights of a binary linear code of a given size. We also prove some asymptotic results on the distance distribution of binary codes.

A Method for the Construction of Minimum-Redundancy Codes PDF.HUFFMAN CODES. Corollary 28 Consider a coding from a length n vector of source symbols, x x1x2.xn, to a binary codeword of length lx. Then the.Correctness of the Huffman coding nitro pdf reader 32 bit 1 1 1 13 create pdf files algorithm. A binary code encodes each character as a binary. Code that encodes the file using as few bits as...