equidistant codes constant weight codes bounds of codes Mathematical Foundations of Informatics
Issue Date:
Oct-2008
Publisher:
Institute of Mathematics and Informatics at the Bulgarian Academy of Sciences
Citation:
Preprint
Series/Report no.:
2008;1
Abstract:
In this paper we consider the problem of finding bounds on the size of ternary and quaternary equidistant constant weight codes with 2 <= w < n <= 10. Optimal ternary and quaternary equidistant constant weight codes have been constructed by combinatorial and computer methods. Tables of the best known bounds for ternary and quaternary equidistant constant weight codes are presented. AMS Classifications: 94B65, 05E20.
