Ternary constant weight codes.
Östergård, Patric R.J., Svanström, Mattias (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Östergård, Patric R.J., Svanström, Mattias (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Christine Bachoc, Philippe Gaborit (2000)
Journal de théorie des nombres de Bordeaux
Similarity:
In this paper we consider the extremal even self-dual -additive codes. We give a complete classification for length . Under the hypothesis that at least two minimal words have the same support, we classify the codes of length and we show that in length such a code is equivalent to the unique -hermitian code with parameters [18,9,8]. We construct with the help of them some extremal -modular lattices.
Gashkov, Igor, Larsson, Henrik (2007)
Serdica Journal of Computing
Similarity:
A new class of binary constant weight codes is presented. We establish new lower bound and exact values on A(n1 +n2; 2(a1 +a2); n2) ≥ min {M1;M2}+1, if A(n1; 2a1; a1 +b1) = M1 and A(n2; 2b2; a2 +b2) = M2, in particular, A(30; 16; 15) = 16 and A(33; 18; 15) = 11.
King, Oliver D. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gashkov, I., Taub, D. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Landjev, Ivan, Haralambiev, Kristiyan (2007)
Serdica Journal of Computing
Similarity:
In 1965 Levenshtein introduced the deletion correcting codes and found an asymptotically optimal family of 1-deletion correcting codes. During the years there has been a little or no research on t-deletion correcting codes for larger values of t. In this paper, we consider the problem of finding the maximal cardinality L2(n;t) of a binary t-deletion correcting code of length n. We construct an infinite family of binary t-deletion correcting codes. By computer search, we construct t-deletion...
Bogdanova, Galina (2000)
Serdica Mathematical Journal
Similarity:
This work was partially supported by the Bulgarian National Science Fund under Grant I–618/96. Optimal ternary constant-weight lexicogarphic codes have been constructed. New bounds for the maximum size of ternary constant-weight codes are obtained. Tables of bounds on A3 (n, d, w) are given for d = 3, 4, 6.
Solé, Patrick (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ward, Harold (2001)
Serdica Mathematical Journal
Similarity:
This paper surveys parts of the study of divisibility properties of codes. The survey begins with the motivating background involving polynomials over finite fields. Then it presents recent results on bounds and applications to optimal codes.
Eugeniusz Kuriata (2008)
International Journal of Applied Mathematics and Computer Science
Similarity:
This article presents problems of unequal information importance. The paper discusses constructive methods of code generation, and a constructive method of generating asymptotic UEP codes is built. An analog model of Hamming's upper bound and Hilbert's lower bound for asymptotic UEP codes is determined.
Cohn, Henry, Kumar, Abhinav (2007)
The New York Journal of Mathematics [electronic only]
Similarity:
Robin Chapman, Steven T. Dougherty, Philippe Gaborit, Patrick Solé (2002)
Journal de théorie des nombres de Bordeaux
Similarity:
The alphabet where is viewed here as a quotient of the ring of integers of by the ideal (3). Self-dual codes for the hermitian scalar product give -modular lattices by construction . There is a Gray map which maps self-dual codes for the Euclidean scalar product into Type III codes with a fixed point free involution in their automorphism group. Gleason type theorems for the symmetrized weight enumerators of Euclidean self-dual codes and the length weight enumerator of hermitian...