A lower bound for ternary constant weight codes

Authors:
M. Svanstrom
Affiliations:
Dept. of Electr. Eng., Linkoping Univ.
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 5

A Class of Perfect Ternary Constant-Weight Codes

Designs, Codes and Cryptography
Code design as an optimization problem: from mixed integer programming to a high performance simplified randomized algorithm

AIKED'06 Proceedings of the 5th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases
Sets of frequency hopping sequences: bounds and optimal constructions

IEEE Transactions on Information Theory
Optimal ternary constant-weight codes of weight four and distance six

IEEE Transactions on Information Theory
Completely reducible super-simple designs with block size four and related super-simple packings

Designs, Codes and Cryptography

Quantified Score

Hi-index	754.96

Visualization

Abstract

We derive a lower bound for ternary constant-weight codes with minimum Hamming distance three. The bound is similar to a bound for binary constant-weight codes with minimum distance four described by Graham and Sloane (1980). It improves upon the Gilbert (1952) bound and coincides asymptotically with the Johnson (1962) bound for fixed weight as the codeword length tends to infinity