A decoding scheme for the 4-ary lexicodes with .
A generalized Lloyd theorem and mixed perfect codes.
A Loopless Implementation of a Gray Code for Signed Permutations
A new table of constant weight codes of length greater than 28.
Adaptive identification in Torii in the King lattice.
Association schemes and MacWilliams dualities for generalized Niederreiter-Rosenbloom-Tsfasman posets [Book]
Balanced Gray codes.
Classification of Maximal Optical Orthogonal Codes of Weight 3 and Small Lengths
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 constant...
Construction of codes identifying sets of vertices.
Creation of unequal error protection codes for two groups of symbols
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.
Disjunctive languages and compatible orders
Distances invariantes et L-cliques sur certains demi-groupes finis
Es gibt keinen optimalen (n + 2,3)-Code einer ungeraden Ordnung n.
Generating functions for the number of permutations with limited displacement.
Group codes defined using extra-special -group of order .
Identifying codes of Cartesian product of two cliques of the same size.
Kouzlo Fibonacciho kódování
Maximal circular codes versus maximal codes
We answer to a question of De Luca and Restivo whether there exists a circular code which is maximal as circular code and not as code.
Maximal circular codes versus maximal codes
We answer to a question of De Luca and Restivo whether there exists a circular code which is maximal as circular code and not as code.
Metric coset schemes revisited
An Abelian scheme corresponds to a special instance of what is usually named a Schur-ring. After the needed results have been quoted on additive codes in Abelian schemes and their duals, coset configurations, coset schemes, metric schemes and distance regular graphs, partition designs and completely regular codes, we give alternative proofs of some of those results. In this way we obtain a construction of metric Abelian schemes and an algorithm to compute their intersection matrices.