A class of perfect ternary constant-weight codes
1999 (English)In: Designs, Codes and Cryptography, ISSN 0925-1022, Vol. 18, no 1-3, 223-229 p.Article in journal (Refereed) Published
We construct a class of perfect ternary constant-weight codes of length 2(r), weight 2(r)-1 and minimum distance 3. The codes have 2(2r)-1 codewords. The construction is based on combining cosets of binary Hamming codes. As a special case, for r=2 the construction gives the subcode of the tetracode consisting of its nonzero codewords. By shortening the perfect codes, we get further optimal codes.
Place, publisher, year, edition, pages
1999. Vol. 18, no 1-3, 223-229 p.
ternary constant-weight codes, optimal nonlinear codes, perfect codes
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-49864OAI: oai:DiVA.org:liu-49864DiVA: diva2:270760