scientific article; zbMATH DE number 1498789
From MaRDI portal
Publication:4500980
Ternary constant-composition codes are studied. Let \(Z^n_q\) be the set of all vectors of length \(n\) over \(Z_q=\{0,1,\dots,q-1\}\), \(q\geq 2\). A ternary constant-composition code is a subset of \(Z^n_q\) in which every vector has \(w_1\) ones and \(w_2\) twos. New optimal constant-composition codes are constructed. New bounds of the maximal size of ternary constant-composition codes are obtained and a table of bounds of such codes of length \(n\leq 9\) is presented. For the entire collection see [Zbl 0918.00043].
Recommendations
- Bounds and constructions for ternary constant-composition codes
- Enumeration of optimal ternary constant-composition codes
- Constructions of ternary constant-composition codes with weight three
- Ternary constant weight codes
- A class of perfect ternary constant-weight codes
- scientific article; zbMATH DE number 2108129
- On a class of optimal constant weight ternary codes
- scientific article; zbMATH DE number 1522575
- On perfect ternary constant weight codes
- On constant composition codes
Cited in
(10)- Optimal ternary constant-composition codes with weight four and distance three
- Ternary codes and Jacobi forms
- Ternary constant weight codes
- Enumeration of optimal ternary constant-composition codes
- On constant-composition codes over Z/sub q/
- scientific article; zbMATH DE number 1189022 (Why is no real title available?)
- scientific article; zbMATH DE number 1522575 (Why is no real title available?)
- Bounds and constructions for ternary constant-composition codes
- Optimal ternary constant-composition codes with weight four and distance six
- Ternary trades and their codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500980)
