A Class of Perfect Ternary Constant-Weight Codes

Authors:
Mattias Svanström
Affiliations:
Department of Electrical Engineering, Linköping University, SE-581 83 Linköping, Sweden
Venue:
Designs, Codes and Cryptography
Year:
1999

Citing 4
Cited 4

Sphere-packings, lattices, and groups

Sphere-packings, lattices, and groups
Optimal constant weight codes over Zk and generalized designs

Discrete Mathematics
A lower bound for ternary constant weight codes

IEEE Transactions on Information Theory
On the constructions of constant-weight codes

IEEE Transactions on Information Theory

Inductive Constructions of Perfect Ternary Constant-Weight Codes with Distance 3

Problems of Information Transmission
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	0.12

Visualization

Abstract

Periodic binary (plus-minus)sequences all but one of whose out-of-phase autocorrelation coefficientsare zero are studied by Wolfman [6]. Using the equivalence ofthese almost perfect sequences to certain cyclic divisible differencesets (noted ...