A reversible code over
Sunil Kumar Muttoo, Shankar Lal (1986)
Kybernetika
Similarity:
Sunil Kumar Muttoo, Shankar Lal (1986)
Kybernetika
Similarity:
Oya, Yusuke (2011)
Serdica Journal of Computing
Similarity:
We prove the nonexistence of [g3(6, d), 6, d]3 codes for d = 86, 87, 88, where g3(k, d) = ∑⌈d/3i⌉ and i=0 ... k−1. This determines n3(6, d) for d = 86, 87, 88, where nq(k, d) is the minimum length n for which an [n, k, d]q code exists.
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.
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...
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.
Östergård, Patric R.J., Svanström, Mattias (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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.
Maruta, Tatsuya (2013)
Serdica Journal of Computing
Similarity:
Dedicated to the memory of S.M. Dodunekov (1945–2012)Abstract. Geometric puncturing is a method to construct new codes. ACM Computing Classification System (1998): E.4. ∗This research was partially supported by Grant-in-Aid for Scientific Research of Japan Society for the Promotion of Science under Contract Number 24540138.
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.