A new table of constant weight codes of length greater than 28.
Smith, D.H., Hughes, L.A., Perkins, S. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Smith, D.H., Hughes, L.A., Perkins, S. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tomasz Kajdanowicz, Przemysław Kazienko (2012)
International Journal of Applied Mathematics and Computer Science
Similarity:
A framework for multi-label classification extended by Error Correcting Output Codes (ECOCs) is introduced and empirically examined in the article. The solution assumes the base multi-label classifiers to be a noisy channel and applies ECOCs in order to recover the classification errors made by individual classifiers. The framework was examined through exhaustive studies over combinations of three distinct classification algorithms and four ECOC methods employed in the multi-label classification...
Wieb Bosma (2001)
Journal de théorie des nombres de Bordeaux
Similarity:
An exact analysis is given of the benefits of using the non-adjacent form representation for integers (rather than the binary representation), when computing powers of elements in a group in which inverting is easy. By counting the number of multiplications for a random exponent requiring a given number of bits in its binary representation, we arrive at a precise version of the known asymptotic result that on average one in three signed bits in the non-adjacent form is non-zero. This...
Östergård, Patric R.J., Svanström, Mattias (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Gashkov, I., Taub, D. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
James Korsh, Paul LaFollette, Seymour Lipschutz (2011)
Publications de l'Institut Mathématique
Similarity:
Michał Kolarz (2011)
RAIRO - Theoretical Informatics and Applications
Similarity:
We consider directed figures defined as labelled polyominoes with designated start and end points, with two types of catenation operations. We are especially interested in codicity verification for sets of figures, and we show that depending on the catenation type the question whether a given set of directed figures is a code is decidable or not. In the former case we give a constructive proof which leads to a straightforward algorithm.
J. Ušan (1978)
Matematički Vesnik
Similarity:
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.
How, Guan Aun, Ang, Miin Huey (1998)
Bulletin of the Malaysian Mathematical Society. Second Series
Similarity:
Klaus Ritter, Stefan Schaffler, Thomas F. Sturm (1998)
The Yugoslav Journal of Operations Research
Similarity:
Dontcheva, Radinka (2001)
Serdica Mathematical Journal
Similarity:
∗ This work was supported in part by the Bulgarian NSF under Grant MM-901/99 In this paper we prove that up to equivalence there exist 158 binary [70, 35, 12] self-dual and 119 binary [72, 36, 12] self-dual doubly-even codes all of which have an automorphism of order 23 and we present their construction. All these codes are new.
Baicheva, Tsonka, Topalova, Svetlana (2015)
Serdica Journal of Computing
Similarity:
Dedicated to the memory of the late professor Stefan Dodunekov on the occasion of his 70th anniversary. We classify up to multiplier equivalence maximal (v, 3, 1) optical orthogonal codes (OOCs) with v ≤ 61 and maximal (v, 3, 2, 1) OOCs with v ≤ 99. There is a one-to-one correspondence between maximal (v, 3, 1) OOCs, maximal cyclic binary constant weight codes of weight 3 and minimum dis tance 4, (v, 3; ⌊(v − 1)/6⌋) difference packings, and maximal (v, 3, 1) binary cyclically permutable...