Abstract
Let A3(n, d, w) denote the maximum cardinality of a ternary code with length n, minimum distance d, and constant Hamming weight w. Methods for proving upper and lower bounds on A3(n, d, w) are presented, and a table of exact values and bounds in the range n ≤ 10 is given.
Author supplied keywords
Cite
CITATION STYLE
APA
Östergård, P. R. J., & Svanström, M. (2002). Ternary constant weight codes. Electronic Journal of Combinatorics, 9(1 R), 1–23. https://doi.org/10.37236/1657
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free